CSES - Datatähti 2016 alku

Submission details
Task:	Tontti
Sender:	Perdex
Submission time:	2015-10-08 12:38:16 +0300
Language:	Java
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.18 s	1	details
#2	ACCEPTED	0.17 s	1	details
#3	ACCEPTED	0.18 s	1	details
#4	ACCEPTED	0.16 s	1	details
#5	ACCEPTED	0.18 s	1	details
#6	WRONG ANSWER	0.32 s	2	details
#7	WRONG ANSWER	0.28 s	2	details
#8	WRONG ANSWER	0.26 s	2	details
#9	WRONG ANSWER	0.26 s	2	details
#10	WRONG ANSWER	0.29 s	2	details
#11	TIME LIMIT EXCEEDED	--	3	details
#12	WRONG ANSWER	0.56 s	3	details
#13	WRONG ANSWER	0.37 s	3	details
#14	WRONG ANSWER	0.40 s	3	details
#15	WRONG ANSWER	0.42 s	3	details

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, k, 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);
                
                for(k = (max + min) / 2; ; k = (max + min) / 2){
                    
                    treeCount = metaTrees[i + k + 1][j + k + 1]
                            - metaTrees[i + k + 1][j]
                            - metaTrees[i][j + k + 1]
                            + metaTrees[i][j];
                    
                    if(treeCount < x){
                        min = k;
                    }else if(treeCount > x){
                        max = k;
                    }else{
                        ans++;
                        
                        for(int l = k + 1; i + l < n && j + l < m; l++){

                            treeCount = metaTrees[i + l + 1][j + l + 1]
                                    - metaTrees[i + l + 1][j]
                                    - metaTrees[i][j + l + 1]
                                    + metaTrees[i][j];
                            if(treeCount == x)
                                ans++;
                            else
                                break;

                        }

                        for(int l = k - 1; ; l--){

                            treeCount = metaTrees[i + l + 1][j + l + 1]
                                    - metaTrees[i + l + 1][j]
                                    - metaTrees[i][j + l + 1]
                                    + metaTrees[i][j];
                            if(treeCount == x)
                                ans++;
                            else
                                break;

                        }
                        break;
                    }
                    
                    if(k == min)
                        break;
                }
                
                
            }
        }
        
        io.println(ans);
        io.close();
    }
    
}

Test details

Test 1

Group: 1

Verdict: WRONG ANSWER

input
`10 10 1 ......... ......... ....... ....*.... ...` view save

correct output
`94` view save

user output
`85` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`10 10 5 ******** ****** ****** ******** ...` view save

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`10 10 10 *......* ...*.. ...*...* ...... ...` view save

correct output
`4` view save

user output
`4` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`10 10 5 ***...... ....* .......* ....**.. ...` view save

correct output
`16` view save

user output
`16` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`10 10 2 .... ........ .**....* *... ...` view save

correct output
`30` view save

user output
`30` view save

Test 6

Group: 2

Verdict: WRONG ANSWER

input
`500 500 1 .................................` view save

correct output
`9552040` view save

user output
`6639445` view save

Test 7

Group: 2

Verdict: WRONG ANSWER

input
`500 500 5 .................................` view save

correct output
`1536063` view save

user output
`347950` view save

Test 8

Group: 2

Verdict: WRONG ANSWER

input
`500 500 25000 *......*......*........` view save

correct output
`288` view save

user output
`2` view save

Test 9

Group: 2

Verdict: WRONG ANSWER

input
`500 500 12500 ............***........` view save

correct output
`786` view save

user output
`14` view save

Test 10

Group: 2

Verdict: WRONG ANSWER

input
`500 500 5000 ...*.........*.......` view save

correct output
`1763` view save

user output
`73` view save

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`2000 2000 1 .................................` view save

correct output
`489611392` view save

user output
(empty)

Test 12

Group: 3

Verdict: WRONG ANSWER

input
`2000 2000 5 .................................` view save

correct output
`120725884` view save

user output
`35791145` view save

Test 13

Group: 3

Verdict: WRONG ANSWER

input
`2000 2000 400000 ........*......*...` view save

correct output
`1849` view save

user output
`5` view save

Test 14

Group: 3

Verdict: WRONG ANSWER

input
`2000 2000 200000 **.....................` view save

correct output
`2665` view save

user output
`17` view save

Test 15

Group: 3

Verdict: WRONG ANSWER

input
`2000 2000 80000 ..........*.....*....` view save

correct output
`5587` view save

user output
`65` view save

Datatähti 2016 alku

Tontti

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Tasks

Submissions (Perdex)