답안 #808511

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
808511 2023-08-05T07:27:26 Z drdilyor 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
205 ms 22156 KB
#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;
using ll = long long;
const int inf = 1e9;

#ifdef ONPC
#define debug(args...) {cout << "[" << #args << "]: "; debug_out(args);}
#else
#define debug(args...) {42;}
#endif

void debug_out() {
    cout << endl;
}
template<typename H, typename... T>
void debug_out(vector<H> h, T... t) {
    cout << "{";
    for (H i : h) cout << i << ", ";
    cout << "}, ";
    debug_out(t...);
}
template<typename H, typename... T>
void debug_out(H h, T... t) {
    cout << h << ", ";
    debug_out(t...);
}

struct DSU {
    int n;
    vector<int> par;
    DSU(int n) : n(n), par(n) {
        for (int i = 0; i < n; i++)
            par[i] = i;
    }
    void merge(int a, int b) {
        a = get(a), b = get(b);
        par[b] = a;
    }
    int get(int i) {
        return par[i] == i ? i : par[i] = get(par[i]);
    }
};

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
    vector ans(n, vector<int>(n));
    int three = 0;

    DSU cc1(n), cc(n);
    for (int i = 0;i  < n;i++)
        for (int j = 0; j < n; j++) {
            three += p[i][j] == 3;
            if (p[i][j] == 1)
                cc1.merge(i, j);
            if (p[i][j])
                cc.merge(i, j);
        }

    if (three) return 0;

    DSU rcc(n), rcc1(n);

    for (int i = 0; i < n; i++) {
        int j = cc1.get(i);
        if (j == i) continue;
        ans[i][j] = ans[j][i] = 1;
        rcc1.merge(i, j);
    }


    for (int i = 0; i < n; i++) {
        if (cc.get(i) != i) continue;
        vector<int> full{i};
        for (int j = 0; j < n; j++) {
            if (j == i) continue;
            if (cc.get(j) == cc.get(i))
                full.push_back(cc1.get(j));
        }
        debug(full);
        sort(full.begin(), full.end());
        full.erase(unique(full.begin(), full.end()), full.end());
        if (full.size() == 2) return 0;
        if (full.size() == 1) continue;
        int m = full.size();
        for (int j = 0; j < m; j++) {
            ans[full[j]][full[(j + 1) % m]] = 1;
            ans[full[(j + 1) % m]][full[j]] = 1;
        }
    }
    for (int i = 0; i < n;i++)
        for (int j = 0; j < n; j++)
            if (ans[i][j])
                rcc.merge(i, j);

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (pair(cc.get(i) == cc.get(j), cc1.get(i) == cc1.get(j))
                    != pair(rcc.get(i) == rcc.get(j), rcc1.get(i) == rcc1.get(j)))
                return 0;
            if (bool(p[i][j]) != (rcc.get(i) == rcc.get(j)))
                return 0;
        }
    }

    build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:10:25: warning: statement has no effect [-Wunused-value]
   10 | #define debug(args...) {42;}
      |                         ^~
supertrees.cpp:80:9: note: in expansion of macro 'debug'
   80 |         debug(full);
      |         ^~~~~
# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1176 KB Output is correct
7 Correct 165 ms 22064 KB Output is correct
# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1176 KB Output is correct
7 Correct 165 ms 22064 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 161 ms 22048 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 71 ms 12160 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 41 ms 5664 KB Output is correct
21 Correct 179 ms 22032 KB Output is correct
22 Correct 181 ms 21964 KB Output is correct
23 Correct 174 ms 21964 KB Output is correct
24 Correct 157 ms 22020 KB Output is correct
25 Correct 66 ms 12048 KB Output is correct
26 Correct 65 ms 12032 KB Output is correct
27 Correct 167 ms 22016 KB Output is correct
28 Correct 173 ms 22004 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 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 0 ms 212 KB Output is correct
8 Correct 9 ms 1108 KB Output is correct
9 Correct 155 ms 22024 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1096 KB Output is correct
13 Correct 169 ms 22056 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 724 KB Output is correct
17 Correct 85 ms 12032 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 260 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 47 ms 5712 KB Output is correct
22 Correct 190 ms 21988 KB Output is correct
23 Correct 173 ms 22044 KB Output is correct
24 Correct 170 ms 22012 KB Output is correct
25 Correct 60 ms 12048 KB Output is correct
26 Correct 63 ms 12036 KB Output is correct
27 Correct 178 ms 22044 KB Output is correct
28 Correct 173 ms 21940 KB Output is correct
29 Correct 60 ms 12048 KB Output is correct
# 결과 실행 시간 메모리 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 41 ms 5708 KB Output is correct
5 Correct 169 ms 22016 KB Output is correct
6 Correct 161 ms 22028 KB Output is correct
7 Correct 167 ms 21980 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 40 ms 5708 KB Output is correct
10 Correct 162 ms 22016 KB Output is correct
11 Correct 160 ms 22156 KB Output is correct
12 Correct 173 ms 22036 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 41 ms 5768 KB Output is correct
17 Correct 162 ms 22040 KB Output is correct
18 Correct 205 ms 21964 KB Output is correct
19 Correct 169 ms 21972 KB Output is correct
20 Correct 158 ms 21964 KB Output is correct
# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1176 KB Output is correct
7 Correct 165 ms 22064 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 161 ms 22048 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 71 ms 12160 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 41 ms 5664 KB Output is correct
21 Correct 179 ms 22032 KB Output is correct
22 Correct 181 ms 21964 KB Output is correct
23 Correct 174 ms 21964 KB Output is correct
24 Correct 157 ms 22020 KB Output is correct
25 Correct 66 ms 12048 KB Output is correct
26 Correct 65 ms 12032 KB Output is correct
27 Correct 167 ms 22016 KB Output is correct
28 Correct 173 ms 22004 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 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 0 ms 212 KB Output is correct
36 Correct 9 ms 1108 KB Output is correct
37 Correct 155 ms 22024 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1096 KB Output is correct
41 Correct 169 ms 22056 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 724 KB Output is correct
45 Correct 85 ms 12032 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 260 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 47 ms 5712 KB Output is correct
50 Correct 190 ms 21988 KB Output is correct
51 Correct 173 ms 22044 KB Output is correct
52 Correct 170 ms 22012 KB Output is correct
53 Correct 60 ms 12048 KB Output is correct
54 Correct 63 ms 12036 KB Output is correct
55 Correct 178 ms 22044 KB Output is correct
56 Correct 173 ms 21940 KB Output is correct
57 Correct 60 ms 12048 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 724 KB Output is correct
61 Correct 71 ms 12032 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 42 ms 5696 KB Output is correct
66 Correct 68 ms 12040 KB Output is correct
67 Correct 61 ms 12112 KB Output is correct
68 Correct 61 ms 12032 KB Output is correct
69 Correct 59 ms 12032 KB Output is correct
# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 1176 KB Output is correct
7 Correct 165 ms 22064 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 161 ms 22048 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 71 ms 12160 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 41 ms 5664 KB Output is correct
21 Correct 179 ms 22032 KB Output is correct
22 Correct 181 ms 21964 KB Output is correct
23 Correct 174 ms 21964 KB Output is correct
24 Correct 157 ms 22020 KB Output is correct
25 Correct 66 ms 12048 KB Output is correct
26 Correct 65 ms 12032 KB Output is correct
27 Correct 167 ms 22016 KB Output is correct
28 Correct 173 ms 22004 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 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 0 ms 212 KB Output is correct
36 Correct 9 ms 1108 KB Output is correct
37 Correct 155 ms 22024 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1096 KB Output is correct
41 Correct 169 ms 22056 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 724 KB Output is correct
45 Correct 85 ms 12032 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 260 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 47 ms 5712 KB Output is correct
50 Correct 190 ms 21988 KB Output is correct
51 Correct 173 ms 22044 KB Output is correct
52 Correct 170 ms 22012 KB Output is correct
53 Correct 60 ms 12048 KB Output is correct
54 Correct 63 ms 12036 KB Output is correct
55 Correct 178 ms 22044 KB Output is correct
56 Correct 173 ms 21940 KB Output is correct
57 Correct 60 ms 12048 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 41 ms 5708 KB Output is correct
62 Correct 169 ms 22016 KB Output is correct
63 Correct 161 ms 22028 KB Output is correct
64 Correct 167 ms 21980 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 40 ms 5708 KB Output is correct
67 Correct 162 ms 22016 KB Output is correct
68 Correct 160 ms 22156 KB Output is correct
69 Correct 173 ms 22036 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 41 ms 5768 KB Output is correct
74 Correct 162 ms 22040 KB Output is correct
75 Correct 205 ms 21964 KB Output is correct
76 Correct 169 ms 21972 KB Output is correct
77 Correct 158 ms 21964 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 724 KB Output is correct
81 Correct 71 ms 12032 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 42 ms 5696 KB Output is correct
86 Correct 68 ms 12040 KB Output is correct
87 Correct 61 ms 12112 KB Output is correct
88 Correct 61 ms 12032 KB Output is correct
89 Correct 59 ms 12032 KB Output is correct
90 Correct 0 ms 212 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 3 ms 724 KB Output is correct
93 Correct 69 ms 12108 KB Output is correct
94 Correct 0 ms 212 KB Output is correct
95 Correct 1 ms 256 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 15 ms 3668 KB Output is correct
98 Correct 61 ms 14028 KB Output is correct
99 Correct 62 ms 14072 KB Output is correct
100 Correct 61 ms 14080 KB Output is correct
101 Correct 70 ms 14196 KB Output is correct
102 Correct 68 ms 14028 KB Output is correct
103 Correct 65 ms 14084 KB Output is correct
104 Correct 69 ms 13996 KB Output is correct
105 Correct 70 ms 14072 KB Output is correct