Submission #961640

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
961640	2024-04-12T09:24:15 Z	Gr1sen	Connecting Supertrees (IOI20_supertrees)	C++17	21 / 100	176 ms	24600 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;

vi F;

int find(int a) {return (F[a] == -1 ? a : F[a] = find(F[a]));}

void uunion(int a, int b) {
    a = find(a); b = find(b);
    if (a == b) return;
    F[a] = b;
}


int construct(std::vector<std::vector<int>> p) {
    int n = p.size();
    vvi Adj(n, vi(n, 0));
    L.clear(); F.clear(); F.resize(n, -1);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (p[i][j]) {
                if (find(i) == find(j)) continue;
                Adj[i][j] = 1; 
                Adj[j][i] = 1; 
                uunion(i, j);
                continue;
            }
            //cerr << i << " " << j << " " << find(i) << " " << find(j) << endl;
            if (find(i) == find(j)) return 0;
        }
        if (find(i) == i) L.push_back(i);
    }
    build(Adj);
    return 1;
}

Subtask #1
11.0 / 11.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	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	8 ms	1112 KB	Output is correct
7	Correct	152 ms	22040 KB	Output is correct

Subtask #2
10.0 / 10.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	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	8 ms	1112 KB	Output is correct
7	Correct	152 ms	22040 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	6 ms	1320 KB	Output is correct
13	Correct	151 ms	22284 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	61 ms	14216 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	37 ms	6344 KB	Output is correct
21	Correct	155 ms	24600 KB	Output is correct
22	Correct	147 ms	24148 KB	Output is correct
23	Correct	162 ms	24112 KB	Output is correct
24	Correct	163 ms	23948 KB	Output is correct
25	Correct	67 ms	14212 KB	Output is correct
26	Correct	58 ms	14164 KB	Output is correct
27	Correct	176 ms	24144 KB	Output is correct
28	Correct	154 ms	23928 KB	Output is correct

Subtask #3
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	352 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	600 KB	Output is correct
4	Incorrect	0 ms	344 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 ms	0 KB	-

Subtask #4
0 / 35.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Incorrect	416 KB	Too few ways to get from 0 to 1, should be 2 found 1
3	Halted	0 KB	-

Subtask #5
0 / 21.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	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	8 ms	1112 KB	Output is correct
7	Correct	152 ms	22040 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	6 ms	1320 KB	Output is correct
13	Correct	151 ms	22284 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	61 ms	14216 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	37 ms	6344 KB	Output is correct
21	Correct	155 ms	24600 KB	Output is correct
22	Correct	147 ms	24148 KB	Output is correct
23	Correct	162 ms	24112 KB	Output is correct
24	Correct	163 ms	23948 KB	Output is correct
25	Correct	67 ms	14212 KB	Output is correct
26	Correct	58 ms	14164 KB	Output is correct
27	Correct	176 ms	24144 KB	Output is correct
28	Correct	154 ms	23928 KB	Output is correct
29	Correct	1 ms	352 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	1 ms	600 KB	Output is correct
32	Incorrect	0 ms	344 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.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	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	8 ms	1112 KB	Output is correct
7	Correct	152 ms	22040 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	6 ms	1320 KB	Output is correct
13	Correct	151 ms	22284 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	61 ms	14216 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	37 ms	6344 KB	Output is correct
21	Correct	155 ms	24600 KB	Output is correct
22	Correct	147 ms	24148 KB	Output is correct
23	Correct	162 ms	24112 KB	Output is correct
24	Correct	163 ms	23948 KB	Output is correct
25	Correct	67 ms	14212 KB	Output is correct
26	Correct	58 ms	14164 KB	Output is correct
27	Correct	176 ms	24144 KB	Output is correct
28	Correct	154 ms	23928 KB	Output is correct
29	Correct	1 ms	352 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	1 ms	600 KB	Output is correct
32	Incorrect	0 ms	344 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Submission #961640

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 19.0

Subtask #4 0 / 35.0

Subtask #5 0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0