Task: | Tontti |
Sender: | Galax |
Submission time: | 2015-10-02 23:47:47 +0300 |
Language: | Java |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.19 s | 1 | details |
#2 | WRONG ANSWER | 0.17 s | 1 | details |
#3 | WRONG ANSWER | 0.17 s | 1 | details |
#4 | WRONG ANSWER | 0.17 s | 1 | details |
#5 | WRONG ANSWER | 0.17 s | 1 | details |
#6 | WRONG ANSWER | 0.24 s | 2 | details |
#7 | WRONG ANSWER | 0.21 s | 2 | details |
#8 | WRONG ANSWER | 0.20 s | 2 | details |
#9 | WRONG ANSWER | 0.20 s | 2 | details |
#10 | WRONG ANSWER | 0.21 s | 2 | details |
#11 | WRONG ANSWER | 0.30 s | 3 | details |
#12 | WRONG ANSWER | 0.28 s | 3 | details |
#13 | WRONG ANSWER | 0.28 s | 3 | details |
#14 | WRONG ANSWER | 0.28 s | 3 | details |
#15 | WRONG ANSWER | 0.28 s | 3 | details |
Code
import java.util.ArrayList; public class Main { private static int hits; public static void main(String[] args) { IO io = new IO(); int height = io.nextInt(); int width = io.nextInt(); int trees = io.nextInt(); hits = 0; ArrayList<String> woods = new ArrayList<>(); for (int i = 0; i < height; i++) { woods.add(io.next()); } int smallest = height; if (height > width) { smallest = width; } iterateThroughAllSquares(width, height, smallest, woods, trees); io.println(hits); io.close(); } private static void searchSquare(int startx, int starty, int size, ArrayList<String> woods, int trees) { int temphits = 0; /* for (int j = starty; j < f1; j++) { for (int i = startx; i < f2; i++) { System.out.print(woods.get(j).charAt(i)); if (woods.get(j).charAt(i) == '*') { temphits++; } } System.out.println(""); } System.out.println("------------"); if (temphits == trees) { hits++; } size--; if (temphits >= trees && size*size >= trees) { } size--; if (temphits >= trees && size*size >= trees) { for (int i = 0; i <= woods.size()-size-starty; i++) { searchSquare(startx, starty+i, size, woods, trees); } }*/ int foundTrees = 0; for (int i = 1; i <= size; i++) { if(foundTrees<=trees) { foundTrees = checkSquare(startx,starty,i,woods,trees,foundTrees); } else { break; } } //skip the check of unrealistically small squares, if needed //in this function, the grid starts from 0,0 in the left upper corner /*private static void iterate2(int width, int height, int size, ArrayList<String> woods, int trees) { /* int temphits = 0; for (int i = height; i <= woods.size()-size; i++) { }*/ } private static int checkSquare(int startx, int starty, int size, ArrayList<String> woods, int trees, int foundTrees) { for (int i = 0; i < size-1; i++) { if (woods.get(size-1+starty).charAt(i)=='*') { foundTrees++; } } for (int i = 0; i < size; i++) { if (woods.get(i+startx).charAt(size-1)=='*') { foundTrees++; } } if (foundTrees==trees) { hits++; } return foundTrees; } private static void iterateThroughAllSquares(int width, int height, int size, ArrayList<String> woods, int trees) { for (int i = 0; i <= width-size; i++) { for (int j = 0; j <= height-size; j++) { searchSquare(i,j,size,woods,trees); System.out.println(j); } } /*for (int i = 0; i <= width - size; i++) { for (int j = 0; j <= height - size; j++) { int temphits = searchSquare(i, j, size, woods, trees); if (height < width) { iterate2(i,0,size-1,woods,trees); } } }*/ //if higher than wider: diff function. Iterate through only the top or left side of the square and only if there //are enough potential trees // no need for if??, just stick them in different parts of the for loop /*size--; if (Math.pow(size, 2) >= trees) { iterateThroughAllSquares(width, height, size, woods, trees); }*/ } }
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
input |
---|
10 10 1 ......*... .......*.. *..*....*. *....*.... ... |
correct output |
---|
94 |
user output |
---|
0 1 |
Test 2
Group: 1
Verdict: WRONG ANSWER
input |
---|
10 10 5 ********** ********** ********** ********** ... |
correct output |
---|
0 |
user output |
---|
0 0 |
Test 3
Group: 1
Verdict: WRONG ANSWER
input |
---|
10 10 10 **...*...* *..*.**.*. ...**.*..* *...**.*.. ... |
correct output |
---|
4 |
user output |
---|
0 0 |
Test 4
Group: 1
Verdict: WRONG ANSWER
input |
---|
10 10 5 ****...... *.*.**..** ....*.*..* ...*.***.. ... |
correct output |
---|
16 |
user output |
---|
0 1 |
Test 5
Group: 1
Verdict: WRONG ANSWER
input |
---|
10 10 2 **.***..*. ...*.*.... .***.*...* ***.***..* ... |
correct output |
---|
30 |
user output |
---|
0 1 |
Test 6
Group: 2
Verdict: WRONG ANSWER
input |
---|
500 500 1 ................................. |
correct output |
---|
9552040 |
user output |
---|
0 111 |
Test 7
Group: 2
Verdict: WRONG ANSWER
input |
---|
500 500 5 ................................. |
correct output |
---|
1536063 |
user output |
---|
0 15 |
Test 8
Group: 2
Verdict: WRONG ANSWER
input |
---|
500 500 25000 **...*...**..*.*..*.**.*..*.*.... |
correct output |
---|
288 |
user output |
---|
0 0 |
Test 9
Group: 2
Verdict: WRONG ANSWER
input |
---|
500 500 12500 **.**.*..*...*.**...*.***........ |
correct output |
---|
786 |
user output |
---|
0 0 |
Test 10
Group: 2
Verdict: WRONG ANSWER
input |
---|
500 500 5000 .*.*.**..*.*.**.**..*..**...*.... |
correct output |
---|
1763 |
user output |
---|
0 0 |
Test 11
Group: 3
Verdict: WRONG ANSWER
input |
---|
2000 2000 1 ................................. |
correct output |
---|
489611392 |
user output |
---|
0 66 |
Test 12
Group: 3
Verdict: WRONG ANSWER
input |
---|
2000 2000 5 ................................. |
correct output |
---|
120725884 |
user output |
---|
0 8 |
Test 13
Group: 3
Verdict: WRONG ANSWER
input |
---|
2000 2000 400000 ..*..**.**.**.*.***...**.*..**... |
correct output |
---|
1849 |
user output |
---|
0 0 |
Test 14
Group: 3
Verdict: WRONG ANSWER
input |
---|
2000 2000 200000 ***.*....*.*..*....**..*..*.*.... |
correct output |
---|
2665 |
user output |
---|
0 0 |
Test 15
Group: 3
Verdict: WRONG ANSWER
input |
---|
2000 2000 80000 **.**...*.***.**....**.*....*.... |
correct output |
---|
5587 |
user output |
---|
0 0 |