CSES - Datatähti 2016 alku - Results
Submission details
Task:Tontti
Sender:Perdex
Submission time:2015-10-08 14:45:35 +0300
Language:Java
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED14
#2ACCEPTED33
#3ACCEPTED53
Test results
testverdicttimegroup
#1ACCEPTED0.17 s1details
#2ACCEPTED0.17 s1details
#3ACCEPTED0.17 s1details
#4ACCEPTED0.17 s1details
#5ACCEPTED0.17 s1details
#6ACCEPTED0.30 s2details
#7ACCEPTED0.30 s2details
#8ACCEPTED0.29 s2details
#9ACCEPTED0.29 s2details
#10ACCEPTED0.28 s2details
#11ACCEPTED0.88 s3details
#12ACCEPTED0.89 s3details
#13ACCEPTED0.53 s3details
#14ACCEPTED0.59 s3details
#15ACCEPTED0.68 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, top, bottom, max, k1 = 0, k2, minSize = (int)Math.ceil(Math.sqrt(x)) - 2;
for(int i = 0; i + minSize < n; i++){
for(int j = 0; j + minSize < m; j++){
bottom = minSize;
max = Math.min(n - i, m - j);
top = max;
while(top != bottom + 1){
k1 = (top + bottom) / 2;
if(metaTrees[i + k1 + 1][j + k1 + 1] - metaTrees[i + k1 + 1][j]
- metaTrees[i][j + k1 + 1] + metaTrees[i][j] < x)
bottom = k1;
else
top = k1;
}
k1 = bottom;
top = max;
while(top != bottom + 1){
k2 = (top + bottom) / 2;
if(metaTrees[i + k2 + 1][j + k2 + 1] - metaTrees[i + k2 + 1][j]
- metaTrees[i][j + k2 + 1] + metaTrees[i][j] <= x)
bottom = k2;
else
top = k2;
}
ans += bottom - k1;
}
}
io.println(ans);
io.close();
}
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

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

correct output
94

user output
94

Test 2

Group: 1

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 3

Group: 1

Verdict: ACCEPTED

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

correct output
4

user output
4

Test 4

Group: 1

Verdict: ACCEPTED

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

correct output
16

user output
16

Test 5

Group: 1

Verdict: ACCEPTED

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

correct output
30

user output
30

Test 6

Group: 2

Verdict: ACCEPTED

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

correct output
9552040

user output
9552040

Test 7

Group: 2

Verdict: ACCEPTED

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

correct output
1536063

user output
1536063

Test 8

Group: 2

Verdict: ACCEPTED

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

correct output
288

user output
288

Test 9

Group: 2

Verdict: ACCEPTED

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

correct output
786

user output
786

Test 10

Group: 2

Verdict: ACCEPTED

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

correct output
1763

user output
1763

Test 11

Group: 3

Verdict: ACCEPTED

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

correct output
489611392

user output
489611392

Test 12

Group: 3

Verdict: ACCEPTED

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

correct output
120725884

user output
120725884

Test 13

Group: 3

Verdict: ACCEPTED

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

correct output
1849

user output
1849

Test 14

Group: 3

Verdict: ACCEPTED

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

correct output
2665

user output
2665

Test 15

Group: 3

Verdict: ACCEPTED

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

correct output
5587

user output
5587