oj.uz

Submission #301723

# Submission time Handle Problem Language Result Execution time Memory
301723 2020-09-18T06:52:19 Z rama_pang Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 272 ms 22368 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

class DisjointSet {
 public:
  vector<int> p;
  DisjointSet() {}
  DisjointSet(int sz) : p(sz) {
    iota(begin(p), end(p), 0);
  }
  int Find(int x) {
    return p[x] == x ? x : p[x] = Find(p[x]);
  }
  int Unite(int x, int y) {
    x = Find(x), y = Find(y);
    if (x == y) {
      return 0;
    }
    p[x] = y;
    return 1;
  }
  bool SameSet(int x, int y) {
    return Find(x) == Find(y);
  }
  bool IsRoot(int x) {
    return Find(x) == x;
  }
};

int construct(vector<vector<int>> p) {
  int n = (int) p.size();
  vector<vector<int>> ans(n, vector<int>(n, 0));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (p[i][j] == 3) {
        return 0;
      }
    }
  }
  DisjointSet D(n), T(n);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (p[i][j] > 0) {
        D.Unite(i, j);
      }
    }
  }
  vector<vector<int>> comps(n);
  vector<vector<int>> trees(n);
  for (int i = 0; i < n; i++) {
    comps[D.Find(i)].emplace_back(i);
  }
  for (const auto &c : comps) {
    if (c.empty()) {
      continue;
    }
    for (auto i : c) {
      for (auto j : c) {
        if (p[i][j] == 0) {
          return 0;
        }
      }
    }
    for (auto i : c) {
      for (auto j : c) {
        if (p[i][j] == 1) {
          T.Unite(i, j);
        }
      }
    }
    for (auto i : c) {
      trees[T.Find(i)].emplace_back(i);
    }
    vector<int> roots;
    for (auto r : c) {
      if (T.IsRoot(r)) {
        roots.emplace_back(r);
        for (auto i : trees[r]) {
          for (auto j : trees[r]) {
            if (p[i][j] == 2) {
              return 0;
            }
          }
        }
        for (int i = 0; i + 1 < (int) trees[r].size(); i++) {
          ans[trees[r][i]][trees[r][i + 1]] = 1;
          ans[trees[r][i + 1]][trees[r][i]] = 1;
        }
      }
    }
    if (roots.size() == 1) {
      continue;
    }
    if (roots.size() == 2) {
      return 0;
    }
    roots.emplace_back(roots.front());
    for (int i = 0; i + 1 < (int) roots.size(); i++) {
      ans[roots[i]][roots[i + 1]] = 1;
      ans[roots[i + 1]][roots[i]] = 1;
    }
  }
  build(ans);
  return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 266 ms 22140 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 266 ms 22140 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1408 KB Output is correct
13 Correct 248 ms 22136 KB Output is correct
14 Correct 1 ms 288 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 129 ms 12156 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 77 ms 5884 KB Output is correct
21 Correct 257 ms 22164 KB Output is correct
22 Correct 243 ms 22136 KB Output is correct
23 Correct 263 ms 22264 KB Output is correct
24 Correct 246 ms 22264 KB Output is correct
25 Correct 118 ms 12152 KB Output is correct
26 Correct 107 ms 12280 KB Output is correct
27 Correct 263 ms 22264 KB Output is correct
28 Correct 253 ms 22264 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 11 ms 1280 KB Output is correct
9 Correct 244 ms 22264 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 14 ms 1280 KB Output is correct
13 Correct 271 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 131 ms 12280 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 63 ms 5880 KB Output is correct
22 Correct 272 ms 22136 KB Output is correct
23 Correct 251 ms 22136 KB Output is correct
24 Correct 263 ms 22136 KB Output is correct
25 Correct 111 ms 12280 KB Output is correct
26 Correct 115 ms 12280 KB Output is correct
27 Correct 247 ms 22136 KB Output is correct
28 Correct 260 ms 22136 KB Output is correct
29 Correct 110 ms 12376 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 62 ms 5880 KB Output is correct
5 Correct 251 ms 22232 KB Output is correct
6 Correct 242 ms 22136 KB Output is correct
7 Correct 263 ms 22228 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 66 ms 5880 KB Output is correct
10 Correct 249 ms 22136 KB Output is correct
11 Correct 245 ms 22264 KB Output is correct
12 Correct 258 ms 22264 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 63 ms 5880 KB Output is correct
17 Correct 259 ms 22264 KB Output is correct
18 Correct 251 ms 22232 KB Output is correct
19 Correct 251 ms 22264 KB Output is correct
20 Correct 247 ms 22368 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 266 ms 22140 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1408 KB Output is correct
13 Correct 248 ms 22136 KB Output is correct
14 Correct 1 ms 288 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 129 ms 12156 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 77 ms 5884 KB Output is correct
21 Correct 257 ms 22164 KB Output is correct
22 Correct 243 ms 22136 KB Output is correct
23 Correct 263 ms 22264 KB Output is correct
24 Correct 246 ms 22264 KB Output is correct
25 Correct 118 ms 12152 KB Output is correct
26 Correct 107 ms 12280 KB Output is correct
27 Correct 263 ms 22264 KB Output is correct
28 Correct 253 ms 22264 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 11 ms 1280 KB Output is correct
37 Correct 244 ms 22264 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 14 ms 1280 KB Output is correct
41 Correct 271 ms 22136 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 6 ms 768 KB Output is correct
45 Correct 131 ms 12280 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 63 ms 5880 KB Output is correct
50 Correct 272 ms 22136 KB Output is correct
51 Correct 251 ms 22136 KB Output is correct
52 Correct 263 ms 22136 KB Output is correct
53 Correct 111 ms 12280 KB Output is correct
54 Correct 115 ms 12280 KB Output is correct
55 Correct 247 ms 22136 KB Output is correct
56 Correct 260 ms 22136 KB Output is correct
57 Correct 110 ms 12376 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 6 ms 768 KB Output is correct
61 Correct 123 ms 12280 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 1 ms 256 KB Output is correct
64 Correct 1 ms 256 KB Output is correct
65 Correct 62 ms 5880 KB Output is correct
66 Correct 113 ms 12280 KB Output is correct
67 Correct 113 ms 12152 KB Output is correct
68 Correct 108 ms 12280 KB Output is correct
69 Correct 113 ms 12280 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 266 ms 22140 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1408 KB Output is correct
13 Correct 248 ms 22136 KB Output is correct
14 Correct 1 ms 288 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 129 ms 12156 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 77 ms 5884 KB Output is correct
21 Correct 257 ms 22164 KB Output is correct
22 Correct 243 ms 22136 KB Output is correct
23 Correct 263 ms 22264 KB Output is correct
24 Correct 246 ms 22264 KB Output is correct
25 Correct 118 ms 12152 KB Output is correct
26 Correct 107 ms 12280 KB Output is correct
27 Correct 263 ms 22264 KB Output is correct
28 Correct 253 ms 22264 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 11 ms 1280 KB Output is correct
37 Correct 244 ms 22264 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 14 ms 1280 KB Output is correct
41 Correct 271 ms 22136 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 6 ms 768 KB Output is correct
45 Correct 131 ms 12280 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 63 ms 5880 KB Output is correct
50 Correct 272 ms 22136 KB Output is correct
51 Correct 251 ms 22136 KB Output is correct
52 Correct 263 ms 22136 KB Output is correct
53 Correct 111 ms 12280 KB Output is correct
54 Correct 115 ms 12280 KB Output is correct
55 Correct 247 ms 22136 KB Output is correct
56 Correct 260 ms 22136 KB Output is correct
57 Correct 110 ms 12376 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 1 ms 256 KB Output is correct
61 Correct 62 ms 5880 KB Output is correct
62 Correct 251 ms 22232 KB Output is correct
63 Correct 242 ms 22136 KB Output is correct
64 Correct 263 ms 22228 KB Output is correct
65 Correct 1 ms 256 KB Output is correct
66 Correct 66 ms 5880 KB Output is correct
67 Correct 249 ms 22136 KB Output is correct
68 Correct 245 ms 22264 KB Output is correct
69 Correct 258 ms 22264 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 1 ms 256 KB Output is correct
72 Correct 1 ms 256 KB Output is correct
73 Correct 63 ms 5880 KB Output is correct
74 Correct 259 ms 22264 KB Output is correct
75 Correct 251 ms 22232 KB Output is correct
76 Correct 251 ms 22264 KB Output is correct
77 Correct 247 ms 22368 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 6 ms 768 KB Output is correct
81 Correct 123 ms 12280 KB Output is correct
82 Correct 1 ms 256 KB Output is correct
83 Correct 1 ms 256 KB Output is correct
84 Correct 1 ms 256 KB Output is correct
85 Correct 62 ms 5880 KB Output is correct
86 Correct 113 ms 12280 KB Output is correct
87 Correct 113 ms 12152 KB Output is correct
88 Correct 108 ms 12280 KB Output is correct
89 Correct 113 ms 12280 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct
92 Correct 7 ms 768 KB Output is correct
93 Correct 114 ms 12152 KB Output is correct
94 Correct 1 ms 256 KB Output is correct
95 Correct 0 ms 256 KB Output is correct
96 Correct 1 ms 256 KB Output is correct
97 Correct 27 ms 3320 KB Output is correct
98 Correct 106 ms 12152 KB Output is correct
99 Correct 106 ms 12152 KB Output is correct
100 Correct 104 ms 12152 KB Output is correct
101 Correct 105 ms 12152 KB Output is correct
102 Correct 114 ms 12152 KB Output is correct
103 Correct 113 ms 12152 KB Output is correct
104 Correct 114 ms 12152 KB Output is correct
105 Correct 119 ms 12152 KB Output is correct