| Task: | Tontti |
| Sender: | @.+-_ |
| Submission time: | 2015-10-10 23:10:41 +0300 |
| Language: | Java |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.17 s | 1 | details |
| #2 | ACCEPTED | 0.17 s | 1 | details |
| #3 | WRONG ANSWER | 0.17 s | 1 | details |
| #4 | WRONG ANSWER | 0.17 s | 1 | details |
| #5 | ACCEPTED | 0.17 s | 1 | details |
| #6 | ACCEPTED | 0.54 s | 2 | details |
| #7 | ACCEPTED | 0.48 s | 2 | details |
| #8 | WRONG ANSWER | 0.29 s | 2 | details |
| #9 | WRONG ANSWER | 0.31 s | 2 | details |
| #10 | WRONG ANSWER | 0.30 s | 2 | details |
| #11 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #12 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #13 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #14 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #15 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
public class Tonts2 {
static int width, height, treesWanted;
static char[][] chr;
static int[][] arr;
public static void main(String[] args) {
IO oi = new IO();
height = oi.nextInt();
width = oi.nextInt();
treesWanted = oi.nextInt();
chr = new char[height][];
arr = new int[height][];
int[][] tmparr = new int[height][];
for(int i = 0; i < height; i++) {
chr[i] = oi.next().toCharArray();
arr[i] = new int[width];
tmparr[i] = new int[width];
}
int minScope = (int) Math.ceil(Math.sqrt(treesWanted)),
maxScope = height < width ? height : width;
for(int y = 0; y < height; y++) {
tmparr[y][0] = chr[y][0] == '*' ? 1 : 0;
arr[y][0] = tmparr[y][0];
for(int x = 1; x < width; x++) {
tmparr[y][x] = tmparr[y][x-1] + (chr[y][x] == '*' ? 1 : 0);
arr[y][x] += tmparr[y][x] + (y > 0 ? arr[y-1][x] : 0);
}
}
int valA, val1, val2, val3;
int result = 0;
boolean d;
for(int scope = minScope; scope <= maxScope; scope++) {
d = false;
for(int y = 0; y <= height - scope; y++) {
for(int x = 0; x <= width - scope; x++) {
valA = arr[y+scope-1][x+scope-1];
val1 = x > 0 && y > 0 ? arr[y-1][x-1] : 0;
val2 = y > 0 ? arr[y-1][x+scope-1] : 0;
val3 = x > 0 ? arr[y+scope-1][x-1] : 0;
if(valA - val2 - val3 + val1 == treesWanted) {
result++;
d = true;
} else if(valA - val2 - val3 + val1 < treesWanted)
d = true;
}
}
if(!d) break;
}
oi.println(result);
oi.close();
}
}Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 1 ......*... .......*.. *..*....*. *....*.... ... |
| correct output |
|---|
| 94 |
| user output |
|---|
| 90 |
Test 2
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 10 5 ********** ********** ********** ********** ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 3
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 10 **...*...* *..*.**.*. ...**.*..* *...**.*.. ... |
| correct output |
|---|
| 4 |
| user output |
|---|
| 6 |
Test 4
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 5 ****...... *.*.**..** ....*.*..* ...*.***.. ... |
| correct output |
|---|
| 16 |
| user output |
|---|
| 18 |
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: WRONG ANSWER
| input |
|---|
| 500 500 25000 **...*...**..*.*..*.**.*..*.*.... |
| correct output |
|---|
| 288 |
| user output |
|---|
| 286 |
Test 9
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 500 500 12500 **.**.*..*...*.**...*.***........ |
| correct output |
|---|
| 786 |
| user output |
|---|
| 782 |
Test 10
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 500 500 5000 .*.*.**..*.*.**.**..*..**...*.... |
| correct output |
|---|
| 1763 |
| user output |
|---|
| 1766 |
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 2000 2000 1 ................................. |
| correct output |
|---|
| 489611392 |
| user output |
|---|
| (empty) |
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 2000 2000 5 ................................. |
| correct output |
|---|
| 120725884 |
| user output |
|---|
| (empty) |
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 2000 2000 400000 ..*..**.**.**.*.***...**.*..**... |
| correct output |
|---|
| 1849 |
| user output |
|---|
| (empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 2000 2000 200000 ***.*....*.*..*....**..*..*.*.... |
| correct output |
|---|
| 2665 |
| user output |
|---|
| (empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 2000 2000 80000 **.**...*.***.**....**.*....*.... |
| correct output |
|---|
| 5587 |
| user output |
|---|
| (empty) |
