Tontti

import java.util.ArrayList;
import java.util.TreeMap;
 
 
public class Main {
 
	public static void main(String[] args) {
		IO io = new IO();
		
		int n = io.nextInt();
		int m = io.nextInt();
		int x = io.nextInt();
		
		ArrayList<Integer> puut = new ArrayList<>();
		
		for (int i = 0; i < n; i++) {
			String rivi = io.next();
			for (int j = 0; j < m; j++) {
				int ind = j + i * m;
				if(rivi.charAt(j) == '*') puut.add(ind);
			}
		}
		
		TreeMap<Integer, TreeMap<Integer, Integer>> neliot = new TreeMap<>();
		for (int i = 0; i < n*m; i++) {
			neliot.put(i, new TreeMap<>());
		}
		
		int laskuri = 0;
		
		for (int i = 1; i <= Math.min(n, m); i++) {
			if(x > i*i) continue;
			for (int p : puut) {
				int h = p/m;
				int w = p%m;
				
				for (int j = h; j >= Math.max(0, h-i+1); j--) {
					for (int j2 = w; j2 >= Math.max(0, w-i+1); j2--) {
						int ind = j2 + j * m;
						if(j2 + i - 1 >= m || j + i - 1 >= n) continue; 
						if(!neliot.get(ind).containsKey(i)) neliot.get(ind).put(i, 0);
						int uusi = neliot.get(ind).get(i) + 1;
						neliot.get(ind).put(i, uusi);
					}
				}
			}
		}
		
		for (int key : neliot.keySet()) {
			for (int key2 : neliot.get(key).keySet()) {
				if(x == neliot.get(key).get(key2)) laskuri++;
			}
		}
		
		io.println(laskuri);
		
		io.close();
	}
 
}

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