Tontti

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
 
 
/**
 *
 * @author alexey
 */
import java.util.*;
 
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.StringTokenizer;
 
public class Datatahti20163 {
 
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
 
        IO io = new IO();
        int h = io.nextInt();
        int w = io.nextInt();
        int t = io.nextInt();
        int min = Math.min(h, w);
        int[][] forest = new int[h][w];
        int sqw[][] = new int[w + 2][w + 2];
        int sqh[][] = new int[h + 2][h + 2];
 
        int answer = 0;
        boolean stop = false;
 
        int iq = 0;
 
        while (iq < h) {
            String newline = io.next();
            for (int j = 0; j < w; j++) {
                if (newline.charAt(j) == '*') {
                    forest[iq][j] = 1;
                } else {
                    forest[iq][j] = 0;
                }
            }
            iq++;
        }
 
        int s = 0;
        boolean overload = false;
 
        int a = 0;
        for (int i = 0; i < w; i++) {
            sqw[i][0] = forest[0][i];
        }
 
        for (int i = 1; i < h; i++) {
            sqh[i][0] = forest[i][0];
        }
 
        int x = 0;
        int y = 0;
        int z = 0;
        for (int i = 1; i < min; i++) {
 
            for (int j = i; j < w; j++) {
 
                x = sqw[j - 1][0];
                a = forest[i][j];
                for (int k = 1; k < i + 1; k++) {
 
                    a += forest[i - k][j] + forest[i][j - k];
                    y = x;
                    x = sqw[j - 1][k];
                    if (sqw[j - 1][k] == -1 || a + y > t) {
                        sqw[j - 1][k] = -1;
                    }
                    sqw[j - 1][k] = a + y;
                    if (sqw[j - 1][k] == t) {
                        answer++;
                    }
 
                }
                sqw[j - 1][0] = forest[i][j];
                s = 0;
                a = 0;
            }
 
            for (int j = i + 1; j < h; j++) {
                //System.out.println(forest[j][i][0]);
 
                x = sqh[j][0];
                a = forest[j][i];
 
                for (int k = 1; k < i + 1; k++) {
 
                    a += forest[j - k][i] + forest[j][i - k];
                    y = x;
                    x = sqh[j][k];
                    if (sqw[j][k] == -1 || a + y > t) {
                        sqw[j][k] = -1;
                    }
                    sqh[j][k] = a + y;
                    if (sqh[j][k] == t) {
                        answer++;
                    }
 
                }
                sqw[j][0] = forest[j][1];
                s = 0;
                a = 0;
            }
 
        }
 
        io.println(answer);
        io.close();
    }
 
    static class IO extends PrintWriter {
 
        private BufferedReader r;
        private StringTokenizer s;
 
        public IO() {
            super(new BufferedOutputStream(System.out));
            r = new BufferedReader(new InputStreamReader(System.in));
        }
 
        public String nextLine() {
            String s = null;
            try {
                s = r.readLine();
            } catch (Exception e) {
            }
            if (s == null) {
                throw new NoSuchElementException();
            }
            return s;
        }
 
        public String next() {
            while (s == null || !s.hasMoreElements()) {
                s = new StringTokenizer(nextLine());
            }
            return s.nextToken();
        }
 
        public int nextInt() {
            return Integer.parseInt(next());
        }
    }
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

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