CSES - Datatähti 2016 alku - Results
Submission details
Task:Tontti
Sender:rxz9000
Submission time:2015-10-04 23:29:08 +0300
Language:Java
Status:READY
Result:14
Feedback
groupverdictscore
#1ACCEPTED14
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.18 s1details
#2ACCEPTED0.17 s1details
#3ACCEPTED0.19 s1details
#4ACCEPTED0.19 s1details
#5ACCEPTED0.17 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.*;

public class TonttiTehtava {

    public static void main(String[] args) {
        IO io = new IO();
        final int height = io.nextInt();
        final int width = io.nextInt();
        final int idealAmountOfTrees = io.nextInt();

        List<MatrixElement> trees = new ArrayList<>();

        for (int i = 0; i < height; i++) {
            String row = io.next();
            for (int j = 0; j < width; j++) {
                if (row.charAt(j) == '*') {
                    trees.add(new MatrixElement(i, j));
                }
            }
        }

        final int amountOfTrees = trees.size();
        final int minSize = (int) Math.ceil(Math.sqrt(idealAmountOfTrees));
        final double density = amountOfTrees / (height * width);
        final int averageSize = (int) Math.round(Math.sqrt(idealAmountOfTrees / density));

        int waysOfChoosing = 0;
        for (int i = 0; i < height; i++) {
            for (int j = 0; j < width; j++) {
                int maxSize = Math.min(height - i, width - j);
                int treesInAverageSquare = 0;
                for (int k = 0; k < amountOfTrees; k++) {
                    int withinSquare = trees.get(k).withinSquare(i, j, averageSize);
                    if (withinSquare == 1) {
                        treesInAverageSquare++;
                    } else if (withinSquare == -1) {
                        break;
                    }
                }
                if (treesInAverageSquare < idealAmountOfTrees) {
                    for (int size = averageSize + 1; size < maxSize; size++) {
                        int treesInSquare = 0;
                        for (int k = 0; k < amountOfTrees; k++) {
                            int withinSquare = trees.get(k).withinSquare(i, j, size);
                            if (withinSquare == 1) {
                                treesInSquare++;
                            } else if (withinSquare == -1) {
                                break;
                            }
                        }
                        if (treesInSquare == idealAmountOfTrees) {
                            waysOfChoosing++;
                        } else if (treesInSquare > idealAmountOfTrees) {
                            break;
                        }
                    }
                } else if (treesInAverageSquare > idealAmountOfTrees) {
                    for (int size = averageSize - 1; size > minSize; size--) {
                        int treesInSquare = 0;
                        for (int k = 0; k < amountOfTrees; k++) {
                            int withinSquare = trees.get(k).withinSquare(i, j, size);
                            if (withinSquare == 1) {
                                treesInSquare++;
                            } else if (withinSquare == -1) {
                                break;
                            }
                        }
                        if (treesInSquare == idealAmountOfTrees) {
                            waysOfChoosing++;
                        } else if (treesInSquare < idealAmountOfTrees) {
                            break;
                        }
                    }
                } else {
                    waysOfChoosing++;
                    for (int size = averageSize + 1; size < maxSize; size++) {
                        int treesInSquare = 0;
                        for (int k = 0; k < amountOfTrees; k++) {
                            int withinSquare = trees.get(k).withinSquare(i, j, size);
                            if (withinSquare == 1) {
                                treesInSquare++;
                            } else if (withinSquare == -1) {
                                break;
                            }
                        }
                        if (treesInSquare == idealAmountOfTrees) {
                            waysOfChoosing++;
                        } else if (treesInSquare > idealAmountOfTrees) {
                            break;
                        }
                    }
                    for (int size = averageSize - 1; size > minSize; size--) {
                        int treesInSquare = 0;
                        for (int k = 0; k < amountOfTrees; k++) {
                            int withinSquare = trees.get(k).withinSquare(i, j, size);
                            if (withinSquare == 1) {
                                treesInSquare++;
                            } else if (withinSquare == -1) {
                                break;
                            }
                        }
                        if (treesInSquare == idealAmountOfTrees) {
                            waysOfChoosing++;
                        } else if (treesInSquare < idealAmountOfTrees) {
                            break;
                        }
                    }
                }
            }
        }

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

class MatrixElement {

    public final int column;
    public final int row;

    public MatrixElement(int i, int j) {
        column = i;
        row = j;
    }

    public int withinSquare(int i, int j, int sideLength) {
        if (column >= i && row >= j) {
            if (column <= i + sideLength) {
                if (row <= j + sideLength) {
                    return 1;
                }
            } else {
                return -1;
            }
        }
        return 0;
    }
}

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:

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)