Task: | Tontti |
Sender: | BigKappa |
Submission time: | 2015-10-10 21:49:26 +0300 |
Language: | Java |
Status: | READY |
Result: | 47 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 14 |
#2 | ACCEPTED | 33 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.17 s | 1 | details |
#2 | ACCEPTED | 0.17 s | 1 | details |
#3 | ACCEPTED | 0.16 s | 1 | details |
#4 | ACCEPTED | 0.18 s | 1 | details |
#5 | ACCEPTED | 0.17 s | 1 | details |
#6 | ACCEPTED | 0.39 s | 2 | details |
#7 | ACCEPTED | 0.30 s | 2 | details |
#8 | ACCEPTED | 0.29 s | 2 | details |
#9 | ACCEPTED | 0.28 s | 2 | details |
#10 | ACCEPTED | 0.30 s | 2 | details |
#11 | TIME LIMIT EXCEEDED | -- | 3 | details |
#12 | TIME LIMIT EXCEEDED | -- | 3 | details |
#13 | ACCEPTED | 0.54 s | 3 | details |
#14 | ACCEPTED | 0.63 s | 3 | details |
#15 | ACCEPTED | 0.68 s | 3 | details |
Code
public class Tontti{static int height;static int width;static int[][] kenttaSumma;static int wantedTrees;//static long runAmount;public static void main(String[] args){/*//todoint futureWidth = 500;int futureHeight = 500;int futurewantedTrees = (int) (Math.random() * futureHeight);height = futureHeight;width = futureWidth;wantedTrees = futurewantedTrees;kentta = new byte[width+1][height+1];kenttaSumma = new int[width+1][height+1];String[] lines = new String[height+1];for (int y=1; y<=height; y++) {//todolines[y] = "";for (int x2=1; x2<=width; x2++){if (Math.random() > 0.3){lines[y] = lines[y] + ".";}else {lines[y] = lines[y] + "*";}}}*/IO io = new IO();height = io.nextInt();width = io.nextInt();wantedTrees = io.nextInt();//long aika = System.nanoTime();kenttaSumma = new int[width+1][height+1];int foundArea = 0;int minSize = (int) (Math.sqrt(wantedTrees) + 0.99);//calculate trees and save it in to array and summed area tablefor (int y=1; y<=height; y++) {String line = io.next();//String line = lines[y];int sumRow = 0;for (int x=1; x<=width; x++){if (line.charAt(x-1) == '*'){sumRow ++;}kenttaSumma[x][y] = sumRow + kenttaSumma[x][y-1];int maxSize = min(x, y);/*//todo removeif (x==2 && y==2){//stop hereint a=0;}*/if(maxSize >= minSize){foundArea += countAreasB(maxSize,minSize,x,y,0);}}}io.println(foundArea);/*aika = (System.nanoTime()-aika)/1000000;io.println("---");io.println("Time: " + aika);io.println("Loops: " + runAmount);*/io.close();}//rekursiivinen binaarihaku// x2 = x -1// y2 = y -1private static int countAreasB(int maxSize,int minSize, int x, int y, int prevSize){int areasFound = 0;int tSize = (int) ((maxSize + minSize)/2.0 + 0.99);//lopetaan kun sama on jo katsottuif (prevSize != tSize){prevSize = tSize;int sum = kenttaSumma[x][y]+kenttaSumma[x-tSize][y-tSize]-kenttaSumma[x][y-tSize]-kenttaSumma[x-tSize][y];if(sum > wantedTrees){tSize = (tSize - minSize == 1)?minSize:tSize;areasFound += countAreasB(tSize, minSize, x, y, prevSize);}else if (sum < wantedTrees){areasFound += countAreasB(maxSize, tSize, x, y, prevSize);}else {//molemmat suunnat ovat mahdollisia --> kokeillaan kaikki lahella olevatareasFound ++;areasFound += countAreasL(tSize+1, maxSize, x, y, 1);areasFound += countAreasL(tSize-1, minSize, x, y, -1);}}return areasFound;}//suoraviivainen haku// x2 = x-1// y2 = y-1private static int countAreasL(int startSize,int endSize, int x, int y, int direction){int areasFound = 0;for (int tSize=startSize; direction*tSize<=endSize*direction; tSize=tSize+direction){int sum = kenttaSumma[x][y]+kenttaSumma[x-tSize][y-tSize]-kenttaSumma[x][y-tSize]-kenttaSumma[x-tSize][y];if (sum == wantedTrees){areasFound ++;}else{break;}}return areasFound;}//just for lulzprivate static int max(final int a, final int b){return (a>b)?a:b;}private static int min(final int a, final int b){return (a<b)?a:b;}}
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: 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: 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 |