oj.uz

Submission #304059

# Submission time Handle Problem Language Result Execution time Memory
304059 2020-09-21T02:08:12 Z 2qbingxuan Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 271 ms 26232 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
#ifdef local
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(...) qqbx(#__VA_ARGS__, __VA_ARGS__)
template <typename H, typename ...T> void qqbx(const char*s, const H &h, T ...args) {
    for(; *s && *s != ','; ++s) if(*s != ' ') std::cerr << *s;
    std::cerr << " = " << h << (sizeof...(T) ? ", " : "\n");
    if constexpr (sizeof...(T)) qqbx(++s, args...);
}
#else
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local
#define pb emplace_back

using namespace std;
typedef long long ll;
const int N = 2500025;

struct Dsu {
    vector<int> pa;
    Dsu(int n) : pa(n) { iota(pa.begin(), pa.end(), 0); }
    int anc(int x) { return x==pa[x] ? x : pa[x]=anc(pa[x]); }
    bool same(int x, int y) { return anc(x) == anc(y); }
    bool join(int x, int y) {
        if((x=anc(x)) == (y=anc(y))) return false;
        return pa[y] = x, true;
    }
};
int construct(vector<vector<int>> p) {
    int n = p.size();
    for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) if(p[i][j] == 3) return 0;
    vector<vector<int>> res(n, vector<int>(n));
    Dsu dsu(n);
    for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) {
        if(p[i][j] == 1) {
            if(dsu.join(i, j)) res[i][j] = res[j][i] = 1;
        }
    }
    vector<vector<int>> g(n);
    vector<int> vis(n);
    for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) {
        if(p[i][j] == 2) {
            int a = dsu.anc(i), b = dsu.anc(j);
            if(a == b) return 0;
            g[a].pb(b);
        }
    }
    function<void(int,vector<int>&)> dfs = [&](int i, vector<int> &v) {
        v.pb(i);
        vis[i] = 1;
        for(int j: g[i]) if(!vis[j]) dfs(j, v);
    };
    for(int i = 0; i < n; i++) if(!vis[i]) {
        if(!g[i].size()) continue;
        vector<int> tmp;
        dfs(i, tmp);
        if(tmp.size() == 2) return 0;
        int last = tmp.back();
        for(int x: tmp) {
            res[last][x] = res[x][last] = 1;
            dsu.join(last, x);
            last = x;
        }
    }
    for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) if(p[i][j] == 0 && dsu.same(i, j)) return 0;
    build(res);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 252 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 252 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 243 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 116 ms 12280 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 62 ms 5880 KB Output is correct
21 Correct 244 ms 22136 KB Output is correct
22 Correct 243 ms 22136 KB Output is correct
23 Correct 258 ms 22136 KB Output is correct
24 Correct 238 ms 22136 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 96 ms 12152 KB Output is correct
27 Correct 250 ms 22228 KB Output is correct
28 Correct 236 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 10 ms 1152 KB Output is correct
9 Correct 243 ms 22392 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1408 KB Output is correct
13 Correct 258 ms 26232 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 122 ms 14676 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 62 ms 6008 KB Output is correct
22 Correct 242 ms 22648 KB Output is correct
23 Correct 243 ms 22136 KB Output is correct
24 Correct 265 ms 25208 KB Output is correct
25 Correct 95 ms 12152 KB Output is correct
26 Correct 103 ms 12764 KB Output is correct
27 Correct 239 ms 22136 KB Output is correct
28 Correct 266 ms 24312 KB Output is correct
29 Correct 100 ms 12152 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 65 ms 5856 KB Output is correct
5 Correct 252 ms 22136 KB Output is correct
6 Correct 266 ms 22232 KB Output is correct
7 Correct 253 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 62 ms 5880 KB Output is correct
10 Correct 246 ms 22648 KB Output is correct
11 Correct 241 ms 22104 KB Output is correct
12 Correct 271 ms 25184 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 61 ms 5880 KB Output is correct
17 Correct 255 ms 22648 KB Output is correct
18 Correct 246 ms 22648 KB Output is correct
19 Correct 243 ms 22264 KB Output is correct
20 Correct 251 ms 22136 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 252 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 243 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 116 ms 12280 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 62 ms 5880 KB Output is correct
21 Correct 244 ms 22136 KB Output is correct
22 Correct 243 ms 22136 KB Output is correct
23 Correct 258 ms 22136 KB Output is correct
24 Correct 238 ms 22136 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 96 ms 12152 KB Output is correct
27 Correct 250 ms 22228 KB Output is correct
28 Correct 236 ms 22136 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 243 ms 22392 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 11 ms 1408 KB Output is correct
41 Correct 258 ms 26232 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 6 ms 896 KB Output is correct
45 Correct 122 ms 14676 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 62 ms 6008 KB Output is correct
50 Correct 242 ms 22648 KB Output is correct
51 Correct 243 ms 22136 KB Output is correct
52 Correct 265 ms 25208 KB Output is correct
53 Correct 95 ms 12152 KB Output is correct
54 Correct 103 ms 12764 KB Output is correct
55 Correct 239 ms 22136 KB Output is correct
56 Correct 266 ms 24312 KB Output is correct
57 Correct 100 ms 12152 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 6 ms 768 KB Output is correct
61 Correct 140 ms 12152 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 1 ms 256 KB Output is correct
64 Correct 0 ms 256 KB Output is correct
65 Correct 78 ms 5880 KB Output is correct
66 Correct 105 ms 12792 KB Output is correct
67 Correct 109 ms 12664 KB Output is correct
68 Correct 102 ms 12280 KB Output is correct
69 Correct 98 ms 12152 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 252 ms 22136 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 243 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 116 ms 12280 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 62 ms 5880 KB Output is correct
21 Correct 244 ms 22136 KB Output is correct
22 Correct 243 ms 22136 KB Output is correct
23 Correct 258 ms 22136 KB Output is correct
24 Correct 238 ms 22136 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 96 ms 12152 KB Output is correct
27 Correct 250 ms 22228 KB Output is correct
28 Correct 236 ms 22136 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 243 ms 22392 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 11 ms 1408 KB Output is correct
41 Correct 258 ms 26232 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 6 ms 896 KB Output is correct
45 Correct 122 ms 14676 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 62 ms 6008 KB Output is correct
50 Correct 242 ms 22648 KB Output is correct
51 Correct 243 ms 22136 KB Output is correct
52 Correct 265 ms 25208 KB Output is correct
53 Correct 95 ms 12152 KB Output is correct
54 Correct 103 ms 12764 KB Output is correct
55 Correct 239 ms 22136 KB Output is correct
56 Correct 266 ms 24312 KB Output is correct
57 Correct 100 ms 12152 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 0 ms 256 KB Output is correct
61 Correct 65 ms 5856 KB Output is correct
62 Correct 252 ms 22136 KB Output is correct
63 Correct 266 ms 22232 KB Output is correct
64 Correct 253 ms 22136 KB Output is correct
65 Correct 1 ms 256 KB Output is correct
66 Correct 62 ms 5880 KB Output is correct
67 Correct 246 ms 22648 KB Output is correct
68 Correct 241 ms 22104 KB Output is correct
69 Correct 271 ms 25184 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 1 ms 256 KB Output is correct
72 Correct 0 ms 256 KB Output is correct
73 Correct 61 ms 5880 KB Output is correct
74 Correct 255 ms 22648 KB Output is correct
75 Correct 246 ms 22648 KB Output is correct
76 Correct 243 ms 22264 KB Output is correct
77 Correct 251 ms 22136 KB Output is correct
78 Correct 1 ms 256 KB Output is correct
79 Correct 0 ms 256 KB Output is correct
80 Correct 6 ms 768 KB Output is correct
81 Correct 140 ms 12152 KB Output is correct
82 Correct 1 ms 256 KB Output is correct
83 Correct 1 ms 256 KB Output is correct
84 Correct 0 ms 256 KB Output is correct
85 Correct 78 ms 5880 KB Output is correct
86 Correct 105 ms 12792 KB Output is correct
87 Correct 109 ms 12664 KB Output is correct
88 Correct 102 ms 12280 KB Output is correct
89 Correct 98 ms 12152 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 6 ms 640 KB Output is correct
93 Correct 106 ms 8184 KB Output is correct
94 Correct 0 ms 256 KB Output is correct
95 Correct 0 ms 256 KB Output is correct
96 Correct 1 ms 256 KB Output is correct
97 Correct 24 ms 2296 KB Output is correct
98 Correct 95 ms 8152 KB Output is correct
99 Correct 102 ms 8184 KB Output is correct
100 Correct 91 ms 8184 KB Output is correct
101 Correct 94 ms 8184 KB Output is correct
102 Correct 103 ms 8184 KB Output is correct
103 Correct 106 ms 8184 KB Output is correct
104 Correct 105 ms 8184 KB Output is correct
105 Correct 105 ms 8184 KB Output is correct