oj.uz

답안 #789423

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
789423 2023-07-21T11:31:04 Z RecursiveCo 슈퍼트리 잇기 (IOI20_supertrees) C++14
96 / 100
 177 ms 24052 KB 
// CF template, version 3.0

#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

//#define int long long

vector<int> parent;
vector<int> cycle;

int find(int v) {
    if (parent[v] == v) return v;
    return parent[v] = find(parent[v]);
}

void unite(int a, int b, bool has, bool matters) {
    a = find(a);
    b = find(b);
    parent[a] = b;
    if (!matters) return;
    if (has || cycle[a] || cycle[b]) cycle[b] = 1;
}

int construct(vector<vector<int>> p) {
    // 96 points
    int n = p.size();
    forto(n, i) parent.push_back(i), cycle.push_back(0);
    forto(n, i) {
        forto(n, j) {
            if (p[i][j]) unite(i, j, p[i][j] > 1, true);
        }
    }
    forto(n, i) {
        forto(n, j) {
            if (!p[i][j] && find(i) == find(j)) return 0;
        }
    }
    vector<pair<int, vector<int>>> comps;
    forto(n, i) {
        if (i == find(i)) {
            vector<int> cur;
            forto(n, j) {
                if (find(j) == i) cur.push_back(j);
            }
            comps.push_back({cycle[i], cur});
        }
    }
    vector<vector<int>> B(n, vector<int>(n, 0));
    for (auto comp: comps) {
        int len = comp.second.size();
        if (!comp.first) {
            forto(len - 1, i) {
                int a = comp.second[i];
                int b = comp.second[i + 1];
                B[a][b] = 1;
                B[b][a] = 1;
            }
        } else {
            forto(n, i) parent[i] = i;
            bool three = false;
            forto(len, i) {
                forto(len, j) {
                    int a = comp.second[i];
                    int b = comp.second[j];
                    if (p[a][b] == 1) unite(a, b, false, false); // same tree
                    if (p[a][b] == 3) three = true;
                }
            }
            for (int a: comp.second) {
                for (int b: comp.second) {
                    if (three && p[a][b] == 2) return 0;
                }
            }
            vector<vector<int>> trees;
            for (int num: comp.second) {
                if (find(num) == num) {
                    vector<int> cur;
                    for (int el: comp.second) {
                        if (find(el) == num) cur.push_back(el);
                    }
                    trees.push_back(cur);
                }
            }
            if (trees.size() == 2) return 0;
            if (trees.size() == 3 && three) return 0;
            bool can = true;
            for (vector<int> tree: trees) {
                for (int a: tree) {
                    for (int b: tree) {
                        if (p[a][b] > 1) {
                            can = false;
                            break;
                        }
                    }
                    if (!can) break;
                }
                if (!can) break;
            }
            if (!can) return 0;
            for (vector<int> tree: trees) {
                int treelen = tree.size();
                forto(treelen - 1, i) {
                    int a = tree[i];
                    int b = tree[i + 1];
                    B[a][b] = 1;
                    B[b][a] = 1;
                }
            }
            forto(trees.size(), i) {
                int a = trees[i][0];
                int b = trees[(i + 1) % trees.size()][0];
                B[a][b] = 1;
                B[b][a] = 1;
            }
            if (three) {
                int a = trees[0][0];
                int b = trees[2][0];
                B[a][b] = 1;
                B[b][a] = 1;
            }
        }
    }
    build(B);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:16:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
supertrees.cpp:40:5: note: in expansion of macro 'forto'
   40 |     forto(n, i) parent.push_back(i), cycle.push_back(0);
      |     ^~~~~
supertrees.cpp:16:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
supertrees.cpp:41:5: note: in expansion of macro 'forto'
   41 |     forto(n, i) {
      |     ^~~~~
supertrees.cpp:16:35: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
supertrees.cpp:42:9: note: in expansion of macro 'forto'
   42 |         forto(n, j) {
      |         ^~~~~
supertrees.cpp:16:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
supertrees.cpp:46:5: note: in expansion of macro 'forto'
   46 |     forto(n, i) {
      |     ^~~~~
supertrees.cpp:16:35: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
supertrees.cpp:47:9: note: in expansion of macro 'forto'
   47 |         forto(n, j) {
      |         ^~~~~
supertrees.cpp:16:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
supertrees.cpp:52:5: note: in expansion of macro 'forto'
   52 |     forto(n, i) {
      |     ^~~~~
supertrees.cpp:16:35: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
supertrees.cpp:55:13: note: in expansion of macro 'forto'
   55 |             forto(n, j) {
      |             ^~~~~
supertrees.cpp:16:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
supertrees.cpp:65:13: note: in expansion of macro 'forto'
   65 |             forto(len - 1, i) {
      |             ^~~~~
supertrees.cpp:16:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
supertrees.cpp:72:13: note: in expansion of macro 'forto'
   72 |             forto(n, i) parent[i] = i;
      |             ^~~~~
supertrees.cpp:16:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
supertrees.cpp:74:13: note: in expansion of macro 'forto'
   74 |             forto(len, i) {
      |             ^~~~~
supertrees.cpp:16:35: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
supertrees.cpp:75:17: note: in expansion of macro 'forto'
   75 |                 forto(len, j) {
      |                 ^~~~~
supertrees.cpp:16:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
supertrees.cpp:115:17: note: in expansion of macro 'forto'
  115 |                 forto(treelen - 1, i) {
      |                 ^~~~~
supertrees.cpp:16:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
supertrees.cpp:122:13: note: in expansion of macro 'forto'
  122 |             forto(trees.size(), i) {
      |             ^~~~~
supertrees.cpp:16:52: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                              ~~~~~~^~~~~~~~
supertrees.cpp:122:13: note: in expansion of macro 'forto'
  122 |             forto(trees.size(), i) {
      |             ^~~~~

Subtask #1
11.0 / 11.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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 159 ms 21964 KB Output is correct

Subtask #2
10.0 / 10.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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 159 ms 21964 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 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 1188 KB Output is correct
13 Correct 158 ms 22124 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 596 KB Output is correct
17 Correct 77 ms 8196 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 40 ms 5668 KB Output is correct
21 Correct 177 ms 22060 KB Output is correct
22 Correct 172 ms 22060 KB Output is correct
23 Correct 160 ms 22032 KB Output is correct
24 Correct 163 ms 22088 KB Output is correct
25 Correct 63 ms 8080 KB Output is correct
26 Correct 61 ms 8080 KB Output is correct
27 Correct 160 ms 22020 KB Output is correct
28 Correct 161 ms 22016 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 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 7 ms 1108 KB Output is correct
9 Correct 156 ms 22024 KB Output is correct
10 Correct 1 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 166 ms 22040 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 596 KB Output is correct
17 Correct 75 ms 8076 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 40 ms 5760 KB Output is correct
22 Correct 157 ms 22032 KB Output is correct
23 Correct 159 ms 21992 KB Output is correct
24 Correct 163 ms 21984 KB Output is correct
25 Correct 67 ms 12164 KB Output is correct
26 Correct 65 ms 8192 KB Output is correct
27 Correct 157 ms 22024 KB Output is correct
28 Correct 165 ms 22016 KB Output is correct
29 Correct 65 ms 12172 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 39 ms 5760 KB Output is correct
5 Correct 157 ms 22036 KB Output is correct
6 Correct 162 ms 22088 KB Output is correct
7 Correct 161 ms 22032 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 39 ms 5768 KB Output is correct
10 Correct 153 ms 22024 KB Output is correct
11 Correct 159 ms 22024 KB Output is correct
12 Correct 164 ms 21992 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 43 ms 5700 KB Output is correct
17 Correct 158 ms 22028 KB Output is correct
18 Correct 159 ms 22016 KB Output is correct
19 Correct 157 ms 22024 KB Output is correct
20 Correct 156 ms 22148 KB Output is correct

Subtask #5
21.0 / 21.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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 159 ms 21964 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 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 1188 KB Output is correct
13 Correct 158 ms 22124 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 596 KB Output is correct
17 Correct 77 ms 8196 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 40 ms 5668 KB Output is correct
21 Correct 177 ms 22060 KB Output is correct
22 Correct 172 ms 22060 KB Output is correct
23 Correct 160 ms 22032 KB Output is correct
24 Correct 163 ms 22088 KB Output is correct
25 Correct 63 ms 8080 KB Output is correct
26 Correct 61 ms 8080 KB Output is correct
27 Correct 160 ms 22020 KB Output is correct
28 Correct 161 ms 22016 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 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 7 ms 1108 KB Output is correct
37 Correct 156 ms 22024 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1108 KB Output is correct
41 Correct 166 ms 22040 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 596 KB Output is correct
45 Correct 75 ms 8076 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 40 ms 5760 KB Output is correct
50 Correct 157 ms 22032 KB Output is correct
51 Correct 159 ms 21992 KB Output is correct
52 Correct 163 ms 21984 KB Output is correct
53 Correct 67 ms 12164 KB Output is correct
54 Correct 65 ms 8192 KB Output is correct
55 Correct 157 ms 22024 KB Output is correct
56 Correct 165 ms 22016 KB Output is correct
57 Correct 65 ms 12172 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 3 ms 596 KB Output is correct
61 Correct 73 ms 8140 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 40 ms 5768 KB Output is correct
66 Correct 65 ms 8084 KB Output is correct
67 Correct 65 ms 8080 KB Output is correct
68 Correct 62 ms 8140 KB Output is correct
69 Correct 71 ms 12164 KB Output is correct

Subtask #6
0 / 4.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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 159 ms 21964 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 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 1188 KB Output is correct
13 Correct 158 ms 22124 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 596 KB Output is correct
17 Correct 77 ms 8196 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 40 ms 5668 KB Output is correct
21 Correct 177 ms 22060 KB Output is correct
22 Correct 172 ms 22060 KB Output is correct
23 Correct 160 ms 22032 KB Output is correct
24 Correct 163 ms 22088 KB Output is correct
25 Correct 63 ms 8080 KB Output is correct
26 Correct 61 ms 8080 KB Output is correct
27 Correct 160 ms 22020 KB Output is correct
28 Correct 161 ms 22016 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 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 7 ms 1108 KB Output is correct
37 Correct 156 ms 22024 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1108 KB Output is correct
41 Correct 166 ms 22040 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 596 KB Output is correct
45 Correct 75 ms 8076 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 40 ms 5760 KB Output is correct
50 Correct 157 ms 22032 KB Output is correct
51 Correct 159 ms 21992 KB Output is correct
52 Correct 163 ms 21984 KB Output is correct
53 Correct 67 ms 12164 KB Output is correct
54 Correct 65 ms 8192 KB Output is correct
55 Correct 157 ms 22024 KB Output is correct
56 Correct 165 ms 22016 KB Output is correct
57 Correct 65 ms 12172 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 39 ms 5760 KB Output is correct
62 Correct 157 ms 22036 KB Output is correct
63 Correct 162 ms 22088 KB Output is correct
64 Correct 161 ms 22032 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 39 ms 5768 KB Output is correct
67 Correct 153 ms 22024 KB Output is correct
68 Correct 159 ms 22024 KB Output is correct
69 Correct 164 ms 21992 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 43 ms 5700 KB Output is correct
74 Correct 158 ms 22028 KB Output is correct
75 Correct 159 ms 22016 KB Output is correct
76 Correct 157 ms 22024 KB Output is correct
77 Correct 156 ms 22148 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 3 ms 596 KB Output is correct
81 Correct 73 ms 8140 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 40 ms 5768 KB Output is correct
86 Correct 65 ms 8084 KB Output is correct
87 Correct 65 ms 8080 KB Output is correct
88 Correct 62 ms 8140 KB Output is correct
89 Correct 71 ms 12164 KB Output is correct
90 Correct 0 ms 212 KB Output is correct
91 Correct 0 ms 212 KB Output is correct
92 Correct 3 ms 596 KB Output is correct
93 Correct 70 ms 8080 KB Output is correct
94 Correct 0 ms 212 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 20 ms 2772 KB Output is correct
98 Correct 63 ms 10112 KB Output is correct
99 Correct 63 ms 10104 KB Output is correct
100 Correct 63 ms 10068 KB Output is correct
101 Correct 68 ms 14080 KB Output is correct
102 Incorrect 177 ms 24052 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -