CSES - Datatähti 2016 alku - Results
Submission details
Task:Tontti
Sender:Perdex
Submission time:2015-10-08 13:18:53 +0300
Language:Java
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.16 s1details
#20.17 s1details
#30.18 s1details
#40.17 s1details
#50.18 s1details
#60.30 s2details
#70.29 s2details
#80.28 s2details
#90.29 s2details
#100.28 s2details
#11--3details
#12--3details
#130.60 s3details
#140.67 s3details
#150.75 s3details

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, treeCount, max, min, k1, k2, minSize = (int)Math.ceil(Math.sqrt(x)) - 1;
        
        for(int i = 0; i + minSize < n; i++){
            
            
            for(int j = 0; j + minSize < m; j++){
                
                min = minSize;
                max = Math.min(n - i, m - j);
                
                do{
                    k1 = (max + min) / 2;
                    
                    treeCount = metaTrees[i + k1 + 1][j + k1 + 1]
                            - metaTrees[i + k1 + 1][j]
                            - metaTrees[i][j + k1 + 1]
                            + metaTrees[i][j];
                    
                    if(treeCount < x){
                        min = k1;
                    }else if(treeCount >= x){
                        max = k1;
                    }
                    
                }while(max - min > 1);
                
                min = k1;
                max = Math.min(n - i, m - j);
                
                do{
                    k2 = (max + min) / 2;
                    
                    treeCount = metaTrees[i + k2 + 1][j + k2 + 1]
                            - metaTrees[i + k2 + 1][j]
                            - metaTrees[i][j + k2 + 1]
                            + metaTrees[i][j];
                    
                    if(treeCount <= x){
                        min = k2;
                    }else if(treeCount > x){
                        max = k2;
                    }
                    
                }while(max - min > 1);
                
                ans += k2 - k1;
                
            }
        }
        
        io.println(ans);
        io.close();
    }
    
}

Test details

Test 1

Group: 1

Verdict:

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

correct output
94

user output
77

Test 2

Group: 1

Verdict:

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

correct output
0

user output
36

Test 3

Group: 1

Verdict:

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

correct output
4

user output
24

Test 4

Group: 1

Verdict:

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

correct output
16

user output
36

Test 5

Group: 1

Verdict:

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

correct output
30

user output
47

Test 6

Group: 2

Verdict:

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

correct output
9552040

user output
9518047

Test 7

Group: 2

Verdict:

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

correct output
1536063

user output
1536572

Test 8

Group: 2

Verdict:

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

correct output
288

user output
76106

Test 9

Group: 2

Verdict:

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

correct output
786

user output
116975

Test 10

Group: 2

Verdict:

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

correct output
1763

user output
159928

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
1219955

Test 14

Group: 3

Verdict:

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

correct output
2665

user output
1868926

Test 15

Group: 3

Verdict:

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

correct output
5587

user output
2559549