oj.uz

Submission #435737

# Submission time Handle Problem Language Result Execution time Memory
435737 2021-06-23T16:21:16 Z bicsi Keys (IOI21_keys) C++17
100 / 100
 1814 ms 114664 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
struct Solver {
  int n;
  vector<vector<int>> active;
  vector<multimap<int, int>> inactive;
  vector<set<int>> cols;
  vector<int> parent, df, link, bad;
 
  Solver(int n) : 
      n(n), active(n), inactive(n), cols(n),
      parent(n, -1), df(n, -1), link(n, -1), bad(n, 0) {}
 
  void AddEdge(int u, int v, int c) {
    if (cols[u].count(c))
      active[u].push_back(v);
    else 
      inactive[u].emplace(c, v);
  }
  void AddCol(int u, int c) {
    while (true) {
      auto it = inactive[u].find(c);
      if (it == inactive[u].end()) break;
      active[u].push_back(it->second);
      inactive[u].erase(it);
    }
    cols[u].insert(c);
  }
 
  void merge(int node, int anc) {
    while (true) {
      node = find(node);
      anc = find(anc);
      if (node == anc) return;
      int par = find(parent[node]);
      assert(par != node);
      link[node] = par;
      if (active[node].size() + cols[node].size() + inactive[node].size() > 
          active[par].size() + cols[par].size() + inactive[par].size()) {
        swap(active[node], active[par]);
        swap(cols[node], cols[par]);
        swap(inactive[node], inactive[par]);
        swap(bad[node], bad[par]);
      }
      for (auto x : cols[node])
        AddCol(par, x);
      for (auto x : active[node])
        active[par].push_back(x);
      for (auto [c, x] : inactive[node])
        AddEdge(par, x, c);
      bad[par] |= bad[node];
 
      inactive[node].clear();
      active[node].clear();
      cols[node].clear();
      bad[node] = 0;
    }
  }
 
  int find(int x) {
    if (link[x] == -1) return x;
    return link[x] = find(link[x]);
  }
 
  void dfs(int node, int par) {
    df[node] = 0;
    parent[node] = par;
    while (true) {
      node = find(node);
      if (active[node].empty()) break;
      int vec = active[node].back();
      active[node].pop_back();
      vec = find(vec);
      if (vec == node) continue;
      if (df[vec] == -1) {
        dfs(vec, node);
        if (find(vec) != find(node))
          bad[find(node)] = 1;
      } else if (df[vec] == 0) {
        merge(node, vec);
      } else {
        bad[find(node)] = 1;
      }
    }
    df[node] = 1;
  }
 
  vector<int> Solve() {
    for (int i = 0; i < n; ++i) 
      if (find(i) == i && df[i] == -1)
        dfs(i, -1);
    
    vector<int> ret(n, 0), sz(n, 0);
    int min_sz = 1e9;
    for (int i = 0; i < n; ++i) {
      if (bad[find(i)])
        continue;
      sz[find(i)] += 1;
    }
    for (int i = 0; i < n; ++i) {
      if (bad[find(i)])
        continue;
      min_sz = min(min_sz, sz[find(i)]);
    }
    for (int i = 0; i < n; ++i) {
      if (bad[find(i)])
        continue;
      ret[i] = (sz[find(i)] == min_sz);
    }
    return ret;
  }
 
};
 
vector<int> find_reachable(
    vector<int> r, vector<int> u, 
    vector<int> v, vector<int> c) {
	int n = r.size(), m = u.size();
  Solver S(n);
  for (int i = 0; i < n; ++i)
    S.AddCol(i, r[i]);
  for (int i = 0; i < m; ++i) {
    S.AddEdge(u[i], v[i], c[i]);
    S.AddEdge(v[i], u[i], c[i]);
  }
  return S.Solve();
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 3 ms 844 KB Output is correct
28 Correct 2 ms 844 KB Output is correct
29 Correct 2 ms 844 KB Output is correct
30 Correct 2 ms 588 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 2 ms 600 KB Output is correct
35 Correct 2 ms 588 KB Output is correct
36 Correct 3 ms 972 KB Output is correct
37 Correct 3 ms 972 KB Output is correct
38 Correct 3 ms 1100 KB Output is correct
39 Correct 3 ms 1100 KB Output is correct
40 Correct 2 ms 588 KB Output is correct
41 Correct 3 ms 716 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 909 ms 62132 KB Output is correct
11 Correct 880 ms 114664 KB Output is correct
12 Correct 106 ms 16196 KB Output is correct
13 Correct 742 ms 81408 KB Output is correct
14 Correct 282 ms 114544 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 3 ms 844 KB Output is correct
28 Correct 2 ms 844 KB Output is correct
29 Correct 2 ms 844 KB Output is correct
30 Correct 2 ms 588 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 2 ms 600 KB Output is correct
35 Correct 2 ms 588 KB Output is correct
36 Correct 3 ms 972 KB Output is correct
37 Correct 3 ms 972 KB Output is correct
38 Correct 3 ms 1100 KB Output is correct
39 Correct 3 ms 1100 KB Output is correct
40 Correct 2 ms 588 KB Output is correct
41 Correct 3 ms 716 KB Output is correct
42 Correct 909 ms 62132 KB Output is correct
43 Correct 880 ms 114664 KB Output is correct
44 Correct 106 ms 16196 KB Output is correct
45 Correct 742 ms 81408 KB Output is correct
46 Correct 282 ms 114544 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 255 ms 111216 KB Output is correct
51 Correct 297 ms 110948 KB Output is correct
52 Correct 486 ms 61292 KB Output is correct
53 Correct 471 ms 61456 KB Output is correct
54 Correct 474 ms 61508 KB Output is correct
55 Correct 1108 ms 61932 KB Output is correct
56 Correct 630 ms 90780 KB Output is correct
57 Correct 445 ms 81264 KB Output is correct
58 Correct 835 ms 89392 KB Output is correct
59 Correct 1814 ms 85016 KB Output is correct
60 Correct 1292 ms 100020 KB Output is correct
61 Correct 1351 ms 100156 KB Output is correct
62 Correct 1516 ms 76132 KB Output is correct
63 Correct 277 ms 65756 KB Output is correct
64 Correct 5 ms 2124 KB Output is correct
65 Correct 7 ms 2124 KB Output is correct
66 Correct 1524 ms 76256 KB Output is correct
67 Correct 28 ms 11592 KB Output is correct
68 Correct 48 ms 19252 KB Output is correct
69 Correct 1751 ms 86328 KB Output is correct
70 Correct 99 ms 38332 KB Output is correct
71 Correct 285 ms 114664 KB Output is correct
72 Correct 1711 ms 86200 KB Output is correct
73 Correct 1481 ms 76156 KB Output is correct