Task: | Tontti |
Sender: | rxz9000 |
Submission time: | 2015-10-01 17:43:10 +0300 |
Language: | Java |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.20 s | 1 | details |
#2 | ACCEPTED | 0.20 s | 1 | details |
#3 | ACCEPTED | 0.20 s | 1 | details |
#4 | WRONG ANSWER | 0.20 s | 1 | details |
#5 | WRONG ANSWER | 0.20 s | 1 | details |
#6 | TIME LIMIT EXCEEDED | -- | 2 | details |
#7 | TIME LIMIT EXCEEDED | -- | 2 | details |
#8 | TIME LIMIT EXCEEDED | -- | 2 | details |
#9 | TIME LIMIT EXCEEDED | -- | 2 | details |
#10 | TIME LIMIT EXCEEDED | -- | 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
import java.util.Scanner; public class TonttiTehtava { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int height = scanner.nextInt(); int width = scanner.nextInt(); int trees = scanner.nextInt(); String[] rows = new String[height]; for (int i = 0; i < height; i++) { rows[i] = scanner.next(); } int waysOfChoosing = 0; for (int i = 0; i < height; i++) { for (int j = 0; j < width; j++) { if (rows[i].charAt(j) == '*') { waysOfChoosing += checkPossibleSquares(rows, j, i, trees); } } } System.out.println(waysOfChoosing); } public static int checkSquareForTrees(String[] rows, int x, int y, int size, int anchorOffset) { int result = 0; for (int i = 0; i < size; i++) { for (int j = 0; j < size; j++) { if (rows[i + y].charAt(j + x - anchorOffset) == '*') { result++; } } } return result; } public static int checkPossibleSquares(String[] rows, int x, int y, int trees) { int result = 0; for (int i = 1; i <= rows.length - y; i++) { // loop through all possible sizes int firstAO = 0; if (rows[0].length() - x - i < 0) { firstAO = (x + i - rows[0].length()); } int lastAO = i - 1; if (x < i) { lastAO = x; } for (int j = 1; j <= x; j++) { if (rows[y].charAt(x - j) == '*') { lastAO = j - 1; break; } } for (int j = firstAO; j <= lastAO; j++) { // loop through all possible anchor offsets if (checkSquareForTrees(rows, x, y, i, j) == trees) { result++; // System.out.println(x + ", " + y + ", " + i + ", " + j); } } } return result; } }
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
input |
---|
10 10 1 ......*... .......*.. *..*....*. *....*.... ... |
correct output |
---|
94 |
user output |
---|
50 |
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: WRONG ANSWER
input |
---|
10 10 5 ****...... *.*.**..** ....*.*..* ...*.***.. ... |
correct output |
---|
16 |
user output |
---|
15 |
Test 5
Group: 1
Verdict: WRONG ANSWER
input |
---|
10 10 2 **.***..*. ...*.*.... .***.*...* ***.***..* ... |
correct output |
---|
30 |
user output |
---|
28 |
Test 6
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 500 1 ................................. |
correct output |
---|
9552040 |
user output |
---|
(empty) |
Test 7
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 500 5 ................................. |
correct output |
---|
1536063 |
user output |
---|
(empty) |
Test 8
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 500 25000 **...*...**..*.*..*.**.*..*.*.... |
correct output |
---|
288 |
user output |
---|
(empty) |
Test 9
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 500 12500 **.**.*..*...*.**...*.***........ |
correct output |
---|
786 |
user output |
---|
(empty) |
Test 10
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
500 500 5000 .*.*.**..*.*.**.**..*..**...*.... |
correct output |
---|
1763 |
user output |
---|
(empty) |
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) |