CSES - Datatähti 2016 alku - Results
Submission details
Task:Tontti
Sender:Galax
Submission time:2015-10-01 18:38:16 +0300
Language:Java
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.17 s1details
#2ACCEPTED0.18 s1details
#30.16 s1details
#40.19 s1details
#50.18 s1details
#6--2details
#7--2details
#8--2details
#9--2details
#10--2details
#11--3details
#12--3details
#13--3details
#14--3details
#15--3details

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;
        int f1 = starty+size;
        int f2 = startx+size;
        
        for (int j = starty; j < f1; j++) {
            for (int i = startx; i < f2; i++) {
                if (woods.get(j).charAt(i) == '*') {
                    temphits++;

                }
            }
            
        }
        if (temphits == trees) {
            hits++;
        }
        size--;
        if (temphits >= trees && size*size >= trees) {
            for (int i = 0; i <= woods.size()-size-starty; i++) {
                searchSquare(startx, starty+i, size, woods, trees);
            }
        }
    }

    //in this function, the grid starts from 0,0 in the left upper corner

    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);

            }
        }
        //calls itself here
        /*size--;
        if (Math.pow(size, 2) >= trees) {
            iterateThroughAllSquares(width, height, size, woods, trees);
        }*/
    }
}

Test details

Test 1

Group: 1

Verdict:

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

correct output
94

user output
1635

Test 2

Group: 1

Verdict: ACCEPTED

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

correct output
0

user output
0

Test 3

Group: 1

Verdict:

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

correct output
4

user output
0

Test 4

Group: 1

Verdict:

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

correct output
16

user output
312

Test 5

Group: 1

Verdict:

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

correct output
30

user output
1541

Test 6

Group: 2

Verdict:

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

correct output
9552040

user output
(empty)

Test 7

Group: 2

Verdict:

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

correct output
1536063

user output
(empty)

Test 8

Group: 2

Verdict:

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

correct output
288

user output
(empty)

Test 9

Group: 2

Verdict:

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

correct output
786

user output
(empty)

Test 10

Group: 2

Verdict:

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

correct output
1763

user output
(empty)

Test 11

Group: 3

Verdict:

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

correct output
489611392

user output
(empty)

Test 12

Group: 3

Verdict:

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

correct output
120725884

user output
(empty)

Test 13

Group: 3

Verdict:

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

correct output
1849

user output
(empty)

Test 14

Group: 3

Verdict:

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

correct output
2665

user output
(empty)

Test 15

Group: 3

Verdict:

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

correct output
5587

user output
(empty)