oj.uz

Submission #789418

# Submission time Handle Problem Language Result Execution time Memory
789418 2023-07-21T11:17:22 Z RecursiveCo Connecting Supertrees (IOI20_supertrees) C++14
56 / 100
 185 ms 24036 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) {
    a = find(a);
    b = find(b);
    parent[a] = b;
    if (has) 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] == 2);
        }
    }
    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;
            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); // same tree
                }
            }
            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);
                }
            }
            bool can = true;
            for (vector<int> tree: trees) {
                for (int a: tree) {
                    for (int b: tree) {
                        if (p[a][b] == 2) {
                            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;
            }
        }
    }
    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:39:5: note: in expansion of macro 'forto'
   39 |     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:40:5: note: in expansion of macro 'forto'
   40 |     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:41:9: note: in expansion of macro 'forto'
   41 |         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:45:5: note: in expansion of macro 'forto'
   45 |     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:46:9: note: in expansion of macro 'forto'
   46 |         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:51:5: note: in expansion of macro 'forto'
   51 |     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:54:13: note: in expansion of macro 'forto'
   54 |             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:64:13: note: in expansion of macro 'forto'
   64 |             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:71:13: note: in expansion of macro 'forto'
   71 |             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:72:13: note: in expansion of macro 'forto'
   72 |             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:73:17: note: in expansion of macro 'forto'
   73 |                 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:105:17: note: in expansion of macro 'forto'
  105 |                 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:112:13: note: in expansion of macro 'forto'
  112 |             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:112:13: note: in expansion of macro 'forto'
  112 |             forto(trees.size(), i) {
      |             ^~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 162 ms 23924 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 162 ms 23924 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 1180 KB Output is correct
13 Correct 164 ms 24036 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 70 ms 10092 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 6216 KB Output is correct
21 Correct 156 ms 24012 KB Output is correct
22 Correct 159 ms 23928 KB Output is correct
23 Correct 159 ms 24012 KB Output is correct
24 Correct 158 ms 24016 KB Output is correct
25 Correct 66 ms 10104 KB Output is correct
26 Correct 63 ms 10112 KB Output is correct
27 Correct 160 ms 23952 KB Output is correct
28 Correct 167 ms 23964 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 39 ms 6156 KB Output is correct
5 Correct 158 ms 23980 KB Output is correct
6 Correct 159 ms 23928 KB Output is correct
7 Correct 160 ms 23928 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 39 ms 6260 KB Output is correct
10 Correct 157 ms 24012 KB Output is correct
11 Correct 157 ms 23920 KB Output is correct
12 Correct 185 ms 23920 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 39 ms 6236 KB Output is correct
17 Correct 158 ms 23924 KB Output is correct
18 Correct 158 ms 23996 KB Output is correct
19 Correct 159 ms 23932 KB Output is correct
20 Correct 162 ms 24032 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 162 ms 23924 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 1180 KB Output is correct
13 Correct 164 ms 24036 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 70 ms 10092 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 6216 KB Output is correct
21 Correct 156 ms 24012 KB Output is correct
22 Correct 159 ms 23928 KB Output is correct
23 Correct 159 ms 24012 KB Output is correct
24 Correct 158 ms 24016 KB Output is correct
25 Correct 66 ms 10104 KB Output is correct
26 Correct 63 ms 10112 KB Output is correct
27 Correct 160 ms 23952 KB Output is correct
28 Correct 167 ms 23964 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 7 ms 1236 KB Output is correct
7 Correct 162 ms 23924 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 1180 KB Output is correct
13 Correct 164 ms 24036 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 70 ms 10092 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 6216 KB Output is correct
21 Correct 156 ms 24012 KB Output is correct
22 Correct 159 ms 23928 KB Output is correct
23 Correct 159 ms 24012 KB Output is correct
24 Correct 158 ms 24016 KB Output is correct
25 Correct 66 ms 10104 KB Output is correct
26 Correct 63 ms 10112 KB Output is correct
27 Correct 160 ms 23952 KB Output is correct
28 Correct 167 ms 23964 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -