CSES - Datatähti 2016 alku - Results
Submission details
Task:Tontti
Sender:rxz9000
Submission time:2015-10-11 18:43:34 +0300
Language:Java
Status:READY
Result:47
Feedback
groupverdictscore
#1ACCEPTED14
#2ACCEPTED33
#30
Test results
testverdicttimegroup
#1ACCEPTED0.17 s1details
#2ACCEPTED0.17 s1details
#3ACCEPTED0.17 s1details
#4ACCEPTED0.17 s1details
#5ACCEPTED0.17 s1details
#6ACCEPTED0.40 s2details
#7ACCEPTED0.33 s2details
#8ACCEPTED0.41 s2details
#9ACCEPTED0.34 s2details
#10ACCEPTED0.29 s2details
#11--3details
#12--3details
#13--3details
#14--3details
#15--3details

Code

public class TonttiTehtava {
    
    private static int treesInSquare(int[][] sums, int i, int j, int sidelength) {
        return sums[i + sidelength][j + sidelength]
                - sums[i + sidelength][j]
                - sums[i][j + sidelength]
                + sums[i][j];
    }
    
    public static void main(String[] args) {
        
        IO io = new IO();
        int height = io.nextInt();
        int width = io.nextInt();
        int idealAmountOfTrees = io.nextInt();
        
        String[] rows = new String[height];
        for (int i = 0; i < height; i++) {
            rows[i] = io.next();
        }
        
        int[][] sums = new int[height + 1][width + 1];
        
        for (int i = 0; i <= height; i++) {
            sums[i][0] = 0;
        }
        
        for (int j = 1; j <= width; j++) {
            sums[0][j] = 0;
        }
        
        for (int i = 1; i <= height; i++) {
            for (int j = 1; j <= width; j++) {
                sums[i][j] = sums[i - 1][j] - sums[i - 1][j - 1] + sums[i][j - 1]
                        + (rows[i - 1].charAt(j - 1) == '*' ? 1 : 0); // sums is offset by 1 remember.
            }
        }

        int waysOfChoosing = 0;
        
        for (int i = 0; i < height; i++) {
            for (int j = 0; j < width; j++) {
                int maxSidelength = Math.min(height - i, width - j);
                for (int sidelength = 1; sidelength <= maxSidelength; sidelength++) {
                    int treesInSquare = treesInSquare(sums, i, j, sidelength);
                    if (treesInSquare == idealAmountOfTrees) {
                        waysOfChoosing++;
                    }
                    if (treesInSquare > idealAmountOfTrees) {
                        break;
                    }
                }
            }
        }
     

        io.println(waysOfChoosing);
        io.close();
    }
}

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:

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)