Submission #1248756


Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<limits.h>
#include<string>
using namespace std;

int rui[500][501];
signed main() {
	int a, b, c; cin >> a >> b >> c;
	int ans = 0;
	for (int i = 0; i < a; i++) {
		string d; cin >> d;
		int e = 0;
		for (int f = 0; f < b; f++) {
			if (d[f] == 'x')e++;
			rui[i][f + 1] = e;
		}
	}
	for (int i = c - 1; i <= a - c; i++) {
		for (int j = c - 1; j <= b - c; j++) {
			bool OK = true;
			for (int k = i - (c - 1); k < i + c; k++) {
				if (rui[k][j + c - abs(i - k)] - rui[k][j - c + abs(i - k) + 1]) { OK = false; break; }
			}
			if (OK)ans++;
		}
	}
	cout << ans << endl;
}

Submission Info

Submission Time
Task C - 菱型カウント
User naoki2016
Language C++14 (Clang 3.8.0)
Score 100
Code Size 668 Byte
Status AC
Exec Time 52 ms
Memory 1280 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 23
AC × 43
Set Name Test Cases
Sample subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt
Subtask1 subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt
Subtask2 subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt, subtask2-16.txt, subtask2-17.txt, subtask2-18.txt, subtask2-19.txt, subtask2-20.txt
Case Name Status Exec Time Memory
subtask0-sample01.txt AC 8 ms 888 KB
subtask0-sample02.txt AC 1 ms 256 KB
subtask0-sample03.txt AC 1 ms 256 KB
subtask1-01.txt AC 1 ms 256 KB
subtask1-02.txt AC 1 ms 256 KB
subtask1-03.txt AC 1 ms 256 KB
subtask1-04.txt AC 1 ms 256 KB
subtask1-05.txt AC 1 ms 384 KB
subtask1-06.txt AC 1 ms 384 KB
subtask1-07.txt AC 1 ms 384 KB
subtask1-08.txt AC 1 ms 384 KB
subtask1-09.txt AC 1 ms 384 KB
subtask1-10.txt AC 1 ms 384 KB
subtask1-11.txt AC 1 ms 384 KB
subtask1-12.txt AC 1 ms 384 KB
subtask1-13.txt AC 1 ms 384 KB
subtask1-14.txt AC 1 ms 384 KB
subtask1-15.txt AC 1 ms 384 KB
subtask1-16.txt AC 1 ms 384 KB
subtask1-17.txt AC 1 ms 384 KB
subtask1-18.txt AC 1 ms 384 KB
subtask1-19.txt AC 1 ms 384 KB
subtask1-20.txt AC 1 ms 384 KB
subtask2-01.txt AC 7 ms 768 KB
subtask2-02.txt AC 5 ms 768 KB
subtask2-03.txt AC 2 ms 896 KB
subtask2-04.txt AC 12 ms 896 KB
subtask2-05.txt AC 48 ms 1280 KB
subtask2-06.txt AC 52 ms 1280 KB
subtask2-07.txt AC 15 ms 1280 KB
subtask2-08.txt AC 37 ms 1280 KB
subtask2-09.txt AC 37 ms 1280 KB
subtask2-10.txt AC 15 ms 1280 KB
subtask2-11.txt AC 22 ms 1280 KB
subtask2-12.txt AC 21 ms 1280 KB
subtask2-13.txt AC 24 ms 1280 KB
subtask2-14.txt AC 14 ms 1280 KB
subtask2-15.txt AC 16 ms 1280 KB
subtask2-16.txt AC 16 ms 1280 KB
subtask2-17.txt AC 19 ms 1280 KB
subtask2-18.txt AC 20 ms 1280 KB
subtask2-19.txt AC 24 ms 1280 KB
subtask2-20.txt AC 45 ms 1280 KB