Submission #961627

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
961627	2024-04-12T09:12:30 Z	Gr1sen	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	150 ms	24144 KB

supertrees

#include"supertrees.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>

using namespace std;

#define vi vector<int>
#define vvi vector<vi>

vi L;

int construct(std::vector<std::vector<int>> p) {
    int n = p.size();
    vvi Adj(n, vi(n, 0));
    L.clear();
    for (int i = 0; i < n; i++) {
        bool q = 0;
        for (auto j : L) {
            if (p[i][j]) {Adj[i][j] = 1; Adj[j][i] = 1; q = 1; break;}
        }
        if (!q) L.push_back(i);
    }
    build(Adj);
    return 1;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	756 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	7 ms	1116 KB	Output is correct
7	Correct	150 ms	22180 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	756 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	7 ms	1116 KB	Output is correct
7	Correct	150 ms	22180 KB	Output is correct
8	Correct	1 ms	504 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	7 ms	1372 KB	Output is correct
13	Correct	148 ms	24144 KB	Output is correct
14	Incorrect	1 ms	348 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	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Incorrect	0 ms	348 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	1 ms	344 KB	Output is correct
2	Incorrect	1 ms	344 KB	Too few ways to get from 0 to 1, should be 2 found 1
3	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	756 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	7 ms	1116 KB	Output is correct
7	Correct	150 ms	22180 KB	Output is correct
8	Correct	1 ms	504 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	7 ms	1372 KB	Output is correct
13	Correct	148 ms	24144 KB	Output is correct
14	Incorrect	1 ms	348 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	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	756 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	7 ms	1116 KB	Output is correct
7	Correct	150 ms	22180 KB	Output is correct
8	Correct	1 ms	504 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	7 ms	1372 KB	Output is correct
13	Correct	148 ms	24144 KB	Output is correct
14	Incorrect	1 ms	348 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-