oj.uz

Submission #510550

# Submission time Handle Problem Language Result Execution time Memory
510550 2022-01-15T01:46:56 Z tabr Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 285 ms 22100 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

void build(vector<vector<int>>);

struct dsu {
    vector<int> p;
    vector<int> sz;
    int n;

    dsu(int _n) : n(_n) {
        p.resize(n);
        iota(p.begin(), p.end(), 0);
        sz.assign(n, 1);
    }

    inline int get(int x) {
        if (p[x] == x) {
            return x;
        } else {
            return p[x] = get(p[x]);
        }
    }

    inline bool unite(int x, int y) {
        x = get(x);
        y = get(y);
        if (x == y) {
            return false;
        }
        if (sz[x] > sz[y]) {
            swap(x, y);
        }
        p[x] = y;
        sz[y] += sz[x];
        return true;
    }

    inline bool same(int x, int y) {
        return (get(x) == get(y));
    }
};

int construct(vector<vector<int>> p) {
    int n = (int) p.size();
    dsu uf1(n);
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (p[i][j] == 1) {
                uf1.unite(i, j);
            }
        }
    }
    vector<vector<int>> res(n, vector<int>(n));
    vector<vector<int>> c(n);
    for (int i = 0; i < n; i++) {
        c[uf1.get(i)].emplace_back(i);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 1; j < (int) c[i].size(); j++) {
            res[c[i][0]][c[i][j]] = res[c[i][j]][c[i][0]] = 1;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (p[i][j] != p[uf1.get(i)][uf1.get(j)]) {
                return 0;
            }
        }
    }
    dsu uf2(n);
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (uf1.get(i) == i && uf1.get(j) == j && p[i][j] == 2) {
                uf2.unite(i, j);
            }
        }
    }
    c = vector<vector<int>>(n);
    for (int i = 0; i < n; i++) {
        if (uf1.get(i) == i) {
            c[uf2.get(i)].emplace_back(i);
        }
    }
    for (int i = 0; i < n; i++) {
        int sz = (int) c[i].size();
        if (sz == 0 || sz == 1) {
            continue;
        }
        if (sz == 2) {
            return 0;
        }
        for (int j = 0; j < sz; j++) {
            res[c[i][j]][c[i][(j + 1) % sz]] = res[c[i][(j + 1) % sz]][c[i][j]] = 1;
        }
        for (int x = 0; x < sz; x++) {
            for (int y = x + 1; y < sz; y++) {
                if (p[c[i][x]][c[i][y]] != 2) {
                    return 0;
                }
            }
        }
    }
    build(res);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 13 ms 1180 KB Output is correct
7 Correct 167 ms 22000 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 13 ms 1180 KB Output is correct
7 Correct 167 ms 22000 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 15 ms 1100 KB Output is correct
13 Correct 212 ms 22084 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 8 ms 736 KB Output is correct
17 Correct 128 ms 12156 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 63 ms 5720 KB Output is correct
21 Correct 270 ms 22012 KB Output is correct
22 Correct 224 ms 22024 KB Output is correct
23 Correct 276 ms 22020 KB Output is correct
24 Correct 265 ms 22100 KB Output is correct
25 Correct 145 ms 12160 KB Output is correct
26 Correct 101 ms 12156 KB Output is correct
27 Correct 285 ms 22008 KB Output is correct
28 Correct 212 ms 22024 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 7 ms 1092 KB Output is correct
9 Correct 203 ms 22052 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 8 ms 1100 KB Output is correct
13 Correct 285 ms 22068 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 716 KB Output is correct
17 Correct 116 ms 12168 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 49 ms 5780 KB Output is correct
22 Correct 183 ms 22012 KB Output is correct
23 Correct 191 ms 22036 KB Output is correct
24 Correct 207 ms 22048 KB Output is correct
25 Correct 106 ms 12156 KB Output is correct
26 Correct 84 ms 12156 KB Output is correct
27 Correct 204 ms 22008 KB Output is correct
28 Correct 202 ms 22008 KB Output is correct
29 Correct 68 ms 12100 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 46 ms 5772 KB Output is correct
5 Correct 251 ms 22008 KB Output is correct
6 Correct 195 ms 22008 KB Output is correct
7 Correct 234 ms 22008 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 46 ms 5776 KB Output is correct
10 Correct 240 ms 22084 KB Output is correct
11 Correct 192 ms 22076 KB Output is correct
12 Correct 218 ms 22064 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 46 ms 5704 KB Output is correct
17 Correct 178 ms 22036 KB Output is correct
18 Correct 223 ms 22084 KB Output is correct
19 Correct 238 ms 22100 KB Output is correct
20 Correct 251 ms 22100 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 13 ms 1180 KB Output is correct
7 Correct 167 ms 22000 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 15 ms 1100 KB Output is correct
13 Correct 212 ms 22084 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 8 ms 736 KB Output is correct
17 Correct 128 ms 12156 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 63 ms 5720 KB Output is correct
21 Correct 270 ms 22012 KB Output is correct
22 Correct 224 ms 22024 KB Output is correct
23 Correct 276 ms 22020 KB Output is correct
24 Correct 265 ms 22100 KB Output is correct
25 Correct 145 ms 12160 KB Output is correct
26 Correct 101 ms 12156 KB Output is correct
27 Correct 285 ms 22008 KB Output is correct
28 Correct 212 ms 22024 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 7 ms 1092 KB Output is correct
37 Correct 203 ms 22052 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 8 ms 1100 KB Output is correct
41 Correct 285 ms 22068 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 4 ms 716 KB Output is correct
45 Correct 116 ms 12168 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 49 ms 5780 KB Output is correct
50 Correct 183 ms 22012 KB Output is correct
51 Correct 191 ms 22036 KB Output is correct
52 Correct 207 ms 22048 KB Output is correct
53 Correct 106 ms 12156 KB Output is correct
54 Correct 84 ms 12156 KB Output is correct
55 Correct 204 ms 22008 KB Output is correct
56 Correct 202 ms 22008 KB Output is correct
57 Correct 68 ms 12100 KB Output is correct
58 Correct 1 ms 288 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 4 ms 844 KB Output is correct
61 Correct 91 ms 14060 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 60 ms 6228 KB Output is correct
66 Correct 110 ms 14060 KB Output is correct
67 Correct 121 ms 14084 KB Output is correct
68 Correct 83 ms 14064 KB Output is correct
69 Correct 76 ms 14060 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 13 ms 1180 KB Output is correct
7 Correct 167 ms 22000 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 15 ms 1100 KB Output is correct
13 Correct 212 ms 22084 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 8 ms 736 KB Output is correct
17 Correct 128 ms 12156 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 63 ms 5720 KB Output is correct
21 Correct 270 ms 22012 KB Output is correct
22 Correct 224 ms 22024 KB Output is correct
23 Correct 276 ms 22020 KB Output is correct
24 Correct 265 ms 22100 KB Output is correct
25 Correct 145 ms 12160 KB Output is correct
26 Correct 101 ms 12156 KB Output is correct
27 Correct 285 ms 22008 KB Output is correct
28 Correct 212 ms 22024 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 7 ms 1092 KB Output is correct
37 Correct 203 ms 22052 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 8 ms 1100 KB Output is correct
41 Correct 285 ms 22068 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 4 ms 716 KB Output is correct
45 Correct 116 ms 12168 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 49 ms 5780 KB Output is correct
50 Correct 183 ms 22012 KB Output is correct
51 Correct 191 ms 22036 KB Output is correct
52 Correct 207 ms 22048 KB Output is correct
53 Correct 106 ms 12156 KB Output is correct
54 Correct 84 ms 12156 KB Output is correct
55 Correct 204 ms 22008 KB Output is correct
56 Correct 202 ms 22008 KB Output is correct
57 Correct 68 ms 12100 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 46 ms 5772 KB Output is correct
62 Correct 251 ms 22008 KB Output is correct
63 Correct 195 ms 22008 KB Output is correct
64 Correct 234 ms 22008 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 46 ms 5776 KB Output is correct
67 Correct 240 ms 22084 KB Output is correct
68 Correct 192 ms 22076 KB Output is correct
69 Correct 218 ms 22064 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 46 ms 5704 KB Output is correct
74 Correct 178 ms 22036 KB Output is correct
75 Correct 223 ms 22084 KB Output is correct
76 Correct 238 ms 22100 KB Output is correct
77 Correct 251 ms 22100 KB Output is correct
78 Correct 1 ms 288 KB Output is correct
79 Correct 1 ms 204 KB Output is correct
80 Correct 4 ms 844 KB Output is correct
81 Correct 91 ms 14060 KB Output is correct
82 Correct 0 ms 204 KB Output is correct
83 Correct 1 ms 204 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 60 ms 6228 KB Output is correct
86 Correct 110 ms 14060 KB Output is correct
87 Correct 121 ms 14084 KB Output is correct
88 Correct 83 ms 14064 KB Output is correct
89 Correct 76 ms 14060 KB Output is correct
90 Correct 0 ms 204 KB Output is correct
91 Correct 1 ms 204 KB Output is correct
92 Correct 4 ms 844 KB Output is correct
93 Correct 106 ms 14068 KB Output is correct
94 Correct 1 ms 296 KB Output is correct
95 Correct 0 ms 204 KB Output is correct
96 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
97 Halted 0 ms 0 KB -