oj.uz

Submission #304404

# Submission time Handle Problem Language Result Execution time Memory
304404 2020-09-21T09:30:59 Z rocks03 Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 267 ms 22268 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int) (x).size())
using namespace std;

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

const int MAXN = 1e3+100;

class dsu{
public:
    vector<int> p, sz;
    dsu(int n){
        p.resize(n);
        iota(p.begin(), p.end(), 0);
        sz.resize(n, 1);
    }
    int get(int x){
        return ((x == p[x]) ? x : (p[x] = get(p[x])));
    }
    bool unite(int a, int b){
        a = get(a);
        b = get(b);
        if(a == b)
            return false;
        if(sz[a] < sz[b])
            swap(a, b);
        p[b] = a;
        sz[a] += sz[b];
        return true;
    }
    bool same(int a, int b){
        return (get(a) == get(b));
    }
};

int construct(vector<vector<int>> p){
    int N = SZ(p);
    vector<vector<int>> ans(N, vector<int>(N, 0));
    dsu a(N), b(N);
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            if(p[i][j] > 0){
                a.unite(i, j);
            }
            if(p[i][j] == 3){
                return 0;
            }
        }
    }
    vector<bool> vis(N, false), vis2(N, false);
    for(int vroot = 0; vroot < N; vroot++){
        int root = a.get(vroot);
        if(!vis[root]){
            vis[root] = true;
            vector<int> vert;
            for(int i = 0; i < N; i++){
                if(a.same(i, root)){
                    vert.pb(i);
                }
            }
            bool zero = false, one = true, due = true;
            int n = SZ(vert);
            for(int i = 0; i < n; i++){
                for(int j = 0; j < n; j++){
                    if(p[vert[i]][vert[j]] != 2)
                        due = false;
                    if(p[vert[i]][vert[j]] != 1)
                        one = false;
                    if(p[vert[i]][vert[j]] == 0)
                        zero = true;
                }
            }
            if(zero == true){
                return 0;
            }
            if(one == true){
                for(int i = 1; i < n; i++){
                    ans[vert[i-1]][vert[i]] = 1;
                    ans[vert[i]][vert[i-1]] = 1;
                }
                continue;
            }
            if(due == true){
                if(n < 3)
                    return false;
                for(int i = 1; i < n; i++){
                    ans[vert[i-1]][vert[i]] = 1;
                    ans[vert[i]][vert[i-1]] = 1;
                }
                ans[vert[0]][vert[n-1]] = 1;
                ans[vert[n-1]][vert[0]] = 1;
                continue;
            }
            for(int i = 0; i < n; i++){
                for(int j = 0; j < n; j++){
                    if(p[vert[i]][vert[j]] == 1){
                        b.unite(vert[i], vert[j]);
                    }
                }
            }
            vector<vector<int>> componenti;
            for(int i = 0; i < n; i++){
                int root = b.get(vert[i]);
                vector<int> cur;
                for(int j = 0; j < n; j++){
                    if(b.get(vert[i]) == b.get(vert[j])){
                        if(p[vert[i]][vert[j]] == 2){
                            return 0;
                        }
                        if(!vis2[root])
                            cur.pb(vert[j]);
                    }
                }
                if(!vis2[root]){
                    vis2[root] = true;
                    componenti.pb(cur);
                }
            }
            int sz = SZ(componenti);
            if(sz < 3)
                return 0;
            for(int i = 0; i < sz; i++){
                for(int j = 1; j < SZ(componenti[i]); j++){
                    ans[componenti[i][j-1]][componenti[i][j]] = 1;
                    ans[componenti[i][j]][componenti[i][j-1]] = 1;
                }
            }
            for(int i = 1; i < sz; i++){
                ans[componenti[i-1][0]][componenti[i][0]] = 1;
                ans[componenti[i][0]][componenti[i-1][0]] = 1;
            }
            ans[componenti[sz-1][0]][componenti[0][0]] = 1;
            ans[componenti[0][0]][componenti[sz-1][0]] = 1;
        }
    }
    build(ans);
    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 1 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 255 ms 22100 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 1 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 255 ms 22100 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 267 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 126 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5752 KB Output is correct
21 Correct 250 ms 22136 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 253 ms 22136 KB Output is correct
24 Correct 242 ms 22140 KB Output is correct
25 Correct 108 ms 12152 KB Output is correct
26 Correct 103 ms 12152 KB Output is correct
27 Correct 252 ms 22136 KB Output is correct
28 Correct 243 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 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 245 ms 22264 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 261 ms 22136 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 768 KB Output is correct
17 Correct 126 ms 12152 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 63 ms 5752 KB Output is correct
22 Correct 249 ms 22268 KB Output is correct
23 Correct 241 ms 22136 KB Output is correct
24 Correct 255 ms 22136 KB Output is correct
25 Correct 109 ms 12152 KB Output is correct
26 Correct 107 ms 12152 KB Output is correct
27 Correct 245 ms 22136 KB Output is correct
28 Correct 262 ms 22264 KB Output is correct
29 Correct 106 ms 12156 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 61 ms 5756 KB Output is correct
5 Correct 244 ms 22136 KB Output is correct
6 Correct 245 ms 22136 KB Output is correct
7 Correct 254 ms 22100 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 61 ms 5752 KB Output is correct
10 Correct 243 ms 22136 KB Output is correct
11 Correct 243 ms 22264 KB Output is correct
12 Correct 259 ms 22136 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 61 ms 5752 KB Output is correct
17 Correct 246 ms 22136 KB Output is correct
18 Correct 251 ms 22136 KB Output is correct
19 Correct 240 ms 22136 KB Output is correct
20 Correct 249 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 1 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 255 ms 22100 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 267 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 126 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5752 KB Output is correct
21 Correct 250 ms 22136 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 253 ms 22136 KB Output is correct
24 Correct 242 ms 22140 KB Output is correct
25 Correct 108 ms 12152 KB Output is correct
26 Correct 103 ms 12152 KB Output is correct
27 Correct 252 ms 22136 KB Output is correct
28 Correct 243 ms 22136 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 1 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 245 ms 22264 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 11 ms 1152 KB Output is correct
41 Correct 261 ms 22136 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 768 KB Output is correct
45 Correct 126 ms 12152 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 63 ms 5752 KB Output is correct
50 Correct 249 ms 22268 KB Output is correct
51 Correct 241 ms 22136 KB Output is correct
52 Correct 255 ms 22136 KB Output is correct
53 Correct 109 ms 12152 KB Output is correct
54 Correct 107 ms 12152 KB Output is correct
55 Correct 245 ms 22136 KB Output is correct
56 Correct 262 ms 22264 KB Output is correct
57 Correct 106 ms 12156 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 6 ms 768 KB Output is correct
61 Correct 130 ms 12156 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 0 ms 256 KB Output is correct
64 Correct 1 ms 256 KB Output is correct
65 Correct 66 ms 5752 KB Output is correct
66 Correct 106 ms 12120 KB Output is correct
67 Correct 118 ms 12120 KB Output is correct
68 Correct 104 ms 12152 KB Output is correct
69 Correct 106 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 1 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 255 ms 22100 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 267 ms 22136 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 126 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 61 ms 5752 KB Output is correct
21 Correct 250 ms 22136 KB Output is correct
22 Correct 242 ms 22136 KB Output is correct
23 Correct 253 ms 22136 KB Output is correct
24 Correct 242 ms 22140 KB Output is correct
25 Correct 108 ms 12152 KB Output is correct
26 Correct 103 ms 12152 KB Output is correct
27 Correct 252 ms 22136 KB Output is correct
28 Correct 243 ms 22136 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 0 ms 256 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 1 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 245 ms 22264 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 11 ms 1152 KB Output is correct
41 Correct 261 ms 22136 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 768 KB Output is correct
45 Correct 126 ms 12152 KB Output is correct
46 Correct 0 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 63 ms 5752 KB Output is correct
50 Correct 249 ms 22268 KB Output is correct
51 Correct 241 ms 22136 KB Output is correct
52 Correct 255 ms 22136 KB Output is correct
53 Correct 109 ms 12152 KB Output is correct
54 Correct 107 ms 12152 KB Output is correct
55 Correct 245 ms 22136 KB Output is correct
56 Correct 262 ms 22264 KB Output is correct
57 Correct 106 ms 12156 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 0 ms 256 KB Output is correct
61 Correct 61 ms 5756 KB Output is correct
62 Correct 244 ms 22136 KB Output is correct
63 Correct 245 ms 22136 KB Output is correct
64 Correct 254 ms 22100 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 61 ms 5752 KB Output is correct
67 Correct 243 ms 22136 KB Output is correct
68 Correct 243 ms 22264 KB Output is correct
69 Correct 259 ms 22136 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 ms 256 KB Output is correct
72 Correct 0 ms 256 KB Output is correct
73 Correct 61 ms 5752 KB Output is correct
74 Correct 246 ms 22136 KB Output is correct
75 Correct 251 ms 22136 KB Output is correct
76 Correct 240 ms 22136 KB Output is correct
77 Correct 249 ms 22136 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 6 ms 768 KB Output is correct
81 Correct 130 ms 12156 KB Output is correct
82 Correct 1 ms 256 KB Output is correct
83 Correct 0 ms 256 KB Output is correct
84 Correct 1 ms 256 KB Output is correct
85 Correct 66 ms 5752 KB Output is correct
86 Correct 106 ms 12120 KB Output is correct
87 Correct 118 ms 12120 KB Output is correct
88 Correct 104 ms 12152 KB Output is correct
89 Correct 106 ms 12152 KB Output is correct
90 Correct 0 ms 256 KB Output is correct
91 Correct 0 ms 256 KB Output is correct
92 Correct 5 ms 768 KB Output is correct
93 Correct 109 ms 12152 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 26 ms 3320 KB Output is correct
98 Correct 104 ms 12156 KB Output is correct
99 Correct 110 ms 12152 KB Output is correct
100 Correct 108 ms 12152 KB Output is correct
101 Correct 104 ms 12152 KB Output is correct
102 Correct 110 ms 12152 KB Output is correct
103 Correct 109 ms 12152 KB Output is correct
104 Correct 111 ms 12124 KB Output is correct
105 Correct 108 ms 12120 KB Output is correct