oj.uz

Submission #935080

# Submission time Handle Problem Language Result Execution time Memory
935080 2024-02-28T15:07:29 Z ind1v Evacuation plan (IZhO18_plan) C++11
100 / 100
 803 ms 43636 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;
const int L = 20;

struct dsu {
  int lab[N];
  
  dsu() {
    memset(lab, -1, sizeof(lab));
  }
  
  void reset() {
    memset(lab, -1, sizeof(lab));
  }
  
  int find(int u) {
    return lab[u] < 0 ? u : lab[u] = find(lab[u]);
  }
  
  bool merge(int u, int v) {
    if ((u = find(u)) == (v = find(v))) {
      return false;
    }
    if (lab[u] > lab[v]) {
      swap(u, v);
    }
    lab[u] += lab[v];
    lab[v] = u;
    return true;
  }
};

int n, m;
vector<pair<int, int>> adj[N];
int k;
vector<int> g;
int q;
int s[N], t[N];
int l[N], r[N], ans[N], ord[N];
long long d[N];
vector<int> cand[N];
dsu ds;

void dijkstra() {
  memset(d, 0x3f, sizeof(d));
  priority_queue<pair<long long, int>> pq;
  for (int i = 1; i <= k; i++) {
    d[g[i]] = 0;
    pq.push({-d[g[i]], g[i]});
  }
  while (!pq.empty()) {
    long long cd = -pq.top().first;
    int u = pq.top().second;
    pq.pop();
    if (cd != d[u]) {
      continue;
    }
    for (auto e : adj[u]) {
      if (d[e.first] > d[u] + e.second) {
        d[e.first] = d[u] + e.second;
        pq.push({-d[e.first], e.first});
      }
    }
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    int a, b, w;
    cin >> a >> b >> w;
    adj[a].emplace_back(b, w);
    adj[b].emplace_back(a, w);
  }
  cin >> k;
  g.resize(k + 1);
  for (int i = 1; i <= k; i++) {
    cin >> g[i];
  }
  cin >> q;
  for (int i = 1; i <= q; i++) {
    cin >> s[i] >> t[i];
  }
  dijkstra();
  vector<pair<long long, int>> dd(n + 1);
  for (int i = 1; i <= n; i++) {
    dd[i] = {d[i], i};
  }
  sort(dd.begin() + 1, dd.end());
  for (int i = 1; i <= n; i++) {
    ord[dd[i].second] = i;
  }
  for (int i = 1; i <= q; i++) {
    l[i] = 1;
    r[i] = n;
  }
  for (int ite = 1; ite <= L; ite++) {
    ds.reset();
    for (int i = 1; i <= n; i++) {
      cand[i].clear();
    }
    for (int i = 1; i <= q; i++) {
      if (l[i] > r[i]) {
        continue;
      }
      cand[(l[i] + r[i]) >> 1].emplace_back(i);
    }
    for (int i = n; i >= 1; i--) {
      for (auto e : adj[dd[i].second]) {
        if (ord[e.first] >= i) {
          ds.merge(dd[i].second, e.first);
        }
      }
      for (auto qq : cand[i]) {
        if (ds.find(s[qq]) == ds.find(t[qq])) {
          ans[qq] = i;
          l[qq] = i + 1;
        } else {
          r[qq] = i - 1;
        }
      }
    }
  }
  for (int i = 1; i <= q; i++) {
    cout << dd[ans[i]].first << '\n';
  }
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 4 ms 8804 KB Output is correct
3 Correct 4 ms 8792 KB Output is correct
4 Correct 3 ms 8540 KB Output is correct
5 Correct 4 ms 8796 KB Output is correct
6 Correct 3 ms 8796 KB Output is correct
7 Correct 2 ms 8536 KB Output is correct
8 Correct 2 ms 8536 KB Output is correct
9 Correct 4 ms 8796 KB Output is correct
10 Correct 4 ms 8796 KB Output is correct
11 Correct 4 ms 8792 KB Output is correct
12 Correct 4 ms 8792 KB Output is correct
13 Correct 4 ms 8796 KB Output is correct
14 Correct 3 ms 8792 KB Output is correct
15 Correct 4 ms 8792 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 4 ms 8804 KB Output is correct
3 Correct 4 ms 8792 KB Output is correct
4 Correct 3 ms 8540 KB Output is correct
5 Correct 4 ms 8796 KB Output is correct
6 Correct 3 ms 8796 KB Output is correct
7 Correct 2 ms 8536 KB Output is correct
8 Correct 2 ms 8536 KB Output is correct
9 Correct 4 ms 8796 KB Output is correct
10 Correct 4 ms 8796 KB Output is correct
11 Correct 4 ms 8792 KB Output is correct
12 Correct 4 ms 8792 KB Output is correct
13 Correct 4 ms 8796 KB Output is correct
14 Correct 3 ms 8792 KB Output is correct
15 Correct 4 ms 8792 KB Output is correct
16 Correct 279 ms 26068 KB Output is correct
17 Correct 724 ms 42516 KB Output is correct
18 Correct 39 ms 11536 KB Output is correct
19 Correct 118 ms 24860 KB Output is correct
20 Correct 674 ms 42480 KB Output is correct
21 Correct 311 ms 31152 KB Output is correct
22 Correct 141 ms 27000 KB Output is correct
23 Correct 635 ms 42504 KB Output is correct
24 Correct 758 ms 42520 KB Output is correct
25 Correct 698 ms 42604 KB Output is correct
26 Correct 146 ms 24612 KB Output is correct
27 Correct 116 ms 24804 KB Output is correct
28 Correct 119 ms 24224 KB Output is correct
29 Correct 116 ms 24328 KB Output is correct
30 Correct 126 ms 24604 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8680 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 4 ms 8504 KB Output is correct
4 Correct 3 ms 8540 KB Output is correct
5 Correct 4 ms 8684 KB Output is correct
6 Correct 2 ms 8684 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8536 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 328 ms 19976 KB Output is correct
2 Correct 576 ms 32968 KB Output is correct
3 Correct 641 ms 32872 KB Output is correct
4 Correct 87 ms 14932 KB Output is correct
5 Correct 567 ms 32804 KB Output is correct
6 Correct 617 ms 32976 KB Output is correct
7 Correct 548 ms 33128 KB Output is correct
8 Correct 575 ms 32840 KB Output is correct
9 Correct 580 ms 32884 KB Output is correct
10 Correct 544 ms 32972 KB Output is correct
11 Correct 646 ms 32972 KB Output is correct
12 Correct 548 ms 32968 KB Output is correct
13 Correct 570 ms 32860 KB Output is correct
14 Correct 595 ms 33176 KB Output is correct
15 Correct 570 ms 36512 KB Output is correct
16 Correct 527 ms 32956 KB Output is correct
17 Correct 597 ms 33032 KB Output is correct
18 Correct 540 ms 32876 KB Output is correct
19 Correct 61 ms 14932 KB Output is correct
20 Correct 550 ms 32968 KB Output is correct
21 Correct 470 ms 33740 KB Output is correct
22 Correct 92 ms 16196 KB Output is correct
23 Correct 95 ms 15444 KB Output is correct
24 Correct 75 ms 16196 KB Output is correct
25 Correct 73 ms 16200 KB Output is correct
26 Correct 119 ms 15424 KB Output is correct
27 Correct 61 ms 15188 KB Output is correct
28 Correct 76 ms 16200 KB Output is correct
29 Correct 65 ms 14940 KB Output is correct
30 Correct 82 ms 16212 KB Output is correct
31 Correct 90 ms 14928 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 4 ms 8804 KB Output is correct
3 Correct 4 ms 8792 KB Output is correct
4 Correct 3 ms 8540 KB Output is correct
5 Correct 4 ms 8796 KB Output is correct
6 Correct 3 ms 8796 KB Output is correct
7 Correct 2 ms 8536 KB Output is correct
8 Correct 2 ms 8536 KB Output is correct
9 Correct 4 ms 8796 KB Output is correct
10 Correct 4 ms 8796 KB Output is correct
11 Correct 4 ms 8792 KB Output is correct
12 Correct 4 ms 8792 KB Output is correct
13 Correct 4 ms 8796 KB Output is correct
14 Correct 3 ms 8792 KB Output is correct
15 Correct 4 ms 8792 KB Output is correct
16 Correct 279 ms 26068 KB Output is correct
17 Correct 724 ms 42516 KB Output is correct
18 Correct 39 ms 11536 KB Output is correct
19 Correct 118 ms 24860 KB Output is correct
20 Correct 674 ms 42480 KB Output is correct
21 Correct 311 ms 31152 KB Output is correct
22 Correct 141 ms 27000 KB Output is correct
23 Correct 635 ms 42504 KB Output is correct
24 Correct 758 ms 42520 KB Output is correct
25 Correct 698 ms 42604 KB Output is correct
26 Correct 146 ms 24612 KB Output is correct
27 Correct 116 ms 24804 KB Output is correct
28 Correct 119 ms 24224 KB Output is correct
29 Correct 116 ms 24328 KB Output is correct
30 Correct 126 ms 24604 KB Output is correct
31 Correct 3 ms 8680 KB Output is correct
32 Correct 2 ms 8540 KB Output is correct
33 Correct 4 ms 8504 KB Output is correct
34 Correct 3 ms 8540 KB Output is correct
35 Correct 4 ms 8684 KB Output is correct
36 Correct 2 ms 8684 KB Output is correct
37 Correct 2 ms 8540 KB Output is correct
38 Correct 2 ms 8540 KB Output is correct
39 Correct 2 ms 8536 KB Output is correct
40 Correct 2 ms 8540 KB Output is correct
41 Correct 328 ms 19976 KB Output is correct
42 Correct 576 ms 32968 KB Output is correct
43 Correct 641 ms 32872 KB Output is correct
44 Correct 87 ms 14932 KB Output is correct
45 Correct 567 ms 32804 KB Output is correct
46 Correct 617 ms 32976 KB Output is correct
47 Correct 548 ms 33128 KB Output is correct
48 Correct 575 ms 32840 KB Output is correct
49 Correct 580 ms 32884 KB Output is correct
50 Correct 544 ms 32972 KB Output is correct
51 Correct 646 ms 32972 KB Output is correct
52 Correct 548 ms 32968 KB Output is correct
53 Correct 570 ms 32860 KB Output is correct
54 Correct 595 ms 33176 KB Output is correct
55 Correct 570 ms 36512 KB Output is correct
56 Correct 527 ms 32956 KB Output is correct
57 Correct 597 ms 33032 KB Output is correct
58 Correct 540 ms 32876 KB Output is correct
59 Correct 61 ms 14932 KB Output is correct
60 Correct 550 ms 32968 KB Output is correct
61 Correct 470 ms 33740 KB Output is correct
62 Correct 92 ms 16196 KB Output is correct
63 Correct 95 ms 15444 KB Output is correct
64 Correct 75 ms 16196 KB Output is correct
65 Correct 73 ms 16200 KB Output is correct
66 Correct 119 ms 15424 KB Output is correct
67 Correct 61 ms 15188 KB Output is correct
68 Correct 76 ms 16200 KB Output is correct
69 Correct 65 ms 14940 KB Output is correct
70 Correct 82 ms 16212 KB Output is correct
71 Correct 90 ms 14928 KB Output is correct
72 Correct 318 ms 30860 KB Output is correct
73 Correct 732 ms 42640 KB Output is correct
74 Correct 635 ms 42500 KB Output is correct
75 Correct 690 ms 42916 KB Output is correct
76 Correct 682 ms 42472 KB Output is correct
77 Correct 736 ms 42516 KB Output is correct
78 Correct 662 ms 42508 KB Output is correct
79 Correct 771 ms 42708 KB Output is correct
80 Correct 723 ms 42692 KB Output is correct
81 Correct 726 ms 42420 KB Output is correct
82 Correct 693 ms 42352 KB Output is correct
83 Correct 663 ms 42512 KB Output is correct
84 Correct 653 ms 42592 KB Output is correct
85 Correct 619 ms 42496 KB Output is correct
86 Correct 774 ms 42544 KB Output is correct
87 Correct 735 ms 42576 KB Output is correct
88 Correct 691 ms 42524 KB Output is correct
89 Correct 133 ms 27244 KB Output is correct
90 Correct 803 ms 42396 KB Output is correct
91 Correct 636 ms 43636 KB Output is correct
92 Correct 116 ms 24812 KB Output is correct
93 Correct 207 ms 25836 KB Output is correct
94 Correct 124 ms 24620 KB Output is correct
95 Correct 123 ms 24308 KB Output is correct
96 Correct 241 ms 24340 KB Output is correct
97 Correct 168 ms 25804 KB Output is correct
98 Correct 114 ms 24108 KB Output is correct
99 Correct 134 ms 25804 KB Output is correct
100 Correct 128 ms 25128 KB Output is correct