oj.uz

Submission #586762

# Submission time Handle Problem Language Result Execution time Memory
586762 2022-06-30T16:38:29 Z PiejanVDC Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 225 ms 24012 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

void build(std::vector<std::vector<int>> _b);

vector<int>par;
vector<int>cpar;

int UF(int u) {
    if(par[u] == u)
        return u;
    return par[u] = UF(par[u]);
}

int CUF(int u) {
    if(cpar[u] == u)
        return u;
    return cpar[u] = CUF(cpar[u]);
}

int construct(vector<vector<int>> p) {
    int n = p.size();

    par.resize(n);
    cpar.resize(n);

    vector<bool>has_cycle(n,0);

    for(int i = 0 ; i < n ; i++)
        par[i] = cpar[i] = i;

    bool ok = 1;

    vector<vector<int>>ans(n, vector<int>(n,0));

    for(int i = 0 ; i < n ; i++) {
        for(int j = i+1 ; j < n ; j++) {
            if(p[i][j] == 3)
                ok = 0;
            if(p[i][j] == 1) {
                int A = UF(i), B = UF(j);
                if(A == B)
                    continue;
                ans[i][j] = ans[j][i] = 1;
                par[A] = B;
            }
        }
    }

    for(int i = 0 ; i < n ; i++) {
        for(int j = i+1 ; j < n ; j++) {
            if(p[i][j] == 2) {
                int A = CUF(UF(i)), B = CUF(UF(j));
                if(A == B)
                    continue;
                cpar[A] = B;
            }
        }
    }

    for(int i = 0 ; i < n ; i++) {
        for(int j = i+1 ; j < n ; j++) {
            int A = UF(i), B = UF(j);
            if(A == B && p[i][j] != 1)
                ok = 0;
            A = CUF(i), B = CUF(j);
            if(A == B && p[i][j] != 2)
                ok = 0;
        }
    }

    for(int i = 0 ; i < n ; i++) {
        for(int j = i+1 ; j < n ; j++) {
            if(p[i][j] == 0 && CUF(UF(i)) == CUF(UF(j)))
                ok = 0;
        }
    }

    for(int i = 0 ; i < n ; i++) {
        if(CUF(i) != i)
            continue;
        int f = -1, l = -1;
        int cnt = 0;
        for(int j = 0 ; j < n ; j++) {
            if(CUF(j) == i) {
                cnt++;
                if(f == -1)
                    f = j;
                if(l != -1)
                    ans[l][j] = ans[j][l] = 1;
                l = j;
            }
        }
        if(cnt == 2)
            ok = 0;
        if(f == l)
            continue;
        ans[l][f] = ans[f][l] = 1;
    }
    if(ok) {
        build(ans);
        return 1;
    }
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 8 ms 1108 KB Output is correct
7 Correct 179 ms 22032 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 8 ms 1108 KB Output is correct
7 Correct 179 ms 22032 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 180 ms 21940 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 7 ms 708 KB Output is correct
17 Correct 92 ms 12036 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 48 ms 5744 KB Output is correct
21 Correct 171 ms 22028 KB Output is correct
22 Correct 196 ms 22020 KB Output is correct
23 Correct 192 ms 22000 KB Output is correct
24 Correct 191 ms 21948 KB Output is correct
25 Correct 85 ms 12032 KB Output is correct
26 Correct 83 ms 12036 KB Output is correct
27 Correct 197 ms 22020 KB Output is correct
28 Correct 184 ms 22152 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 260 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 280 KB Output is correct
8 Correct 7 ms 1108 KB Output is correct
9 Correct 186 ms 22048 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 184 ms 21976 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 89 ms 12052 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 53 ms 6244 KB Output is correct
22 Correct 186 ms 24012 KB Output is correct
23 Correct 187 ms 23888 KB Output is correct
24 Correct 182 ms 23932 KB Output is correct
25 Correct 87 ms 14068 KB Output is correct
26 Correct 84 ms 14100 KB Output is correct
27 Correct 176 ms 23920 KB Output is correct
28 Correct 190 ms 23932 KB Output is correct
29 Correct 81 ms 14068 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 53 ms 5808 KB Output is correct
5 Correct 180 ms 21996 KB Output is correct
6 Correct 181 ms 22032 KB Output is correct
7 Correct 215 ms 22004 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 46 ms 6248 KB Output is correct
10 Correct 187 ms 23936 KB Output is correct
11 Correct 182 ms 23936 KB Output is correct
12 Correct 225 ms 23912 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 46 ms 6220 KB Output is correct
17 Correct 200 ms 23924 KB Output is correct
18 Correct 186 ms 23968 KB Output is correct
19 Correct 203 ms 23900 KB Output is correct
20 Correct 175 ms 23888 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 8 ms 1108 KB Output is correct
7 Correct 179 ms 22032 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 180 ms 21940 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 7 ms 708 KB Output is correct
17 Correct 92 ms 12036 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 48 ms 5744 KB Output is correct
21 Correct 171 ms 22028 KB Output is correct
22 Correct 196 ms 22020 KB Output is correct
23 Correct 192 ms 22000 KB Output is correct
24 Correct 191 ms 21948 KB Output is correct
25 Correct 85 ms 12032 KB Output is correct
26 Correct 83 ms 12036 KB Output is correct
27 Correct 197 ms 22020 KB Output is correct
28 Correct 184 ms 22152 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 260 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 280 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 186 ms 22048 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 8 ms 1108 KB Output is correct
41 Correct 184 ms 21976 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 89 ms 12052 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 53 ms 6244 KB Output is correct
50 Correct 186 ms 24012 KB Output is correct
51 Correct 187 ms 23888 KB Output is correct
52 Correct 182 ms 23932 KB Output is correct
53 Correct 87 ms 14068 KB Output is correct
54 Correct 84 ms 14100 KB Output is correct
55 Correct 176 ms 23920 KB Output is correct
56 Correct 190 ms 23932 KB Output is correct
57 Correct 81 ms 14068 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 6 ms 852 KB Output is correct
61 Correct 88 ms 14068 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 300 KB Output is correct
64 Correct 1 ms 300 KB Output is correct
65 Correct 45 ms 6224 KB Output is correct
66 Correct 85 ms 14068 KB Output is correct
67 Correct 95 ms 14064 KB Output is correct
68 Correct 85 ms 14104 KB Output is correct
69 Correct 78 ms 14064 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 8 ms 1108 KB Output is correct
7 Correct 179 ms 22032 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 180 ms 21940 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 7 ms 708 KB Output is correct
17 Correct 92 ms 12036 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 48 ms 5744 KB Output is correct
21 Correct 171 ms 22028 KB Output is correct
22 Correct 196 ms 22020 KB Output is correct
23 Correct 192 ms 22000 KB Output is correct
24 Correct 191 ms 21948 KB Output is correct
25 Correct 85 ms 12032 KB Output is correct
26 Correct 83 ms 12036 KB Output is correct
27 Correct 197 ms 22020 KB Output is correct
28 Correct 184 ms 22152 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 260 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 280 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 186 ms 22048 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 8 ms 1108 KB Output is correct
41 Correct 184 ms 21976 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 89 ms 12052 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 53 ms 6244 KB Output is correct
50 Correct 186 ms 24012 KB Output is correct
51 Correct 187 ms 23888 KB Output is correct
52 Correct 182 ms 23932 KB Output is correct
53 Correct 87 ms 14068 KB Output is correct
54 Correct 84 ms 14100 KB Output is correct
55 Correct 176 ms 23920 KB Output is correct
56 Correct 190 ms 23932 KB Output is correct
57 Correct 81 ms 14068 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 53 ms 5808 KB Output is correct
62 Correct 180 ms 21996 KB Output is correct
63 Correct 181 ms 22032 KB Output is correct
64 Correct 215 ms 22004 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 46 ms 6248 KB Output is correct
67 Correct 187 ms 23936 KB Output is correct
68 Correct 182 ms 23936 KB Output is correct
69 Correct 225 ms 23912 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 46 ms 6220 KB Output is correct
74 Correct 200 ms 23924 KB Output is correct
75 Correct 186 ms 23968 KB Output is correct
76 Correct 203 ms 23900 KB Output is correct
77 Correct 175 ms 23888 KB Output is correct
78 Correct 1 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 6 ms 852 KB Output is correct
81 Correct 88 ms 14068 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 1 ms 300 KB Output is correct
84 Correct 1 ms 300 KB Output is correct
85 Correct 45 ms 6224 KB Output is correct
86 Correct 85 ms 14068 KB Output is correct
87 Correct 95 ms 14064 KB Output is correct
88 Correct 85 ms 14104 KB Output is correct
89 Correct 78 ms 14064 KB Output is correct
90 Correct 0 ms 212 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 4 ms 852 KB Output is correct
93 Correct 87 ms 14080 KB Output is correct
94 Correct 1 ms 212 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 22 ms 3712 KB Output is correct
98 Correct 82 ms 14124 KB Output is correct
99 Correct 88 ms 13992 KB Output is correct
100 Correct 116 ms 14068 KB Output is correct
101 Correct 80 ms 14064 KB Output is correct
102 Correct 73 ms 14028 KB Output is correct
103 Correct 79 ms 14100 KB Output is correct
104 Correct 89 ms 14068 KB Output is correct
105 Correct 93 ms 14080 KB Output is correct