Tontti

#!/usr/bin/python3
import math
n, m, x = map(int, input().split())
#print(n,m,x)
a=[]
for i in range(0,n):
	a.append(list(map(int, input().replace('.','0').replace('*','1'))))
#a=a.replace('.','0').replace('*','1')
 
 
def sumTrees(x,y):
	trees=0
	b=[]
	for i in range(0,y):
		i1=i-1
		b.append([])
		ai=list(a[i])
		for j in range(0,x):
			trees+=ai[j]
			if i>0:
				b[i].append(trees+b[i1][j])
			else:
				b[i].append(trees)
		trees=0
	return b
 
b=sumTrees(m,n)
 
#for i in b:
#	print(i)
#for i in range(0,n):
#	ai=a[i]
#	b.append([])
#
#	for j in range(0,m):
#		b[i]=ai[j]
#print(a)
 
 
#for i in range(1, limit+1):
#	pass
#@profile
 
#@profile
def countTrees(x,x1,y,y1,size):
	#trees=0
	if not (x==0 or y==0):
		trees=b[y+size][x+size]-b[y1][x+size]-b[y+size][x1]+b[y1][x1]
	elif x==0 and y==0:
		trees=b[size][size]
	elif x==0:
		trees=b[y+size][size]-b[y1][size]
	else:
		trees=b[size][x+size]-b[size][x1]
 
	return trees
 
def possibleSquares(ny,mx,sqrt):
	if ny<mx:
		limit=ny
	else:
		limit=mx
	return range(sqrt-1,limit)
 
#print(countTrees(2,0,3))
answer=0
sqrt=int(math.sqrt(x))
for i in range(1, m):
	mx=m-i
	i1=i-1
	for j in range(1,n):
		j1=j-1
		bj1=b[j1]
		trees = 0
		ny=n-j
		if ny<mx:
			limit=ny
		else:
			limit=mx
		for k in range(sqrt-1,limit):
 
#		for k in possibleSquares(n-j,mx, sqrt):
			#trees = countTrees(i,i1,j,j1,k)
			#if not (i==0 or j==0):
			trees=b[j+k][i+k]-bj1[i+k]-b[j+k][i1]+bj1[i1]
 
			#if i==0 and j==0:
			#	trees=b[k][k]
			#elif i==0:
			#	trees=b[j+k][k]-b[j1][k]
			#else:
			#	trees=b[k][i+k]-b[k][i1]
 
			if trees > x:
				break
			elif trees == x:
				answer+=1
i=0
mx=m
for j in range(0,n):
		j1=j-1
		bj1=b[j1]
		trees = 0
		ny=n-j
		if j==0:
			j0=True
		if ny<mx:
			limit=ny
		else:
			limit=mx
		for k in range(sqrt-1,limit):
 
#		for k in possibleSquares(n-j,mx, sqrt):
			#trees = countTrees(i,i1,j,j1,k)
			#if not (i==0 or j==0):
			#trees=b[j+k][i+k]-bj1[i+k]-b[j+k][i1]+bj1[i1]
 
			if j0:
				trees=b[k][k]
			else:
				trees=b[j+k][k]-b[j1][k]
#			else:
#				trees=b[k][i+k]-b[k][i1]
 
			if trees > x:
				break
			elif trees == x:
				answer+=1
 
j=0
for i in range(1,m):
		mx=m-i
		i1=i-1
		j1=j-1
		bj1=b[j1]
		trees = 0
		ny=n-j
		#if j==0:
		#	j0=True
		if ny<mx:
			limit=ny
		else:
			limit=mx
		for k in range(sqrt-1,limit):
 
#		for k in possibleSquares(n-j,mx, sqrt):
			#trees = countTrees(i,i1,j,j1,k)
			#if not (i==0 or j==0):
			#trees=b[j+k][i+k]-bj1[i+k]-b[j+k][i1]+bj1[i1]
			trees=b[k][i+k]-b[k][i1]
			#if j0:
			#	trees=b[k][k]
			#else:
			#	trees=b[j+k][k]-b[j1][k]
#			else:
#				trees=b[k][i+k]-b[k][i1]
 
			if trees > x:
				break
			elif trees == x:
				answer+=1
print(answer)
 
 

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

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