oj.uz

Submission #395272

# Submission time Handle Problem Language Result Execution time Memory
395272 2021-04-28T04:47:34 Z rama_pang Evacuation plan (IZhO18_plan) C++17
100 / 100
 833 ms 69716 KB 
#include <bits/stdc++.h>
using namespace std;

class DisjointSet {
 public:
  int n;
  vector<int> p;
  DisjointSet() {}
  DisjointSet(int n) : n(n), p(n) {
    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) {
      p.emplace_back(n);
      p[x] = p[y] = n;
      n++;
      return 1;
    }
    return 0;
  }
};

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);

  int n, m;
  cin >> n >> m;
  vector<vector<pair<int, int>>> adj(n);
  for (int i = 0; i < m; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    u--, v--;
    adj[u].emplace_back(v, w);
    adj[v].emplace_back(u, w);
  }
  int k;
  cin >> k;
  vector<int> dist(n, -1);
  priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
  for (int i = 0; i < k; i++) {
    int g;
    cin >> g;
    g--;
    dist[g] = 0;
    pq.emplace(0, g);
  }

  while (!pq.empty()) {
    int u = pq.top().second;
    int d = pq.top().first;
    pq.pop();
    if (dist[u] != d) {
      continue;
    }
    for (auto e : adj[u]) {
      int v = e.first;
      int w = e.second;
      if (dist[v] == -1 || dist[v] > dist[u] + w) {
        dist[v] = dist[u] + w;
        pq.emplace(dist[v], v);
      }
    }
  }

  vector<int> order(n);
  iota(begin(order), end(order), 0);
  sort(begin(order), end(order), [&](int i, int j) { return dist[i] > dist[j]; });

  DisjointSet D(n);
  vector<int> done(n);
  vector<int> depth(n);
  vector<int> parent(n, -1);
  vector<vector<int>> tree(n);
  for (auto u : order) {
    done[u] = 1;
    for (auto v : adj[u]) {
      if (done[v.first] && D.Find(u) != D.Find(v.first)) {
        int r = tree.size();
        depth.emplace_back();
        tree.emplace_back();
        parent.emplace_back(-1);
        dist.emplace_back(dist[u]);
        tree[r].emplace_back(D.Find(u));
        tree[r].emplace_back(D.Find(v.first));
        assert(D.Unite(u, v.first));
      }
    }
  }

  vector<vector<int>> lift(tree.size(), vector<int>(20, -1));
  function<void(int)> Dfs = [&](int u) {
    lift[u][0] = parent[u];
    for (int j = 1; j < 20; j++) {
      if (lift[u][j - 1] == -1) {
        lift[u][j] = -1;
      } else {
        lift[u][j] = lift[lift[u][j - 1]][j - 1];
      }
    }
    for (auto v : tree[u]) {
      depth[v] = depth[u] + 1;
      parent[v] = u;
      Dfs(v);
      dist[u] = min(dist[u], dist[v]);
    }
  };
  Dfs(int(tree.size()) - 1);


  int q;
  cin >> q;
  while (q--) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    if (depth[u] > depth[v]) {
      swap(u, v);
    }
    int diff = depth[v] - depth[u];
    for (int i = 0; i < 20; i++) {
      if (diff & (1 << i)) {
        v = lift[v][i];
      }
    }
    for (int i = 19; i >= 0; i--) {
      if (lift[u][i] != lift[v][i]) {
        u = lift[u][i];
        v = lift[v][i];
      }
    }
    if (u != v) {
      u = lift[u][0];
      v = lift[v][0];
    }
    assert(u == v);
    cout << dist[u] << '\n';
  }
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 2 ms 848 KB Output is correct
3 Correct 2 ms 848 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 844 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 844 KB Output is correct
13 Correct 2 ms 720 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 2 ms 716 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 2 ms 848 KB Output is correct
3 Correct 2 ms 848 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 844 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 844 KB Output is correct
13 Correct 2 ms 720 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 337 ms 39916 KB Output is correct
17 Correct 787 ms 69648 KB Output is correct
18 Correct 40 ms 7840 KB Output is correct
19 Correct 339 ms 55168 KB Output is correct
20 Correct 762 ms 69520 KB Output is correct
21 Correct 516 ms 55876 KB Output is correct
22 Correct 329 ms 54192 KB Output is correct
23 Correct 800 ms 69528 KB Output is correct
24 Correct 746 ms 69592 KB Output is correct
25 Correct 734 ms 69492 KB Output is correct
26 Correct 307 ms 55056 KB Output is correct
27 Correct 300 ms 55260 KB Output is correct
28 Correct 296 ms 55024 KB Output is correct
29 Correct 344 ms 55184 KB Output is correct
30 Correct 292 ms 55228 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 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 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 322 ms 53984 KB Output is correct
2 Correct 544 ms 68000 KB Output is correct
3 Correct 557 ms 67916 KB Output is correct
4 Correct 195 ms 47352 KB Output is correct
5 Correct 629 ms 68056 KB Output is correct
6 Correct 713 ms 67968 KB Output is correct
7 Correct 586 ms 68044 KB Output is correct
8 Correct 597 ms 67956 KB Output is correct
9 Correct 620 ms 67888 KB Output is correct
10 Correct 570 ms 67852 KB Output is correct
11 Correct 542 ms 67856 KB Output is correct
12 Correct 543 ms 67852 KB Output is correct
13 Correct 586 ms 67876 KB Output is correct
14 Correct 644 ms 67976 KB Output is correct
15 Correct 595 ms 67972 KB Output is correct
16 Correct 579 ms 67876 KB Output is correct
17 Correct 599 ms 67956 KB Output is correct
18 Correct 618 ms 67880 KB Output is correct
19 Correct 210 ms 52036 KB Output is correct
20 Correct 580 ms 67960 KB Output is correct
21 Correct 551 ms 67996 KB Output is correct
22 Correct 221 ms 53528 KB Output is correct
23 Correct 194 ms 44992 KB Output is correct
24 Correct 237 ms 53628 KB Output is correct
25 Correct 246 ms 53632 KB Output is correct
26 Correct 245 ms 43624 KB Output is correct
27 Correct 218 ms 47356 KB Output is correct
28 Correct 225 ms 53588 KB Output is correct
29 Correct 194 ms 47356 KB Output is correct
30 Correct 223 ms 53632 KB Output is correct
31 Correct 199 ms 47276 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 2 ms 848 KB Output is correct
3 Correct 2 ms 848 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 844 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 844 KB Output is correct
13 Correct 2 ms 720 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 337 ms 39916 KB Output is correct
17 Correct 787 ms 69648 KB Output is correct
18 Correct 40 ms 7840 KB Output is correct
19 Correct 339 ms 55168 KB Output is correct
20 Correct 762 ms 69520 KB Output is correct
21 Correct 516 ms 55876 KB Output is correct
22 Correct 329 ms 54192 KB Output is correct
23 Correct 800 ms 69528 KB Output is correct
24 Correct 746 ms 69592 KB Output is correct
25 Correct 734 ms 69492 KB Output is correct
26 Correct 307 ms 55056 KB Output is correct
27 Correct 300 ms 55260 KB Output is correct
28 Correct 296 ms 55024 KB Output is correct
29 Correct 344 ms 55184 KB Output is correct
30 Correct 292 ms 55228 KB Output is correct
31 Correct 1 ms 320 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 322 ms 53984 KB Output is correct
42 Correct 544 ms 68000 KB Output is correct
43 Correct 557 ms 67916 KB Output is correct
44 Correct 195 ms 47352 KB Output is correct
45 Correct 629 ms 68056 KB Output is correct
46 Correct 713 ms 67968 KB Output is correct
47 Correct 586 ms 68044 KB Output is correct
48 Correct 597 ms 67956 KB Output is correct
49 Correct 620 ms 67888 KB Output is correct
50 Correct 570 ms 67852 KB Output is correct
51 Correct 542 ms 67856 KB Output is correct
52 Correct 543 ms 67852 KB Output is correct
53 Correct 586 ms 67876 KB Output is correct
54 Correct 644 ms 67976 KB Output is correct
55 Correct 595 ms 67972 KB Output is correct
56 Correct 579 ms 67876 KB Output is correct
57 Correct 599 ms 67956 KB Output is correct
58 Correct 618 ms 67880 KB Output is correct
59 Correct 210 ms 52036 KB Output is correct
60 Correct 580 ms 67960 KB Output is correct
61 Correct 551 ms 67996 KB Output is correct
62 Correct 221 ms 53528 KB Output is correct
63 Correct 194 ms 44992 KB Output is correct
64 Correct 237 ms 53628 KB Output is correct
65 Correct 246 ms 53632 KB Output is correct
66 Correct 245 ms 43624 KB Output is correct
67 Correct 218 ms 47356 KB Output is correct
68 Correct 225 ms 53588 KB Output is correct
69 Correct 194 ms 47356 KB Output is correct
70 Correct 223 ms 53632 KB Output is correct
71 Correct 199 ms 47276 KB Output is correct
72 Correct 523 ms 55748 KB Output is correct
73 Correct 833 ms 69508 KB Output is correct
74 Correct 774 ms 69692 KB Output is correct
75 Correct 798 ms 69536 KB Output is correct
76 Correct 795 ms 69528 KB Output is correct
77 Correct 801 ms 69524 KB Output is correct
78 Correct 764 ms 69512 KB Output is correct
79 Correct 762 ms 69508 KB Output is correct
80 Correct 777 ms 69660 KB Output is correct
81 Correct 751 ms 69616 KB Output is correct
82 Correct 796 ms 69552 KB Output is correct
83 Correct 808 ms 69544 KB Output is correct
84 Correct 757 ms 69564 KB Output is correct
85 Correct 762 ms 69516 KB Output is correct
86 Correct 775 ms 69608 KB Output is correct
87 Correct 770 ms 69716 KB Output is correct
88 Correct 783 ms 69684 KB Output is correct
89 Correct 453 ms 54120 KB Output is correct
90 Correct 763 ms 69492 KB Output is correct
91 Correct 766 ms 69456 KB Output is correct
92 Correct 402 ms 55248 KB Output is correct
93 Correct 328 ms 46968 KB Output is correct
94 Correct 387 ms 55048 KB Output is correct
95 Correct 413 ms 55136 KB Output is correct
96 Correct 357 ms 44980 KB Output is correct
97 Correct 425 ms 49080 KB Output is correct
98 Correct 387 ms 55036 KB Output is correct
99 Correct 426 ms 49040 KB Output is correct
100 Correct 388 ms 55136 KB Output is correct