Tontti

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

using namespace std;

int main() {
	cin.sync_with_stdio(false);
	int i, j, n, m, k, x, q, w, o, p, nn, mm, mf;
	int sz, s;
	cin >> n >> m >> k;
	char input[n][m];
	nn = 1;
	mm = 1;
	unsigned int v;
	v = n;
	while (v >>= 1) 
	{
		nn++;
	}
	v = m;
	while (v >>= 1) 
	{
		mm++;
	}
	mf = 1 << mm;
	int kq = mf*n;
	char a[kq];
	int f[kq];
	short ag[kq];
	short ah[n];	
	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<<mm)+j] = !(input[i][j]=='.');
			f[(i<<mm)+j] = 0;
			if(k<2)
				x += a[(i<<mm)+j]^k^1;
		}
	int c = max(sz,2);
	int g = 0, h = 0, d, z, first = 1, scale = 1;
	for (s = c; s <= min(n,m)-1; s++) {
		//printf("%d ",s);
		z = s - 1;
		first = 1;
		if (s == c) {
			for (i = z; i < n; i++) {
				w = 0;
				q = (i<<mm)+m-1;
				for (o = 1; o <= s; o++)
					w += a[q-o];
				ah[i] = w;
				if (i > 0) {
					q = i << mm;
					w = q - (s << mm);
					for (o = 0; o < s; o++, q++, w++)
						h += (a[q] - a[w]);
					g = h;
				}
				scale = 0;
				for (j = z; j < m; j++) {
					d = (i<<mm)+j;
					if (scale) {
						p = ((i-z)<<mm)+j;
						for (o = 0; o < s; o++, p+=mf) {
							g += (a[p] - a[p-s]);
						}
					} else if (first) {
						first = 0;
						g = f[d];
						o = s<<mm;
						for (q = 0; q < o; q+=mf) {
							for (w = 0; w < s; w++) {
								g += a[q+w];
							}
						}
						h = g;
						scale = 1;
					} else
						scale = 1;
					f[d] = g;
					//printf("s:%d\ti:%d\tj:%d\tn:%d\tm:%d\tf:%d\n",s,i,j,n,m,f[d]);
					x += (g == k);
				}
			}
		} else {
			int v = (n - 1) << mm;
			g = 0;
			h = 0;
			for (i = n - 1; i >= z; i--) {
				j = m - 1;
				int d = v+j;
				int w = f[d-mf-1] + a[d];
				g = 0;
				h = ah[i];
				p = mf;
				if (s > c + 1) {
					h += a[d-z];
				}
				for (o = 1; o < s; o++, p+=mf) {
					g += a[d-p];
				}
				ag[d] = g;
				ah[i] = h;
				w += g + h;
				x += (w == k);
				f[d] = w;
				d--;
				j--;
				for (; j >= z; j--) {
					char ad = a[d];
					p = d - mf;
					w = f[p-1] + ad;
					q = d - (z << mm);
					if (i == n - 1) {
						g = 0;
						for (o = p; o >= q; o -= mf) {
							g += a[o];
						}
					} else {
						g = ag[d+mf] + a[q] - ad;
					}
					h += a[d-z] - ad;
					w += g + h;
					x += (w == k);
					ag[d] = g;
					f[d] = w;
					d--;
				}
				v -= mf;
			}
			/*for (i = n - 1; i >= z; i--) {
				q = (i*m);
				for (j = m - 1; j >= z; j--)
					ag[q+j] = ah[q+j];
			}*/
		}
		/*for (i = 0; i < n; i++) {
			for (j = 0; j < m; j++) {
				printf("%d",f[i*m+j]);
			}
			printf("\n");
		}
		printf("\n");*/
	}
	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: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

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