Tontti

#include <iostream>
#include <math.h>
#include <stdio.h>

using namespace std;

int main() {
	cin.sync_with_stdio(false);
	int i, j, n, m, k, x, q, w;
	int sz, s;
	cin >> n >> m >> k;
	char input[n][m];
	int a[n*m];
	int f[n*m];
	for (i = 0; i < n; i++)
		cin >> input[i];
	sz = (int)ceil(sqrt((double)k));
	x = 0;
	for (i = 0; i < n; i++)
		for (j = 0; j < m; j++) {
			a[i*n+j] = !(input[i][j]=='.');
			f[i*n+j] = 0;
			if(k<2)
				x += a[i*n+j]^k^1;
		}
	int c = max(sz,2);
	for (s = c; s <= min(n,m); s++) {
		//printf("%d ", s);
		for (i = s - 1; i < n; i++) {
			int d = i*n+s-1;
			for (j = s - 1; j < m; j++) {
				int t = f[d];
				if (s == c) {
					int p = (i - s + 1) * n;
					for (q = i - s + 1; q <= i; q++) {
						int e = p + j - s + 1;
						for (w = j - s + 1; w <= j; w++) {
							t += a[e++];
						}
						p+=n;
					}
					f[d] = t;
				} else {
					for (q = 0; q < s - 1; q++) {
						t += a[d-s*n+n-q];
						t += a[d-q*n-s+1];
					}
					f[d] = t = (t+a[d-s*n+n-s+1]);
				}
				if (t == k) x++;
				d++;
			}
		}
	}
	cout << x << "\n";
	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED