Submission #303126

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
303126	2020-09-19T22:44:41 Z	llaki	Connecting Supertrees (IOI20_supertrees)	Java 11	11 / 100	385 ms	56392 KB

supertrees

public class supertrees {
    int construct(int[][] p) {
        int n = p.length;
        if (areAllOnes(p)) {
            return constructForAllOnes(n);
        }
        int[][] answer = new int[n][n];

        grader.build(answer);
        return 1;
    }

    boolean areAllOnes(int[][] p) {
        for (int i = 0; i < p.length; i++) {
            for (int j = 0; j < p[i].length; j++) {
                if (p[i][j] != 1) return false;
            }
        }
        return true;
    }

    int constructForAllOnes(int n) {
        int[][] res = new int[n][n];
        for (int i = 0; i < n - 1; i++) {
            res[i][i + 1] = 1;
            res[i + 1][i] = 1;
        }
        grader.build(res);
        return 1;
    }
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	80 ms	10360 KB	Output is correct
2	Correct	79 ms	10104 KB	Output is correct
3	Correct	77 ms	10336 KB	Output is correct
4	Correct	78 ms	10232 KB	Output is correct
5	Correct	82 ms	10200 KB	Output is correct
6	Correct	157 ms	15452 KB	Output is correct
7	Correct	385 ms	56392 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	80 ms	10360 KB	Output is correct
2	Correct	79 ms	10104 KB	Output is correct
3	Correct	77 ms	10336 KB	Output is correct
4	Correct	78 ms	10232 KB	Output is correct
5	Correct	82 ms	10200 KB	Output is correct
6	Correct	157 ms	15452 KB	Output is correct
7	Correct	385 ms	56392 KB	Output is correct
8	Correct	79 ms	10224 KB	Output is correct
9	Correct	77 ms	10360 KB	Output is correct
10	Correct	78 ms	10232 KB	Output is correct
11	Correct	80 ms	10360 KB	Output is correct
12	Correct	141 ms	15120 KB	Output is correct
13	Correct	376 ms	56064 KB	Output is correct
14	Incorrect	83 ms	10228 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	79 ms	10084 KB	Output is correct
2	Correct	77 ms	10104 KB	Output is correct
3	Correct	78 ms	10212 KB	Output is correct
4	Incorrect	80 ms	10240 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	77 ms	10088 KB	Output is correct
2	Incorrect	85 ms	10224 KB	Too few ways to get from 0 to 1, should be 2 found 0
3	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	80 ms	10360 KB	Output is correct
2	Correct	79 ms	10104 KB	Output is correct
3	Correct	77 ms	10336 KB	Output is correct
4	Correct	78 ms	10232 KB	Output is correct
5	Correct	82 ms	10200 KB	Output is correct
6	Correct	157 ms	15452 KB	Output is correct
7	Correct	385 ms	56392 KB	Output is correct
8	Correct	79 ms	10224 KB	Output is correct
9	Correct	77 ms	10360 KB	Output is correct
10	Correct	78 ms	10232 KB	Output is correct
11	Correct	80 ms	10360 KB	Output is correct
12	Correct	141 ms	15120 KB	Output is correct
13	Correct	376 ms	56064 KB	Output is correct
14	Incorrect	83 ms	10228 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	80 ms	10360 KB	Output is correct
2	Correct	79 ms	10104 KB	Output is correct
3	Correct	77 ms	10336 KB	Output is correct
4	Correct	78 ms	10232 KB	Output is correct
5	Correct	82 ms	10200 KB	Output is correct
6	Correct	157 ms	15452 KB	Output is correct
7	Correct	385 ms	56392 KB	Output is correct
8	Correct	79 ms	10224 KB	Output is correct
9	Correct	77 ms	10360 KB	Output is correct
10	Correct	78 ms	10232 KB	Output is correct
11	Correct	80 ms	10360 KB	Output is correct
12	Correct	141 ms	15120 KB	Output is correct
13	Correct	376 ms	56064 KB	Output is correct
14	Incorrect	83 ms	10228 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-