oj.uz

Submission #831510

# Submission time Handle Problem Language Result Execution time Memory
831510 2023-08-20T10:01:59 Z erray Keys (IOI21_keys) C++17
100 / 100
 1314 ms 55164 KB 
#include <vector>
#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG 
  #include "/home/eagle/ioi22/d2/debug.h"
#else 
  #define debug(...) void(37)
#endif

struct DSU {
  vector<int> link;
  DSU(int n) {
    link.resize(n);
    iota(link.begin(), link.end(), 0);
  }
  int get(int v) {
    return link[v] = (link[v] != v ? get(link[v]) : v);
  }
  bool unite(int x, int y) {
    x = get(x), y = get(y);
    if (x == y) {
      return false;
    }
    link[y] = x;
    return true;
  }
};

std::vector<int> find_reachable(std::vector<int> R, std::vector<int> U, std::vector<int> V, std::vector<int> C) {
	int N = int(R.size());
  int M = int(U.size());
  vector<vector<int>> g(N);
  for (int i = 0; i < M; ++i) {
    g[V[i]].push_back(i);
    g[U[i]].push_back(i);
  }
  DSU d(N);
  vector<bool> act(N);
  vector<bool> vis(N);
  vector<vector<int>> blocked(N);
  auto Expand = [&](int x) -> pair<vector<int>, int> {
    int link = -1;
    vector<int> verts;
    auto Add_v = [&](int to) {
      if (d.get(to) != d.get(x)) {
        link = d.get(to);
      } else if (!vis[to]) {
        verts.push_back(to);
        vis[to] = true;
        act[R[to]] = true;
      }
    };
    auto Add_e = [&](int id) {
      Add_v(V[id]);
      Add_v(U[id]);
    };
    Add_v(x);
    for (int it = 0; it < int(verts.size()); ++it) {
      int v = verts[it];
      Add_v(v);
      for (auto e : blocked[R[v]]) {
        Add_e(e);
      }
      blocked[R[v]].clear();
      for (auto id : g[v]) {
        if (act[C[id]]) {
          Add_e(id);
        } else {
          blocked[C[id]].push_back(id);
        }
      } 
    }
    for (auto v : verts) {
      act[R[v]] = false;
      vis[v] = false;
      for (auto id : g[v]) {
        blocked[C[id]].clear(); 
      }
    }
    return {verts, link};
  };
  while (true) {
    vector<array<int, 2>> upd;
    for (int i = 0; i < N; ++i) {
      if (d.get(i) == i) {
        auto[v, x] = Expand(i);
        if (x != -1) {
          upd.push_back({x, i});
        }
      }
    }
    for (auto[x, v] : upd) {
      d.unite(x, v);
    }
    if (upd.empty()) {
      break;
    }
  }
  vector<int> ans;
  int mn = N + 1;
  for (int i = 0; i < N; ++i) {
    if (d.get(i) == i) {
      auto v = Expand(i).first;
      int s = int(v.size());
      if (s < mn) {
        ans.clear();
        mn = s;
      }
      if (s == mn) {
        ans.insert(ans.end(), v.begin(), v.end());
      }
    }  
  }
  vector<int> ret(N);
  for (auto v : ans) {
    ret[v] = true;
  }
  return ret;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 1 ms 212 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 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 1 ms 212 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 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 2 ms 548 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 3 ms 596 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 248 ms 20232 KB Output is correct
11 Correct 305 ms 41388 KB Output is correct
12 Correct 57 ms 6784 KB Output is correct
13 Correct 573 ms 35488 KB Output is correct
14 Correct 165 ms 41152 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 1 ms 212 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 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 2 ms 548 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 3 ms 596 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 248 ms 20232 KB Output is correct
43 Correct 305 ms 41388 KB Output is correct
44 Correct 57 ms 6784 KB Output is correct
45 Correct 573 ms 35488 KB Output is correct
46 Correct 165 ms 41152 KB Output is correct
47 Correct 0 ms 304 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 201 ms 44360 KB Output is correct
51 Correct 205 ms 47316 KB Output is correct
52 Correct 227 ms 36032 KB Output is correct
53 Correct 242 ms 36020 KB Output is correct
54 Correct 221 ms 36016 KB Output is correct
55 Correct 232 ms 27328 KB Output is correct
56 Correct 315 ms 49744 KB Output is correct
57 Correct 292 ms 46652 KB Output is correct
58 Correct 259 ms 55164 KB Output is correct
59 Correct 425 ms 41524 KB Output is correct
60 Correct 238 ms 40152 KB Output is correct
61 Correct 399 ms 42324 KB Output is correct
62 Correct 1314 ms 33664 KB Output is correct
63 Correct 195 ms 36248 KB Output is correct
64 Correct 4 ms 1108 KB Output is correct
65 Correct 3 ms 1108 KB Output is correct
66 Correct 1307 ms 33628 KB Output is correct
67 Correct 17 ms 4976 KB Output is correct
68 Correct 28 ms 8012 KB Output is correct
69 Correct 436 ms 41576 KB Output is correct
70 Correct 57 ms 15560 KB Output is correct
71 Correct 171 ms 47148 KB Output is correct
72 Correct 457 ms 41532 KB Output is correct
73 Correct 1303 ms 33732 KB Output is correct