oj.uz

답안 #366990

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
366990 2021-02-15T23:01:58 Z PurpleCrayon 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 258 ms 22252 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

#define ar array
#define sz(v) int(v.size())

int n;

struct DSU {
    vector<int> p, sz;
    void init(int n){ sz.assign(n, 1); p.resize(n); iota(p.begin(), p.end(), 0); }
    int find_set(int v){ return v==p[v]?v:p[v]=find_set(p[v]); }
    bool union_sets(int a, int b){
        if ((a=find_set(a))==(b=find_set(b))) return 0;
        if (sz[a] < sz[b]) swap(a, b);
        p[b]=a, sz[a]+=sz[b], sz[b]=0;
        return 1;
    }
} d;

int construct(vector<vector<int>> g) {
	n = sz(g);
    vector<vector<int>> ans(n, vector<int>(n));


    bool done=0, bad=0;

    [&](){ //handle case with a 3
        if (done || bad) return;

        for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (g[i][j] == 3) {
            bad=1; return;
        }
    }();

    
    [&](){ //only 1's (tree)
        if (done || bad) return;

        for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++) if (g[i][j] != 1) return;
        for (int i = 1; i < n; i++) ans[i][0] = ans[0][i] = 1;

        build(ans), done=1;
    }();

    [&](){ //0, 1's (just deal with separate comps)
        if (done || bad) return;

        for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++) if (g[i][j] != 0 && g[i][j] != 1) return;

        d.init(n);
        for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++) if (g[i][j])
            if (d.union_sets(i, j)) ans[i][j] = ans[j][i] = 1;

        for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++)
            if ((d.find_set(i) == d.find_set(j))^bool(g[i][j])) return;

        build(ans), done=1;
    }();

    [&](){ //0, 2's (just deal with separate comps, put everything into cycles instead of trees)
        if (done || bad) return;

        for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++) if (g[i][j] != 0 && g[i][j] != 2) return;

        d.init(n);
        for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++) if (g[i][j])
            d.union_sets(i, j);

        for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++)
            if ((d.find_set(i) == d.find_set(j))^bool(g[i][j])) return;

        vector<vector<int>> comp(n);
        for (int i = 0; i < n; i++) comp[d.find_set(i)].push_back(i);

        for (int i = 0; i < n; i++) if (sz(comp[i]) > 1){
            if (sz(comp[i]) == 2) return;
            for (int j = 0; j < sz(comp[i]); j++){
                int nxt=(j+1)%sz(comp[i]);
                ans[comp[i][j]][comp[i][nxt]] = ans[comp[i][nxt]][comp[i][j]] = 1;
            }
        }

        build(ans), done=1;
    }();

    
    
	return !bad && done;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 10 ms 1260 KB Output is correct
7 Correct 240 ms 22124 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 10 ms 1260 KB Output is correct
7 Correct 240 ms 22124 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1260 KB Output is correct
13 Correct 247 ms 22124 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 115 ms 12140 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 61 ms 5868 KB Output is correct
21 Correct 241 ms 22124 KB Output is correct
22 Correct 244 ms 22180 KB Output is correct
23 Correct 251 ms 22124 KB Output is correct
24 Correct 244 ms 22124 KB Output is correct
25 Correct 104 ms 12140 KB Output is correct
26 Correct 101 ms 12140 KB Output is correct
27 Correct 251 ms 22112 KB Output is correct
28 Correct 240 ms 22148 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 10 ms 1260 KB Output is correct
9 Correct 243 ms 22124 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 10 ms 1260 KB Output is correct
13 Correct 248 ms 22240 KB Output is correct
14 Correct 1 ms 396 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 113 ms 12232 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 0 ms 364 KB Output is correct
21 Correct 63 ms 5868 KB Output is correct
22 Correct 243 ms 22124 KB Output is correct
23 Correct 240 ms 22124 KB Output is correct
24 Correct 255 ms 22124 KB Output is correct
25 Correct 107 ms 12268 KB Output is correct
26 Correct 103 ms 12156 KB Output is correct
27 Correct 243 ms 22252 KB Output is correct
28 Correct 252 ms 22124 KB Output is correct
29 Correct 107 ms 12268 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 63 ms 5868 KB Output is correct
5 Correct 242 ms 22136 KB Output is correct
6 Correct 238 ms 22124 KB Output is correct
7 Correct 258 ms 22124 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 61 ms 5868 KB Output is correct
10 Correct 243 ms 22124 KB Output is correct
11 Correct 243 ms 22112 KB Output is correct
12 Correct 255 ms 22252 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Incorrect 1 ms 364 KB Answer gives possible 0 while actual possible 1
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 10 ms 1260 KB Output is correct
7 Correct 240 ms 22124 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1260 KB Output is correct
13 Correct 247 ms 22124 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 115 ms 12140 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 61 ms 5868 KB Output is correct
21 Correct 241 ms 22124 KB Output is correct
22 Correct 244 ms 22180 KB Output is correct
23 Correct 251 ms 22124 KB Output is correct
24 Correct 244 ms 22124 KB Output is correct
25 Correct 104 ms 12140 KB Output is correct
26 Correct 101 ms 12140 KB Output is correct
27 Correct 251 ms 22112 KB Output is correct
28 Correct 240 ms 22148 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 0 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 10 ms 1260 KB Output is correct
37 Correct 243 ms 22124 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 0 ms 364 KB Output is correct
40 Correct 10 ms 1260 KB Output is correct
41 Correct 248 ms 22240 KB Output is correct
42 Correct 1 ms 396 KB Output is correct
43 Correct 0 ms 364 KB Output is correct
44 Correct 5 ms 748 KB Output is correct
45 Correct 113 ms 12232 KB Output is correct
46 Correct 0 ms 364 KB Output is correct
47 Correct 0 ms 364 KB Output is correct
48 Correct 0 ms 364 KB Output is correct
49 Correct 63 ms 5868 KB Output is correct
50 Correct 243 ms 22124 KB Output is correct
51 Correct 240 ms 22124 KB Output is correct
52 Correct 255 ms 22124 KB Output is correct
53 Correct 107 ms 12268 KB Output is correct
54 Correct 103 ms 12156 KB Output is correct
55 Correct 243 ms 22252 KB Output is correct
56 Correct 252 ms 22124 KB Output is correct
57 Correct 107 ms 12268 KB Output is correct
58 Correct 0 ms 364 KB Output is correct
59 Correct 0 ms 364 KB Output is correct
60 Correct 5 ms 748 KB Output is correct
61 Correct 109 ms 12140 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Incorrect 0 ms 364 KB Answer gives possible 0 while actual possible 1
64 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 10 ms 1260 KB Output is correct
7 Correct 240 ms 22124 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1260 KB Output is correct
13 Correct 247 ms 22124 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 5 ms 748 KB Output is correct
17 Correct 115 ms 12140 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 61 ms 5868 KB Output is correct
21 Correct 241 ms 22124 KB Output is correct
22 Correct 244 ms 22180 KB Output is correct
23 Correct 251 ms 22124 KB Output is correct
24 Correct 244 ms 22124 KB Output is correct
25 Correct 104 ms 12140 KB Output is correct
26 Correct 101 ms 12140 KB Output is correct
27 Correct 251 ms 22112 KB Output is correct
28 Correct 240 ms 22148 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 0 ms 364 KB Output is correct
33 Correct 0 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 10 ms 1260 KB Output is correct
37 Correct 243 ms 22124 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 0 ms 364 KB Output is correct
40 Correct 10 ms 1260 KB Output is correct
41 Correct 248 ms 22240 KB Output is correct
42 Correct 1 ms 396 KB Output is correct
43 Correct 0 ms 364 KB Output is correct
44 Correct 5 ms 748 KB Output is correct
45 Correct 113 ms 12232 KB Output is correct
46 Correct 0 ms 364 KB Output is correct
47 Correct 0 ms 364 KB Output is correct
48 Correct 0 ms 364 KB Output is correct
49 Correct 63 ms 5868 KB Output is correct
50 Correct 243 ms 22124 KB Output is correct
51 Correct 240 ms 22124 KB Output is correct
52 Correct 255 ms 22124 KB Output is correct
53 Correct 107 ms 12268 KB Output is correct
54 Correct 103 ms 12156 KB Output is correct
55 Correct 243 ms 22252 KB Output is correct
56 Correct 252 ms 22124 KB Output is correct
57 Correct 107 ms 12268 KB Output is correct
58 Correct 0 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 63 ms 5868 KB Output is correct
62 Correct 242 ms 22136 KB Output is correct
63 Correct 238 ms 22124 KB Output is correct
64 Correct 258 ms 22124 KB Output is correct
65 Correct 0 ms 364 KB Output is correct
66 Correct 61 ms 5868 KB Output is correct
67 Correct 243 ms 22124 KB Output is correct
68 Correct 243 ms 22112 KB Output is correct
69 Correct 255 ms 22252 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Incorrect 1 ms 364 KB Answer gives possible 0 while actual possible 1
72 Halted 0 ms 0 KB -