oj.uz

Submission #989597

# Submission time Handle Problem Language Result Execution time Memory
989597 2024-05-28T11:43:27 Z tch1cherin Evacuation plan (IZhO18_plan) C++17
100 / 100
 398 ms 35268 KB 
#include <bits/stdc++.h>
using namespace std;

struct dsu {
  vector<int> parent, rank;
  vector<pair<int, int>> parent_old, rank_old;

  dsu() {}

  dsu(int n) : parent(n), rank(n, 1) {
    iota(parent.begin(), parent.end(), 0);
  }

  int get(int u) {
    return parent[u] == u ? u : get(parent[u]);
  }

  bool unite(int u, int v) {
    u = get(u), v = get(v);
    if (u != v) {
      if (rank[u] < rank[v]) {
        swap(u, v);
      }
      rank_old.push_back({u, rank[u]});
      parent_old.push_back({v, parent[v]});
      rank[u] += rank[v];
      parent[v] = u;
      return true;
    }
    return false;
  }

  void rollback() {
    rank[rank_old.back().first] = rank_old.back().second;
    parent[parent_old.back().first] = parent_old.back().second;
    rank_old.pop_back(), parent_old.pop_back();
  }
};

const int MAX_N = 100000;
const int INF = 1e9;
vector<pair<int, int>> graph[MAX_N];
vector<int> S, T, dist, answer;
vector<int> sorted_v, pos_v;
dsu sets;

void parallel_bs(vector<int> queries, int L, int R) {
  if (R - L == 1) {
    for (int i : queries) {
      answer[i] = dist[sorted_v[L]];
    }
  } else {
    int mid = (L + R) / 2;
    int cnt_upd = 0;
    for (int i = L; i < mid; i++) {
      for (auto [j, w] : graph[sorted_v[i]]) {
        if (pos_v[j] < mid) {
          cnt_upd += sets.unite(sorted_v[i], j);
        }
      }
    }
    vector<int> q_left, q_right;
    for (int i : queries) {
      if (sets.get(S[i]) == sets.get(T[i])) {
        q_left.push_back(i);
      } else {
        q_right.push_back(i);
      }
    }
    vector<int>().swap(queries);
    parallel_bs(q_right, mid, R);
    while (cnt_upd--) {
      sets.rollback();
    }
    vector<int>().swap(q_right);
    parallel_bs(q_left, L, mid);
    vector<int>().swap(q_left);
  }
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int a, b, w;
    cin >> a >> b >> w;
    a--, b--;
    graph[a].push_back({b, w});
    graph[b].push_back({a, w});
  }
  int k;
  cin >> k;
  vector<int> cities(k);
  for (int &value : cities) {
    cin >> value;
    value--;
  }
  int Q;
  cin >> Q;
  S = T = vector<int>(Q);
  for (int i = 0; i < Q; i++) {
    cin >> S[i] >> T[i];
    S[i]--, T[i]--;
  }
  priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> que;
  dist.assign(n, INF);
  pos_v.resize(n);
  for (int u : cities) {
    que.push({dist[u] = 0, u});
  }
  while (!que.empty()) {
    auto [d, u] = que.top();
    que.pop();
    if (d > dist[u]) {
      continue;
    }
    sorted_v.push_back(u);
    pos_v[u] = n - (int)sorted_v.size();
    for (auto [v, w] : graph[u]) {
      if (dist[v] > dist[u] + w) {
        que.push({dist[v] = dist[u] + w, v});
      }
    }
  }
  reverse(sorted_v.begin(), sorted_v.end());
  answer.resize(Q);
  sets = dsu(n);
  vector<int> queries(Q);
  iota(queries.begin(), queries.end(), 0);
  parallel_bs(queries, 0, n);
  for (int i = 0; i < Q; i++) {
    cout << answer[i] << "\n";
  }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 2 ms 2904 KB Output is correct
3 Correct 2 ms 2908 KB Output is correct
4 Correct 2 ms 2804 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 2 ms 2908 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 2 ms 2820 KB Output is correct
14 Correct 2 ms 2904 KB Output is correct
15 Correct 2 ms 2904 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 2 ms 2904 KB Output is correct
3 Correct 2 ms 2908 KB Output is correct
4 Correct 2 ms 2804 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 2 ms 2908 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 2 ms 2820 KB Output is correct
14 Correct 2 ms 2904 KB Output is correct
15 Correct 2 ms 2904 KB Output is correct
16 Correct 139 ms 15300 KB Output is correct
17 Correct 331 ms 34520 KB Output is correct
18 Correct 25 ms 5624 KB Output is correct
19 Correct 72 ms 23368 KB Output is correct
20 Correct 341 ms 34524 KB Output is correct
21 Correct 196 ms 22136 KB Output is correct
22 Correct 92 ms 15332 KB Output is correct
23 Correct 353 ms 34776 KB Output is correct
24 Correct 370 ms 34524 KB Output is correct
25 Correct 366 ms 34772 KB Output is correct
26 Correct 79 ms 23436 KB Output is correct
27 Correct 71 ms 22904 KB Output is correct
28 Correct 74 ms 23100 KB Output is correct
29 Correct 76 ms 23436 KB Output is correct
30 Correct 71 ms 23712 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 17316 KB Output is correct
2 Correct 287 ms 30168 KB Output is correct
3 Correct 302 ms 30212 KB Output is correct
4 Correct 61 ms 11720 KB Output is correct
5 Correct 274 ms 30424 KB Output is correct
6 Correct 298 ms 30284 KB Output is correct
7 Correct 268 ms 30332 KB Output is correct
8 Correct 283 ms 30172 KB Output is correct
9 Correct 261 ms 30168 KB Output is correct
10 Correct 282 ms 30428 KB Output is correct
11 Correct 262 ms 30296 KB Output is correct
12 Correct 268 ms 30176 KB Output is correct
13 Correct 304 ms 30208 KB Output is correct
14 Correct 264 ms 30424 KB Output is correct
15 Correct 277 ms 30912 KB Output is correct
16 Correct 270 ms 30428 KB Output is correct
17 Correct 279 ms 30424 KB Output is correct
18 Correct 266 ms 30308 KB Output is correct
19 Correct 47 ms 11716 KB Output is correct
20 Correct 293 ms 30404 KB Output is correct
21 Correct 238 ms 30668 KB Output is correct
22 Correct 43 ms 13384 KB Output is correct
23 Correct 66 ms 12456 KB Output is correct
24 Correct 51 ms 13396 KB Output is correct
25 Correct 48 ms 13380 KB Output is correct
26 Correct 65 ms 12400 KB Output is correct
27 Correct 46 ms 11960 KB Output is correct
28 Correct 51 ms 13396 KB Output is correct
29 Correct 53 ms 11716 KB Output is correct
30 Correct 51 ms 13412 KB Output is correct
31 Correct 46 ms 11972 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 2 ms 2904 KB Output is correct
3 Correct 2 ms 2908 KB Output is correct
4 Correct 2 ms 2804 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 2 ms 2908 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 2 ms 2820 KB Output is correct
14 Correct 2 ms 2904 KB Output is correct
15 Correct 2 ms 2904 KB Output is correct
16 Correct 139 ms 15300 KB Output is correct
17 Correct 331 ms 34520 KB Output is correct
18 Correct 25 ms 5624 KB Output is correct
19 Correct 72 ms 23368 KB Output is correct
20 Correct 341 ms 34524 KB Output is correct
21 Correct 196 ms 22136 KB Output is correct
22 Correct 92 ms 15332 KB Output is correct
23 Correct 353 ms 34776 KB Output is correct
24 Correct 370 ms 34524 KB Output is correct
25 Correct 366 ms 34772 KB Output is correct
26 Correct 79 ms 23436 KB Output is correct
27 Correct 71 ms 22904 KB Output is correct
28 Correct 74 ms 23100 KB Output is correct
29 Correct 76 ms 23436 KB Output is correct
30 Correct 71 ms 23712 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 1 ms 2652 KB Output is correct
34 Correct 1 ms 2652 KB Output is correct
35 Correct 1 ms 2804 KB Output is correct
36 Correct 1 ms 2652 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 1 ms 2804 KB Output is correct
39 Correct 1 ms 2652 KB Output is correct
40 Correct 1 ms 2652 KB Output is correct
41 Correct 151 ms 17316 KB Output is correct
42 Correct 287 ms 30168 KB Output is correct
43 Correct 302 ms 30212 KB Output is correct
44 Correct 61 ms 11720 KB Output is correct
45 Correct 274 ms 30424 KB Output is correct
46 Correct 298 ms 30284 KB Output is correct
47 Correct 268 ms 30332 KB Output is correct
48 Correct 283 ms 30172 KB Output is correct
49 Correct 261 ms 30168 KB Output is correct
50 Correct 282 ms 30428 KB Output is correct
51 Correct 262 ms 30296 KB Output is correct
52 Correct 268 ms 30176 KB Output is correct
53 Correct 304 ms 30208 KB Output is correct
54 Correct 264 ms 30424 KB Output is correct
55 Correct 277 ms 30912 KB Output is correct
56 Correct 270 ms 30428 KB Output is correct
57 Correct 279 ms 30424 KB Output is correct
58 Correct 266 ms 30308 KB Output is correct
59 Correct 47 ms 11716 KB Output is correct
60 Correct 293 ms 30404 KB Output is correct
61 Correct 238 ms 30668 KB Output is correct
62 Correct 43 ms 13384 KB Output is correct
63 Correct 66 ms 12456 KB Output is correct
64 Correct 51 ms 13396 KB Output is correct
65 Correct 48 ms 13380 KB Output is correct
66 Correct 65 ms 12400 KB Output is correct
67 Correct 46 ms 11960 KB Output is correct
68 Correct 51 ms 13396 KB Output is correct
69 Correct 53 ms 11716 KB Output is correct
70 Correct 51 ms 13412 KB Output is correct
71 Correct 46 ms 11972 KB Output is correct
72 Correct 206 ms 20964 KB Output is correct
73 Correct 398 ms 34720 KB Output is correct
74 Correct 330 ms 34512 KB Output is correct
75 Correct 337 ms 34928 KB Output is correct
76 Correct 321 ms 34704 KB Output is correct
77 Correct 339 ms 34524 KB Output is correct
78 Correct 327 ms 34520 KB Output is correct
79 Correct 335 ms 34864 KB Output is correct
80 Correct 331 ms 34624 KB Output is correct
81 Correct 352 ms 34580 KB Output is correct
82 Correct 343 ms 34588 KB Output is correct
83 Correct 347 ms 34524 KB Output is correct
84 Correct 316 ms 34520 KB Output is correct
85 Correct 332 ms 35268 KB Output is correct
86 Correct 310 ms 34696 KB Output is correct
87 Correct 337 ms 34688 KB Output is correct
88 Correct 331 ms 34520 KB Output is correct
89 Correct 95 ms 15896 KB Output is correct
90 Correct 326 ms 34508 KB Output is correct
91 Correct 345 ms 35020 KB Output is correct
92 Correct 70 ms 23364 KB Output is correct
93 Correct 153 ms 17204 KB Output is correct
94 Correct 73 ms 23292 KB Output is correct
95 Correct 75 ms 23364 KB Output is correct
96 Correct 137 ms 20152 KB Output is correct
97 Correct 89 ms 18556 KB Output is correct
98 Correct 78 ms 23380 KB Output is correct
99 Correct 96 ms 18492 KB Output is correct
100 Correct 75 ms 23080 KB Output is correct