CSES - Datatähti 2016 alku

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
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.16 s	1	details
#2	WRONG ANSWER	0.17 s	1	details
#3	WRONG ANSWER	0.18 s	1	details
#4	WRONG ANSWER	0.17 s	1	details
#5	WRONG ANSWER	0.18 s	1	details
#6	WRONG ANSWER	0.30 s	2	details
#7	WRONG ANSWER	0.29 s	2	details
#8	WRONG ANSWER	0.28 s	2	details
#9	WRONG ANSWER	0.29 s	2	details
#10	WRONG ANSWER	0.28 s	2	details
#11	TIME LIMIT EXCEEDED	--	3	details
#12	TIME LIMIT EXCEEDED	--	3	details
#13	WRONG ANSWER	0.60 s	3	details
#14	WRONG ANSWER	0.67 s	3	details
#15	WRONG ANSWER	0.75 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, 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: WRONG ANSWER

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

correct output
`94` view save

user output
`77` view save

Test 2

Group: 1

Verdict: WRONG ANSWER

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

correct output
`0` view save

user output
`36` view save

Test 3

Group: 1

Verdict: WRONG ANSWER

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

correct output
`4` view save

user output
`24` view save

Test 4

Group: 1

Verdict: WRONG ANSWER

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

correct output
`16` view save

user output
`36` view save

Test 5

Group: 1

Verdict: WRONG ANSWER

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

correct output
`30` view save

user output
`47` view save

Test 6

Group: 2

Verdict: WRONG ANSWER

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

correct output
`9552040` view save

user output
`9518047` view save

Test 7

Group: 2

Verdict: WRONG ANSWER

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

correct output
`1536063` view save

user output
`1536572` view save

Test 8

Group: 2

Verdict: WRONG ANSWER

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

correct output
`288` view save

user output
`76106` view save

Test 9

Group: 2

Verdict: WRONG ANSWER

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

correct output
`786` view save

user output
`116975` view save

Test 10

Group: 2

Verdict: WRONG ANSWER

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

correct output
`1763` view save

user output
`159928` 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: TIME LIMIT EXCEEDED

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

correct output
`120725884` view save

user output
(empty)

Test 13

Group: 3

Verdict: WRONG ANSWER

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

correct output
`1849` view save

user output
`1219955` view save

Test 14

Group: 3

Verdict: WRONG ANSWER

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

correct output
`2665` view save

user output
`1868926` view save

Test 15

Group: 3

Verdict: WRONG ANSWER

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

correct output
`5587` view save

user output
`2559549` 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)