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 = 1; i < min; i++) {
            
            for (int j = i ; j < w; j++) {
                //System.out.println(forest[i][j][0]);
               
               
                
                a=0;
                for (int k = 1; k < i+1; k++) {
                    
                    s=forest[i][j][0];
                    a+=forest[i-k][j][0]+forest[i][j-k][0];
                    if(forest[i-1][j-1][k-1]==-1){
                        forest[i][j][k]=-1; 
                       break;
                    }
                    s+=a+forest[i-1][j-1][k-1];
                    if(s>t){
                       forest[i][j][k]=-1; 
                       break;
                    }
                    forest[i][j][k]=s;
                    
                    if(s==t){
                        answer++;
                    }
                }
                s=0;
                a=0;
            }
            for (int j = i+1; j < h; j++) {
                //System.out.println(forest[j][i][0]);
                 
                
               
                a=0;
                for (int k = 1; k < i+1; k++) {
                    s=forest[j][i][0];
                    a+=forest[j-k][i][0]+forest[j][i-k][0];
                    if(forest[j-1][i-1][k-1]==-1){
                        forest[j][i][k]=-1; 
                       break;
                    }
                    s+=a+forest[j-1][i-1][k-1];
                    if(s>t){
                       forest[j][i][k]=-1; 
                       break;
                    }
                    forest[j][i][k]=s;
                    
                    if(s==t){
                        answer++;
                    }
                }
                s=0;
                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++) {
                //System.out.println(forest[i][j][0]);
                
                z=sqw[j-1][0];
                y=sqw[j-1][1];
                a=forest[i][j];
                for (int k = 1; k < i+1; k++) {
                    
                    a+=forest[i-k][j]+forest[i][j-k];
                    x=y;
                    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]=z+forest[i][j];
                s=0;
                a=0;
            }
            
            for (int j = i+1; j < h; j++) {
                //System.out.println(forest[j][i][0]);
                 z=sqh[j][0];
                y=sqh[j][1];
                a=forest[j][i];
                
                for (int k = 1; k < i+1; k++) {
                    
                    a+=forest[j-k][i]+forest[j][i-k];
                    x=y;
                    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]=z+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: WRONG ANSWER

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