CSES - Datatähti 2016 alku

CSES - Datatähti 2016 alku - Results

Submission details
Task:	Tontti
Sender:	rxz9000
Submission time:	2015-10-04 23:02:57 +0300
Language:	Java
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.21 s	1	details
#2	WRONG ANSWER	0.19 s	1	details
#3	WRONG ANSWER	0.17 s	1	details
#4	WRONG ANSWER	0.18 s	1	details
#5	WRONG ANSWER	0.19 s	1	details
#6	TIME LIMIT EXCEEDED	--	2	details
#7	TIME LIMIT EXCEEDED	--	2	details
#8	TIME LIMIT EXCEEDED	--	2	details
#9	TIME LIMIT EXCEEDED	--	2	details
#10	TIME LIMIT EXCEEDED	--	2	details
#11	TIME LIMIT EXCEEDED	--	3	details
#12	TIME LIMIT EXCEEDED	--	3	details
#13	TIME LIMIT EXCEEDED	--	3	details
#14	TIME LIMIT EXCEEDED	--	3	details
#15	TIME LIMIT EXCEEDED	--	3	details

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 (row <= j + sideLength) {
                if (column <= i + sideLength) {
                    return 1;
                }
            } else {
                return -1;
            }
        }
        return 0;
    }
}

Test details

Test 1

Group: 1

Verdict: WRONG ANSWER

input
`10 10 1 ......... ......... ....... ....*.... ...` view save

correct output
`94` view save

user output
`95` view save

Test 2

Group: 1

Verdict: WRONG ANSWER

input
`10 10 5 ******** ****** ****** ******** ...` view save

correct output
`0` view save

user output
`30` view save

Test 3

Group: 1

Verdict: WRONG ANSWER

input
`10 10 10 *......* ...*.. ...*...* ...... ...` view save

correct output
`4` view save

user output
`2` view save

Test 4

Group: 1

Verdict: WRONG ANSWER

input
`10 10 5 ***...... ....* .......* ....**.. ...` view save

correct output
`16` view save

user output
`11` view save

Test 5

Group: 1

Verdict: WRONG ANSWER

input
`10 10 2 .... ........ .**....* *... ...` view save

correct output
`30` view save

user output
`64` view save

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 1 .................................` view save

correct output
`9552040` view save

user output
(empty)

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 5 .................................` view save

correct output
`1536063` view save

user output
(empty)

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 25000 *......*......*........` view save

correct output
`288` view save

user output
(empty)

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 12500 ............***........` view save

correct output
`786` view save

user output
(empty)

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 5000 ...*.........*.......` view save

correct output
`1763` view save

user output
(empty)

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`2000 2000 1 .................................` view save

correct output
`489611392` view save

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`2000 2000 5 .................................` view save

correct output
`120725884` view save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`2000 2000 400000 ........*......*...` view save

correct output
`1849` view save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`2000 2000 200000 **.....................` view save

correct output
`2665` view save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`2000 2000 80000 ..........*.....*....` view save

correct output
`5587` view save

user output
(empty)

Datatähti 2016 alku

Tontti

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Tasks

Submissions (rxz9000)