CSES - Datatähti 2016 alku - Results
Submission details
Task:Tontti
Sender:Perdex
Submission time:2015-10-02 14:03:58
Language:Java
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.17 s1details
#20.17 s1details
#3ACCEPTED0.16 s1details
#40.17 s1details
#50.18 s1details
#60.44 s2details
#70.41 s2details
#80.45 s2details
#90.44 s2details
#100.41 s2details
#11--3details
#12--3details
#13--3details
#14--3details
#15--3details

Code


public class Tontti{
    
    public static void main(String[] args){
        IO io = new IO();
        
        int n = io.nextInt(), m = io.nextInt(), x = io.nextInt();
        
        String row;
        
        int[][] metaTrees = new int[n + 1][m + 1];
        
        for(int i = 0; i < n; i++){
            row = io.next();
            for(int j = 0; j < m; j++){
                metaTrees[i + 1][j + 1] = metaTrees[i][j + 1] + metaTrees[i + 1][j] - metaTrees[i][j];
                if(row.charAt(j) == '*')
                    metaTrees[i + 1][j + 1]++;
            }
        }
        
//        for(int i = 0; i < n; i++){
//            for(int j = 0; j < m; j++){
//                io.print(metaTrees[i + 1][j + 1] + " ");
//            }
//            io.println();
//        }
        
        
        int ans = 0;
        
        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                
                for(int k = 0; i + k < n && j + k < m; k++){
                    
                    int treeCount = metaTrees[i + k + 1][j + k + 1] 
                            - metaTrees[i + k + 1][j]
                            - metaTrees[i][j + k + 1]
                            + metaTrees[i][k];
                    
                    if(treeCount > x)
                        break;
                    if(treeCount == x)
                        ans++;
                }
                
            }
        }
        
        io.print(ans);
        io.close();
    }
    
}

Test details

Test 1

Group: 1

Verdict:

input
10 10 1
......*...
.......*..
*..*....*.
*....*....
...

correct output
94

user output
56

Test 2

Group: 1

Verdict:

input
10 10 5
**********
**********
**********
**********
...

correct output
0

user output
4

Test 3

Group: 1

Verdict: ACCEPTED

input
10 10 10
**...*...*
*..*.**.*.
...**.*..*
*...**.*..
...

correct output
4

user output
4

Test 4

Group: 1

Verdict:

input
10 10 5
****......
*.*.**..**
....*.*..*
...*.***..
...

correct output
16

user output
7

Test 5

Group: 1

Verdict:

input
10 10 2
**.***..*.
...*.*....
.***.*...*
***.***..*
...

correct output
30

user output
17

Test 6

Group: 2

Verdict:

input
500 500 1
.................................

correct output
9552040

user output
6097244

Test 7

Group: 2

Verdict:

input
500 500 5
.................................

correct output
1536063

user output
808059

Test 8

Group: 2

Verdict:

input
500 500 25000
**...*...**..*.*..*.**.*..*.*....

correct output
288

user output
315

Test 9

Group: 2

Verdict:

input
500 500 12500
**.**.*..*...*.**...*.***........

correct output
786

user output
436

Test 10

Group: 2

Verdict:

input
500 500 5000
.*.*.**..*.*.**.**..*..**...*....

correct output
1763

user output
659

Test 11

Group: 3

Verdict:

input
2000 2000 1
.................................

correct output
489611392

user output
(empty)

Test 12

Group: 3

Verdict:

input
2000 2000 5
.................................

correct output
120725884

user output
(empty)

Test 13

Group: 3

Verdict:

input
2000 2000 400000
..*..**.**.**.*.***...**.*..**...

correct output
1849

user output
(empty)

Test 14

Group: 3

Verdict:

input
2000 2000 200000
***.*....*.*..*....**..*..*.*....

correct output
2665

user output
(empty)

Test 15

Group: 3

Verdict:

input
2000 2000 80000
**.**...*.***.**....**.*....*....

correct output
5587

user output
(empty)