oj.uz

Submission #465948

# Submission time Handle Problem Language Result Execution time Memory
465948 2021-08-17T12:20:27 Z alexxela12345 Keys (IOI21_keys) C++17
100 / 100
 1554 ms 85784 KB 
#include "keys.h"

#include <functional>
#include <queue>
#include <vector>

std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u,
                                std::vector<int> v, std::vector<int> c) {
  int n = r.size(), m = u.size();

  // DSU
  std::vector<int> roots(n);
  std::function<int(int)> findRoot = [&](int u) {
    if (u == roots[u]) return u;
    return roots[u] = findRoot(roots[u]);
  };
  std::function<void(int, int)> merge = [&](int u, int v) {
    if (findRoot(u) != findRoot(v)) {
      roots[roots[u]] = roots[v];
    }
  };
  for (int i = 0; i < n; ++i) {
    roots[i] = i;
  }

  // Adj list init
  std::vector<std::vector<std::pair<int, int>>> adj(n);
  for (int j = 0; j < m; ++j) {
    adj[u[j]].emplace_back(v[j], c[j]);
    adj[v[j]].emplace_back(u[j], c[j]);
  }

  std::vector<bool> vis(n), keys(n);
  std::vector<std::vector<int>> pendingCorridors(n);
  std::function<std::vector<int>(int)> bfs = [&](int st) {
    std::vector<int> locks;
    std::vector<int> reach;

    [&]() {
      std::queue<int> q;
      q.push(st);

      while (!q.empty()) {
        int u = q.front();
        q.pop();

        if (vis[u]) continue;
        vis[u] = true;

        reach.push_back(u);
        keys[r[u]] = true;
        for (int v : pendingCorridors[r[u]]) q.push(v);
        pendingCorridors[r[u]].clear();

        if (findRoot(u) != findRoot(st)) return;

        for (auto [v, c] : adj[u]) {
          if (keys[c]) {
            q.push(v);
          } else {
            locks.push_back(c);
            pendingCorridors[c].push_back(v);
          }
        }
      }
    }();

    for (int u : reach) vis[u] = false, keys[r[u]] = false;
    for (int c : locks) pendingCorridors[c].clear();
    return reach;
  };

  std::vector<std::vector<int>> sinks;

  std::vector<std::pair<int, int>> merges;
  do {
    merges.clear();

    for (int st = 0; st < n; ++st) {
      if (findRoot(st) != st) continue;
      std::vector<int> component = bfs(st);
      if (findRoot(component.back()) != st) {
        merges.emplace_back(st, roots[component.back()]);
      } else {
        sinks.emplace_back(component);
      }
    }
    for (auto [u, v] : merges) merge(u, v);
  } while (!merges.empty());


  int minimum_reachable = n;
  for (const std::vector<int> &sink : sinks) {
    if (static_cast<int>(sink.size()) < minimum_reachable) {
      minimum_reachable = sink.size();
    }
  }

  std::vector<int> p(n);
  for (const std::vector<int> &sink : sinks) {
    if (static_cast<int>(sink.size()) != minimum_reachable) continue;
    for (int node : sink) p[node] = 1;
  }
  return p;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
17.0 / 17.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 317 ms 29960 KB Output is correct
11 Correct 359 ms 49316 KB Output is correct
12 Correct 85 ms 10380 KB Output is correct
13 Correct 586 ms 59172 KB Output is correct
14 Correct 279 ms 45432 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 3 ms 588 KB Output is correct
28 Correct 3 ms 716 KB Output is correct
29 Correct 3 ms 716 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 2 ms 460 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 2 ms 460 KB Output is correct
37 Correct 2 ms 460 KB Output is correct
38 Correct 2 ms 460 KB Output is correct
39 Correct 3 ms 588 KB Output is correct
40 Correct 2 ms 332 KB Output is correct
41 Correct 2 ms 460 KB Output is correct
42 Correct 317 ms 29960 KB Output is correct
43 Correct 359 ms 49316 KB Output is correct
44 Correct 85 ms 10380 KB Output is correct
45 Correct 586 ms 59172 KB Output is correct
46 Correct 279 ms 45432 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 238 ms 46268 KB Output is correct
51 Correct 296 ms 48524 KB Output is correct
52 Correct 404 ms 48516 KB Output is correct
53 Correct 408 ms 48448 KB Output is correct
54 Correct 419 ms 48620 KB Output is correct
55 Correct 364 ms 35596 KB Output is correct
56 Correct 547 ms 71000 KB Output is correct
57 Correct 475 ms 85784 KB Output is correct
58 Correct 439 ms 59560 KB Output is correct
59 Correct 526 ms 46948 KB Output is correct
60 Correct 487 ms 46292 KB Output is correct
61 Correct 520 ms 47436 KB Output is correct
62 Correct 1554 ms 40188 KB Output is correct
63 Correct 326 ms 41052 KB Output is correct
64 Correct 6 ms 972 KB Output is correct
65 Correct 5 ms 972 KB Output is correct
66 Correct 1524 ms 40232 KB Output is correct
67 Correct 28 ms 4616 KB Output is correct
68 Correct 54 ms 7712 KB Output is correct
69 Correct 524 ms 46960 KB Output is correct
70 Correct 91 ms 15144 KB Output is correct
71 Correct 274 ms 46080 KB Output is correct
72 Correct 511 ms 46892 KB Output is correct
73 Correct 1493 ms 40108 KB Output is correct