oj.uz

Submission #300674

# Submission time Handle Problem Language Result Execution time Memory
300674 2020-09-17T11:44:38 Z abeker Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 283 ms 30200 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
 
class EquivRelation {
  int n;
  vector <bool> vis;
  vector <vector <int>> adj;
public:
  EquivRelation(int _n) {
    n = _n;
    adj.resize(n);
    vis.resize(n);
  }
  void addEdge(int u, int v) {
    adj[u].push_back(v);
  }
  void dfs(int x, vector <int> &comp) {
    vis[x] = true;
    comp.push_back(x);
    for (auto it : adj[x])
      if (!vis[it])
        dfs(it, comp);
  }
  bool isClique(const vector <int> &v) const {
    for (auto it : v)
      if (adj[it].size() != v.size())
        return false;
    return true;
  }
  vector <vector <int>> getClasses() {
    vector <vector <int>> res;
    for (int i = 0; i < n; i++) 
      if (!vis[i]) {
        vector <int> curr;
        dfs(i, curr);
        if (!isClique(curr))
          return vector <vector <int>> ();
        res.push_back(curr);
      }
    return res;
  }
};
 
int construct(vector <vector <int>> p) {
  int N = p.size();
  EquivRelation conn(N), one(N);
  for (int i = 0; i < N; i++)
    for (int j = 0; j < N; j++) {
      if (p[i][j])
        conn.addEdge(i, j);
      if (p[i][j] == 1)
        one.addEdge(i, j);  
      else if (p[i][j] == 3)
        return 0;
    }
  vector <vector <int>> comps = conn.getClasses();
  vector <vector <int>> groups = one.getClasses();
  if (comps.empty() || groups.empty())
    return 0;
  int sz = comps.size();
  vector <int> idx(N);
  for (int i = 0; i < sz; i++)
    for (auto it : comps[i])
      idx[it] = i;
  vector <vector <int>> b(N, vector <int> (N, 0));
  auto make_edge = [&](int u, int v) {
    b[u][v] = b[v][u] = 1;
  };
  vector <vector <int>> cycle(sz);
  for (auto it : groups) {
    for (int i = 1; i < it.size(); i++)
      make_edge(it[0], it[i]);
    cycle[idx[it[0]]].push_back(it[0]);
  }
  for (auto it : cycle)
    if (it.size() > 2)
      for (int i = 0; i < it.size(); i++)
        make_edge(it[i], it[(i + 1) % it.size()]);
    else if (it.size() == 2)
      return 0;
  build(b);
  return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.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 384 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 1664 KB Output is correct
7 Correct 261 ms 30200 KB Output is correct

Subtask #2
10.0 / 10.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 384 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 1664 KB Output is correct
7 Correct 261 ms 30200 KB Output is correct
8 Correct 1 ms 416 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 233 ms 22392 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 896 KB Output is correct
17 Correct 123 ms 13432 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 65 ms 6008 KB Output is correct
21 Correct 240 ms 23160 KB Output is correct
22 Correct 237 ms 22268 KB Output is correct
23 Correct 254 ms 26200 KB Output is correct
24 Correct 236 ms 22392 KB Output is correct
25 Correct 103 ms 9336 KB Output is correct
26 Correct 100 ms 8280 KB Output is correct
27 Correct 258 ms 28280 KB Output is correct
28 Correct 236 ms 22392 KB Output is correct

Subtask #3
19.0 / 19.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 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 10 ms 1280 KB Output is correct
9 Correct 232 ms 22392 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 259 ms 26360 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 120 ms 10968 KB Output is correct
18 Correct 1 ms 256 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 245 ms 22776 KB Output is correct
23 Correct 233 ms 22264 KB Output is correct
24 Correct 254 ms 25308 KB Output is correct
25 Correct 101 ms 12408 KB Output is correct
26 Correct 104 ms 8824 KB Output is correct
27 Correct 283 ms 22264 KB Output is correct
28 Correct 257 ms 24312 KB Output is correct
29 Correct 106 ms 12408 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 61 ms 6008 KB Output is correct
5 Correct 242 ms 23160 KB Output is correct
6 Correct 241 ms 22264 KB Output is correct
7 Correct 255 ms 26232 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 59 ms 6008 KB Output is correct
10 Correct 243 ms 22776 KB Output is correct
11 Correct 233 ms 22264 KB Output is correct
12 Correct 254 ms 25336 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 60 ms 5880 KB Output is correct
17 Correct 240 ms 22776 KB Output is correct
18 Correct 242 ms 22776 KB Output is correct
19 Correct 244 ms 22520 KB Output is correct
20 Correct 244 ms 22392 KB Output is correct

Subtask #5
21.0 / 21.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 384 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 1664 KB Output is correct
7 Correct 261 ms 30200 KB Output is correct
8 Correct 1 ms 416 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 233 ms 22392 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 896 KB Output is correct
17 Correct 123 ms 13432 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 65 ms 6008 KB Output is correct
21 Correct 240 ms 23160 KB Output is correct
22 Correct 237 ms 22268 KB Output is correct
23 Correct 254 ms 26200 KB Output is correct
24 Correct 236 ms 22392 KB Output is correct
25 Correct 103 ms 9336 KB Output is correct
26 Correct 100 ms 8280 KB Output is correct
27 Correct 258 ms 28280 KB Output is correct
28 Correct 236 ms 22392 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 384 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 10 ms 1280 KB Output is correct
37 Correct 232 ms 22392 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1408 KB Output is correct
41 Correct 259 ms 26360 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 120 ms 10968 KB Output is correct
46 Correct 1 ms 256 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 245 ms 22776 KB Output is correct
51 Correct 233 ms 22264 KB Output is correct
52 Correct 254 ms 25308 KB Output is correct
53 Correct 101 ms 12408 KB Output is correct
54 Correct 104 ms 8824 KB Output is correct
55 Correct 283 ms 22264 KB Output is correct
56 Correct 257 ms 24312 KB Output is correct
57 Correct 106 ms 12408 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 6 ms 896 KB Output is correct
61 Correct 127 ms 14328 KB Output is correct
62 Correct 0 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 59 ms 6008 KB Output is correct
66 Correct 103 ms 8952 KB Output is correct
67 Correct 103 ms 8828 KB Output is correct
68 Correct 102 ms 8664 KB Output is correct
69 Correct 110 ms 12376 KB Output is correct

Subtask #6
4.0 / 4.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 384 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 1664 KB Output is correct
7 Correct 261 ms 30200 KB Output is correct
8 Correct 1 ms 416 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 233 ms 22392 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 896 KB Output is correct
17 Correct 123 ms 13432 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 65 ms 6008 KB Output is correct
21 Correct 240 ms 23160 KB Output is correct
22 Correct 237 ms 22268 KB Output is correct
23 Correct 254 ms 26200 KB Output is correct
24 Correct 236 ms 22392 KB Output is correct
25 Correct 103 ms 9336 KB Output is correct
26 Correct 100 ms 8280 KB Output is correct
27 Correct 258 ms 28280 KB Output is correct
28 Correct 236 ms 22392 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 384 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 10 ms 1280 KB Output is correct
37 Correct 232 ms 22392 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 11 ms 1408 KB Output is correct
41 Correct 259 ms 26360 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 120 ms 10968 KB Output is correct
46 Correct 1 ms 256 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 245 ms 22776 KB Output is correct
51 Correct 233 ms 22264 KB Output is correct
52 Correct 254 ms 25308 KB Output is correct
53 Correct 101 ms 12408 KB Output is correct
54 Correct 104 ms 8824 KB Output is correct
55 Correct 283 ms 22264 KB Output is correct
56 Correct 257 ms 24312 KB Output is correct
57 Correct 106 ms 12408 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 61 ms 6008 KB Output is correct
62 Correct 242 ms 23160 KB Output is correct
63 Correct 241 ms 22264 KB Output is correct
64 Correct 255 ms 26232 KB Output is correct
65 Correct 1 ms 256 KB Output is correct
66 Correct 59 ms 6008 KB Output is correct
67 Correct 243 ms 22776 KB Output is correct
68 Correct 233 ms 22264 KB Output is correct
69 Correct 254 ms 25336 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 60 ms 5880 KB Output is correct
74 Correct 240 ms 22776 KB Output is correct
75 Correct 242 ms 22776 KB Output is correct
76 Correct 244 ms 22520 KB Output is correct
77 Correct 244 ms 22392 KB Output is correct
78 Correct 1 ms 256 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 6 ms 896 KB Output is correct
81 Correct 127 ms 14328 KB Output is correct
82 Correct 0 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 59 ms 6008 KB Output is correct
86 Correct 103 ms 8952 KB Output is correct
87 Correct 103 ms 8828 KB Output is correct
88 Correct 102 ms 8664 KB Output is correct
89 Correct 110 ms 12376 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct
92 Correct 5 ms 640 KB Output is correct
93 Correct 112 ms 8184 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 25 ms 2296 KB Output is correct
98 Correct 100 ms 8312 KB Output is correct
99 Correct 99 ms 8312 KB Output is correct
100 Correct 97 ms 8312 KB Output is correct
101 Correct 98 ms 8440 KB Output is correct
102 Correct 108 ms 8312 KB Output is correct
103 Correct 110 ms 8312 KB Output is correct
104 Correct 106 ms 8184 KB Output is correct
105 Correct 124 ms 8276 KB Output is correct