oj.uz

Submission #854075

# Submission time Handle Problem Language Result Execution time Memory
854075 2023-09-26T05:16:01 Z NeroZein Evacuation plan (IZhO18_plan) C++17
100 / 100
 573 ms 31784 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

const int N = 1e5 + 5;
const int INF = 1e9; 

int n, m;
int cost[N]; 
bool added[N];
int p[N], sz[N];
vector<pair<int, int>> g[N]; 

void init_dsu() {
  for (int i = 1; i <= n; ++i) {
    sz[i] = 1;
    p[i] = i; 
  }
}

int get(int v) {
  return p[v] = (p[v] == v ? v : get(p[v])); 
}

void unite(int u, int v) {
  u = get(u); v = get(v);
  if (u == v) {
    return;
  }
  if (sz[u] > sz[v]) {
    swap(u, v);
  }
  sz[v] += sz[u];
  p[u] = v; 
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> m;
  for (int i = 0; i < m; ++i) {
    int u, v, w;
    cin >> u >> v >> w;
    g[u].emplace_back(v, w);
    g[v].emplace_back(u, w); 
  }
  priority_queue<pair<int, int>> pq;
  fill(cost, cost + N, INF); 
  int k;
  cin >> k;
  for (int i = 0; i < k; ++i) {
    int v;
    cin >> v;
    cost[v] = 0; 
    pq.emplace(0, v); 
  }
  while (!pq.empty()) {
    auto [c, v] = pq.top();
    pq.pop();
    c = -c;
    if (c != cost[v]) {
      continue;
    }
    for (auto [u, w] : g[v]) {
      if (cost[u] > c + w) {
        cost[u] = c + w;
        pq.emplace(-cost[u], u); 
      }
    }
  }
  int q;
  cin >> q;
  vector<array<int, 6>> qs(q);
  for (int i = 0; i < q; ++i) {
    int u, v;
    cin >> u >> v;
    qs[i][1] = 0;
    qs[i][2] = INF;
    qs[i][3] = i;
    qs[i][4] = u;
    qs[i][5] = v; 
  }
  vector<int> ids(n);
  iota(ids.begin(), ids.end(), 1); 
  sort(ids.begin(), ids.end(), [&](int i, int j) {
    return cost[i] > cost[j];
  });
  while (true) {
    init_dsu(); 
    bool changed = false;
    for (int i = 0; i < q; ++i) {
      if (qs[i][1] != qs[i][2]) {
        changed = true; 
      }
      qs[i][0] = (qs[i][1] + qs[i][2] + 1) / 2; 
      //deb(qs[i]); cout << '\n';
    }
    if (!changed) {
      break; 
    }
    sort(qs.begin(), qs.end(), [&](array<int, 6> i, array<int, 6> j) {
      return i[0] > j[0];
    });
    int ptr = 0;
    for (int i = 0; i < q; ++i) {
      auto& [mid, l, r, qid, qu, qv] = qs[i];
      while (ptr < n && cost[ids[ptr]] >= mid) {
        for (auto [u, w] : g[ids[ptr]]) {
          if (added[u]) {
            unite(u, ids[ptr]); 
          }
        }
        added[ids[ptr]] = true; 
        ptr++;
      }
      if (get(qu) == get(qv)) {
        l = mid;
      } else {
        r = mid - 1; 
      }
    }
    for (int i = 0; i < ptr; ++i) {
      added[ids[i]] = false;
    }
  }
  sort(qs.begin(), qs.end(), [](array<int, 6> i, array<int, 6> j) {
    return i[3] < j[3];
  });
  for (int i = 0; i < q; ++i) {
    cout << qs[i][1] << '\n';
  }
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 3 ms 3160 KB Output is correct
3 Correct 2 ms 3164 KB Output is correct
4 Correct 1 ms 3416 KB Output is correct
5 Correct 2 ms 3160 KB Output is correct
6 Correct 2 ms 3164 KB Output is correct
7 Correct 2 ms 3160 KB Output is correct
8 Correct 1 ms 3160 KB Output is correct
9 Correct 3 ms 3160 KB Output is correct
10 Correct 2 ms 3160 KB Output is correct
11 Correct 3 ms 3160 KB Output is correct
12 Correct 3 ms 3160 KB Output is correct
13 Correct 3 ms 3160 KB Output is correct
14 Correct 3 ms 3164 KB Output is correct
15 Correct 3 ms 3160 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 3 ms 3160 KB Output is correct
3 Correct 2 ms 3164 KB Output is correct
4 Correct 1 ms 3416 KB Output is correct
5 Correct 2 ms 3160 KB Output is correct
6 Correct 2 ms 3164 KB Output is correct
7 Correct 2 ms 3160 KB Output is correct
8 Correct 1 ms 3160 KB Output is correct
9 Correct 3 ms 3160 KB Output is correct
10 Correct 2 ms 3160 KB Output is correct
11 Correct 3 ms 3160 KB Output is correct
12 Correct 3 ms 3160 KB Output is correct
13 Correct 3 ms 3160 KB Output is correct
14 Correct 3 ms 3164 KB Output is correct
15 Correct 3 ms 3160 KB Output is correct
16 Correct 271 ms 13520 KB Output is correct
17 Correct 552 ms 31692 KB Output is correct
18 Correct 36 ms 5736 KB Output is correct
19 Correct 188 ms 14572 KB Output is correct
20 Correct 529 ms 31432 KB Output is correct
21 Correct 258 ms 18636 KB Output is correct
22 Correct 217 ms 13648 KB Output is correct
23 Correct 514 ms 31428 KB Output is correct
24 Correct 530 ms 31428 KB Output is correct
25 Correct 483 ms 31568 KB Output is correct
26 Correct 180 ms 14400 KB Output is correct
27 Correct 192 ms 14516 KB Output is correct
28 Correct 183 ms 14404 KB Output is correct
29 Correct 209 ms 14644 KB Output is correct
30 Correct 188 ms 14784 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 14544 KB Output is correct
2 Correct 273 ms 27588 KB Output is correct
3 Correct 292 ms 27592 KB Output is correct
4 Correct 89 ms 9040 KB Output is correct
5 Correct 343 ms 27592 KB Output is correct
6 Correct 232 ms 27428 KB Output is correct
7 Correct 289 ms 27588 KB Output is correct
8 Correct 234 ms 27592 KB Output is correct
9 Correct 244 ms 27472 KB Output is correct
10 Correct 351 ms 27420 KB Output is correct
11 Correct 388 ms 27596 KB Output is correct
12 Correct 325 ms 27440 KB Output is correct
13 Correct 325 ms 27336 KB Output is correct
14 Correct 259 ms 27848 KB Output is correct
15 Correct 292 ms 27588 KB Output is correct
16 Correct 300 ms 27592 KB Output is correct
17 Correct 230 ms 27592 KB Output is correct
18 Correct 252 ms 27580 KB Output is correct
19 Correct 40 ms 9044 KB Output is correct
20 Correct 314 ms 27584 KB Output is correct
21 Correct 177 ms 27512 KB Output is correct
22 Correct 56 ms 10752 KB Output is correct
23 Correct 97 ms 9552 KB Output is correct
24 Correct 54 ms 10700 KB Output is correct
25 Correct 56 ms 10820 KB Output is correct
26 Correct 81 ms 9808 KB Output is correct
27 Correct 70 ms 9364 KB Output is correct
28 Correct 52 ms 10564 KB Output is correct
29 Correct 86 ms 9300 KB Output is correct
30 Correct 62 ms 10696 KB Output is correct
31 Correct 73 ms 9040 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 3 ms 3160 KB Output is correct
3 Correct 2 ms 3164 KB Output is correct
4 Correct 1 ms 3416 KB Output is correct
5 Correct 2 ms 3160 KB Output is correct
6 Correct 2 ms 3164 KB Output is correct
7 Correct 2 ms 3160 KB Output is correct
8 Correct 1 ms 3160 KB Output is correct
9 Correct 3 ms 3160 KB Output is correct
10 Correct 2 ms 3160 KB Output is correct
11 Correct 3 ms 3160 KB Output is correct
12 Correct 3 ms 3160 KB Output is correct
13 Correct 3 ms 3160 KB Output is correct
14 Correct 3 ms 3164 KB Output is correct
15 Correct 3 ms 3160 KB Output is correct
16 Correct 271 ms 13520 KB Output is correct
17 Correct 552 ms 31692 KB Output is correct
18 Correct 36 ms 5736 KB Output is correct
19 Correct 188 ms 14572 KB Output is correct
20 Correct 529 ms 31432 KB Output is correct
21 Correct 258 ms 18636 KB Output is correct
22 Correct 217 ms 13648 KB Output is correct
23 Correct 514 ms 31428 KB Output is correct
24 Correct 530 ms 31428 KB Output is correct
25 Correct 483 ms 31568 KB Output is correct
26 Correct 180 ms 14400 KB Output is correct
27 Correct 192 ms 14516 KB Output is correct
28 Correct 183 ms 14404 KB Output is correct
29 Correct 209 ms 14644 KB Output is correct
30 Correct 188 ms 14784 KB Output is correct
31 Correct 2 ms 3160 KB Output is correct
32 Correct 3 ms 3164 KB Output is correct
33 Correct 1 ms 3160 KB Output is correct
34 Correct 1 ms 3164 KB Output is correct
35 Correct 2 ms 3160 KB Output is correct
36 Correct 3 ms 3160 KB Output is correct
37 Correct 1 ms 3160 KB Output is correct
38 Correct 1 ms 3160 KB Output is correct
39 Correct 1 ms 3160 KB Output is correct
40 Correct 2 ms 3416 KB Output is correct
41 Correct 149 ms 14544 KB Output is correct
42 Correct 273 ms 27588 KB Output is correct
43 Correct 292 ms 27592 KB Output is correct
44 Correct 89 ms 9040 KB Output is correct
45 Correct 343 ms 27592 KB Output is correct
46 Correct 232 ms 27428 KB Output is correct
47 Correct 289 ms 27588 KB Output is correct
48 Correct 234 ms 27592 KB Output is correct
49 Correct 244 ms 27472 KB Output is correct
50 Correct 351 ms 27420 KB Output is correct
51 Correct 388 ms 27596 KB Output is correct
52 Correct 325 ms 27440 KB Output is correct
53 Correct 325 ms 27336 KB Output is correct
54 Correct 259 ms 27848 KB Output is correct
55 Correct 292 ms 27588 KB Output is correct
56 Correct 300 ms 27592 KB Output is correct
57 Correct 230 ms 27592 KB Output is correct
58 Correct 252 ms 27580 KB Output is correct
59 Correct 40 ms 9044 KB Output is correct
60 Correct 314 ms 27584 KB Output is correct
61 Correct 177 ms 27512 KB Output is correct
62 Correct 56 ms 10752 KB Output is correct
63 Correct 97 ms 9552 KB Output is correct
64 Correct 54 ms 10700 KB Output is correct
65 Correct 56 ms 10820 KB Output is correct
66 Correct 81 ms 9808 KB Output is correct
67 Correct 70 ms 9364 KB Output is correct
68 Correct 52 ms 10564 KB Output is correct
69 Correct 86 ms 9300 KB Output is correct
70 Correct 62 ms 10696 KB Output is correct
71 Correct 73 ms 9040 KB Output is correct
72 Correct 349 ms 18776 KB Output is correct
73 Correct 499 ms 31692 KB Output is correct
74 Correct 573 ms 31688 KB Output is correct
75 Correct 554 ms 31684 KB Output is correct
76 Correct 506 ms 31684 KB Output is correct
77 Correct 496 ms 31600 KB Output is correct
78 Correct 524 ms 31348 KB Output is correct
79 Correct 495 ms 31440 KB Output is correct
80 Correct 537 ms 31532 KB Output is correct
81 Correct 523 ms 31784 KB Output is correct
82 Correct 527 ms 31428 KB Output is correct
83 Correct 474 ms 31428 KB Output is correct
84 Correct 491 ms 31436 KB Output is correct
85 Correct 535 ms 31576 KB Output is correct
86 Correct 484 ms 31440 KB Output is correct
87 Correct 554 ms 31572 KB Output is correct
88 Correct 524 ms 31644 KB Output is correct
89 Correct 221 ms 13652 KB Output is correct
90 Correct 519 ms 31456 KB Output is correct
91 Correct 369 ms 31484 KB Output is correct
92 Correct 187 ms 14664 KB Output is correct
93 Correct 281 ms 13860 KB Output is correct
94 Correct 177 ms 14408 KB Output is correct
95 Correct 197 ms 14668 KB Output is correct
96 Correct 243 ms 13940 KB Output is correct
97 Correct 238 ms 13276 KB Output is correct
98 Correct 193 ms 14524 KB Output is correct
99 Correct 245 ms 13376 KB Output is correct
100 Correct 190 ms 14460 KB Output is correct