oj.uz

답안 #814834

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
814834 2023-08-08T10:26:26 Z jlallas384 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 170 ms 24068 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;

struct ufds{
    vector<int> sz, par;
    ufds(int n): sz(n, 1), par(n){
        iota(par.begin(), par.end(), 0);
    }
    int find(int a){
        return par[a] == a ? a : par[a] = find(par[a]);
    }
    int unite(int a, int b){
        a = find(a), b = find(b);
        if(a == b) return 0;
        if(sz[a] < sz[b]) swap(a, b);
        par[b] = a;
        sz[a] += sz[b];
        return 1;
    }
};

int construct(std::vector<std::vector<int>> p){
    int n = p.size();
    vector<vector<int>> ans(n, vector<int>(n));
    ufds ds(n);
    for(int i = 0; i < n; i++){
        if(p[i][i] != 1) return 0;
        for(int j = 0; j < n; j++){
            if(p[i][j] != p[j][i]) return 0;
            if(p[i][j] == 3) return 0;
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(p[i][j] == 1){
                ds.unite(i, j);
            }else if(p[i][j] == 0){
                if(ds.find(i) == ds.find(j)){
                    return 0;
                }
            }
        }
    }
    vector<int> rep;
    for(int i = 0; i < n; i++){
        int p = ds.find(i);
        if(i != p){
            ans[i][p] = ans[p][i] = 1;
        }else{
            rep.push_back(i);
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(p[i][j] == 2){
                ds.unite(i, j);
            }else if(p[i][j] == 0){
                if(ds.find(i) == ds.find(j)){
                    return 0;
                }
            }
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(p[i][j] == 0 && ds.find(i) == ds.find(j)) return 0;
        }
    }
    vector<vector<int>> comp(n);
    for(int x: rep){
        comp[ds.find(x)].push_back(x);
    }
    for(int i = 0; i < n; i++){
        if(comp[i].size() == 2) return 0;
        else if(comp[i].size() >= 3){
            for(int j = 0; j < comp[i].size(); j++){
                int a = comp[i][j], b = comp[i][(j + 1) % comp[i].size()];
                ans[a][b] = ans[b][a] = 1;
            }
        }
    }
    build(ans);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:77:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |             for(int j = 0; j < comp[i].size(); j++){
      |                            ~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 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 7 ms 1212 KB Output is correct
7 Correct 151 ms 23928 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 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 7 ms 1212 KB Output is correct
7 Correct 151 ms 23928 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1268 KB Output is correct
13 Correct 152 ms 24048 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 296 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 67 ms 14064 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 41 ms 6192 KB Output is correct
21 Correct 160 ms 24012 KB Output is correct
22 Correct 160 ms 24052 KB Output is correct
23 Correct 163 ms 23912 KB Output is correct
24 Correct 156 ms 24068 KB Output is correct
25 Correct 67 ms 14084 KB Output is correct
26 Correct 70 ms 14064 KB Output is correct
27 Correct 161 ms 23920 KB Output is correct
28 Correct 158 ms 24052 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 296 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 1 ms 212 KB Output is correct
8 Correct 7 ms 1184 KB Output is correct
9 Correct 157 ms 24056 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1208 KB Output is correct
13 Correct 160 ms 24020 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 792 KB Output is correct
17 Correct 70 ms 14068 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 308 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 42 ms 6240 KB Output is correct
22 Correct 159 ms 23932 KB Output is correct
23 Correct 157 ms 24056 KB Output is correct
24 Correct 162 ms 24024 KB Output is correct
25 Correct 69 ms 14156 KB Output is correct
26 Correct 67 ms 14076 KB Output is correct
27 Correct 160 ms 23980 KB Output is correct
28 Correct 167 ms 23924 KB Output is correct
29 Correct 68 ms 14080 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 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 46 ms 6172 KB Output is correct
5 Correct 160 ms 23964 KB Output is correct
6 Correct 161 ms 24068 KB Output is correct
7 Correct 162 ms 23936 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 43 ms 6172 KB Output is correct
10 Correct 164 ms 23936 KB Output is correct
11 Correct 159 ms 24048 KB Output is correct
12 Correct 162 ms 24056 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 40 ms 6192 KB Output is correct
17 Correct 160 ms 24036 KB Output is correct
18 Correct 170 ms 24044 KB Output is correct
19 Correct 162 ms 23936 KB Output is correct
20 Correct 161 ms 24020 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 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 7 ms 1212 KB Output is correct
7 Correct 151 ms 23928 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1268 KB Output is correct
13 Correct 152 ms 24048 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 296 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 67 ms 14064 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 41 ms 6192 KB Output is correct
21 Correct 160 ms 24012 KB Output is correct
22 Correct 160 ms 24052 KB Output is correct
23 Correct 163 ms 23912 KB Output is correct
24 Correct 156 ms 24068 KB Output is correct
25 Correct 67 ms 14084 KB Output is correct
26 Correct 70 ms 14064 KB Output is correct
27 Correct 161 ms 23920 KB Output is correct
28 Correct 158 ms 24052 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 296 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 1 ms 212 KB Output is correct
36 Correct 7 ms 1184 KB Output is correct
37 Correct 157 ms 24056 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 7 ms 1208 KB Output is correct
41 Correct 160 ms 24020 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 792 KB Output is correct
45 Correct 70 ms 14068 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 308 KB Output is correct
48 Correct 0 ms 300 KB Output is correct
49 Correct 42 ms 6240 KB Output is correct
50 Correct 159 ms 23932 KB Output is correct
51 Correct 157 ms 24056 KB Output is correct
52 Correct 162 ms 24024 KB Output is correct
53 Correct 69 ms 14156 KB Output is correct
54 Correct 67 ms 14076 KB Output is correct
55 Correct 160 ms 23980 KB Output is correct
56 Correct 167 ms 23924 KB Output is correct
57 Correct 68 ms 14080 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 3 ms 852 KB Output is correct
61 Correct 62 ms 13996 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 1 ms 296 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 40 ms 6220 KB Output is correct
66 Correct 65 ms 14064 KB Output is correct
67 Correct 66 ms 14000 KB Output is correct
68 Correct 66 ms 14092 KB Output is correct
69 Correct 69 ms 14080 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 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 7 ms 1212 KB Output is correct
7 Correct 151 ms 23928 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1268 KB Output is correct
13 Correct 152 ms 24048 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 296 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 67 ms 14064 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 41 ms 6192 KB Output is correct
21 Correct 160 ms 24012 KB Output is correct
22 Correct 160 ms 24052 KB Output is correct
23 Correct 163 ms 23912 KB Output is correct
24 Correct 156 ms 24068 KB Output is correct
25 Correct 67 ms 14084 KB Output is correct
26 Correct 70 ms 14064 KB Output is correct
27 Correct 161 ms 23920 KB Output is correct
28 Correct 158 ms 24052 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 296 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 1 ms 212 KB Output is correct
36 Correct 7 ms 1184 KB Output is correct
37 Correct 157 ms 24056 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 7 ms 1208 KB Output is correct
41 Correct 160 ms 24020 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 792 KB Output is correct
45 Correct 70 ms 14068 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 308 KB Output is correct
48 Correct 0 ms 300 KB Output is correct
49 Correct 42 ms 6240 KB Output is correct
50 Correct 159 ms 23932 KB Output is correct
51 Correct 157 ms 24056 KB Output is correct
52 Correct 162 ms 24024 KB Output is correct
53 Correct 69 ms 14156 KB Output is correct
54 Correct 67 ms 14076 KB Output is correct
55 Correct 160 ms 23980 KB Output is correct
56 Correct 167 ms 23924 KB Output is correct
57 Correct 68 ms 14080 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 46 ms 6172 KB Output is correct
62 Correct 160 ms 23964 KB Output is correct
63 Correct 161 ms 24068 KB Output is correct
64 Correct 162 ms 23936 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 43 ms 6172 KB Output is correct
67 Correct 164 ms 23936 KB Output is correct
68 Correct 159 ms 24048 KB Output is correct
69 Correct 162 ms 24056 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 300 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 40 ms 6192 KB Output is correct
74 Correct 160 ms 24036 KB Output is correct
75 Correct 170 ms 24044 KB Output is correct
76 Correct 162 ms 23936 KB Output is correct
77 Correct 161 ms 24020 KB Output is correct
78 Correct 1 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 3 ms 852 KB Output is correct
81 Correct 62 ms 13996 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 1 ms 296 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 40 ms 6220 KB Output is correct
86 Correct 65 ms 14064 KB Output is correct
87 Correct 66 ms 14000 KB Output is correct
88 Correct 66 ms 14092 KB Output is correct
89 Correct 69 ms 14080 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 61 ms 13972 KB Output is correct
94 Correct 1 ms 284 KB Output is correct
95 Correct 0 ms 212 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Correct 16 ms 3704 KB Output is correct
98 Correct 73 ms 14064 KB Output is correct
99 Correct 61 ms 14064 KB Output is correct
100 Correct 60 ms 14064 KB Output is correct
101 Correct 62 ms 14084 KB Output is correct
102 Correct 58 ms 14028 KB Output is correct
103 Correct 61 ms 14068 KB Output is correct
104 Correct 65 ms 14076 KB Output is correct
105 Correct 61 ms 14072 KB Output is correct