oj.uz

Submission #547030

# Submission time Handle Problem Language Result Execution time Memory
547030 2022-04-09T08:49:11 Z Jomnoi Evacuation plan (IZhO18_plan) C++17
100 / 100
 676 ms 59392 KB 
#include <bits/stdc++.h>
#define DEBUG 0
using namespace std;

const int MAX_N = 1e5 + 10;
const int MAX_M = 5e5 + 10;
const int INF = 1e9 + 7;

int A[MAX_M], B[MAX_M];
vector <pair <int, int>> adj[MAX_N];
int dist[MAX_N];
bool visited[MAX_N];
int parent[MAX_N];
set <int> path[MAX_N];
int ans[MAX_N];

int root(const int &u) {
    if(u == parent[u]) {
        return u;
    }
    return parent[u] = root(parent[u]);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int c;
        cin >> A[i] >> B[i] >> c;
        adj[A[i]].emplace_back(B[i], c);
        adj[B[i]].emplace_back(A[i], c);
    }

    int k;
    cin >> k;
    priority_queue <pair <int, int>> pq;
    fill(dist, dist + n + 1, INF);
    while(k--) {
        int g;
        cin >> g;
        dist[g] = 0;
        pq.emplace(0, g);
    }

    while(!pq.empty()) {
        int u = pq.top().second;
        pq.pop();

        if(visited[u] == true) {
            continue;
        }
        visited[u] = true;
        for(auto [v, w] : adj[u]) {
            if(visited[v] == true or dist[u] + w >= dist[v]) {
                continue;
            }

            dist[v] = dist[u] + w;
            pq.emplace(-dist[v], v);
        }
    }

    int q;
    cin >> q;
    for(int i = 1; i <= q; i++) {
        int s, t;
        cin >> s >> t;
        path[s].insert(i);
        path[t].insert(i);
    }

    vector <tuple <int, int, int>> edge;
    for(int i = 1; i <= n; i++) {
        parent[i] = i;
    }
    for(int i = 1; i <= m; i++) {
        edge.emplace_back(min(dist[A[i]], dist[B[i]]), A[i], B[i]);
    }

    sort(edge.rbegin(), edge.rend());
    for(auto [w, a, b] : edge) {
        int u = root(a), v = root(b);
        if(u == v) {
            continue;
        }

        if(path[u].size() < path[v].size()) {
            swap(u, v);
        }
        for(auto i : path[v]) {
            if(path[u].count(i)) {
                ans[i] = w;
                path[u].erase(i);
            }
            else {
                path[u].insert(i);
            }
        }
        parent[v] = u;
    }

    for(int i = 1; i <= q; i++) {
        cout << ans[i] << '\n';
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 7 ms 7508 KB Output is correct
3 Correct 5 ms 7592 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 5 ms 7508 KB Output is correct
6 Correct 7 ms 7508 KB Output is correct
7 Correct 8 ms 7380 KB Output is correct
8 Correct 4 ms 7368 KB Output is correct
9 Correct 5 ms 7476 KB Output is correct
10 Correct 5 ms 7508 KB Output is correct
11 Correct 4 ms 7508 KB Output is correct
12 Correct 6 ms 7548 KB Output is correct
13 Correct 5 ms 7508 KB Output is correct
14 Correct 6 ms 7508 KB Output is correct
15 Correct 5 ms 7508 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 7 ms 7508 KB Output is correct
3 Correct 5 ms 7592 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 5 ms 7508 KB Output is correct
6 Correct 7 ms 7508 KB Output is correct
7 Correct 8 ms 7380 KB Output is correct
8 Correct 4 ms 7368 KB Output is correct
9 Correct 5 ms 7476 KB Output is correct
10 Correct 5 ms 7508 KB Output is correct
11 Correct 4 ms 7508 KB Output is correct
12 Correct 6 ms 7548 KB Output is correct
13 Correct 5 ms 7508 KB Output is correct
14 Correct 6 ms 7508 KB Output is correct
15 Correct 5 ms 7508 KB Output is correct
16 Correct 230 ms 24432 KB Output is correct
17 Correct 634 ms 52316 KB Output is correct
18 Correct 50 ms 11592 KB Output is correct
19 Correct 202 ms 28744 KB Output is correct
20 Correct 616 ms 54172 KB Output is correct
21 Correct 386 ms 36960 KB Output is correct
22 Correct 159 ms 26944 KB Output is correct
23 Correct 651 ms 54088 KB Output is correct
24 Correct 662 ms 54156 KB Output is correct
25 Correct 643 ms 54184 KB Output is correct
26 Correct 193 ms 28472 KB Output is correct
27 Correct 188 ms 28544 KB Output is correct
28 Correct 198 ms 28476 KB Output is correct
29 Correct 182 ms 28736 KB Output is correct
30 Correct 204 ms 28728 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 21664 KB Output is correct
2 Correct 445 ms 42236 KB Output is correct
3 Correct 458 ms 42124 KB Output is correct
4 Correct 69 ms 15432 KB Output is correct
5 Correct 418 ms 42196 KB Output is correct
6 Correct 374 ms 42172 KB Output is correct
7 Correct 402 ms 42232 KB Output is correct
8 Correct 381 ms 42172 KB Output is correct
9 Correct 387 ms 42176 KB Output is correct
10 Correct 364 ms 42116 KB Output is correct
11 Correct 376 ms 42264 KB Output is correct
12 Correct 363 ms 42176 KB Output is correct
13 Correct 375 ms 42228 KB Output is correct
14 Correct 376 ms 42176 KB Output is correct
15 Correct 388 ms 42996 KB Output is correct
16 Correct 358 ms 42204 KB Output is correct
17 Correct 410 ms 42304 KB Output is correct
18 Correct 371 ms 42112 KB Output is correct
19 Correct 57 ms 15412 KB Output is correct
20 Correct 385 ms 42128 KB Output is correct
21 Correct 355 ms 42336 KB Output is correct
22 Correct 81 ms 17808 KB Output is correct
23 Correct 63 ms 15868 KB Output is correct
24 Correct 71 ms 17728 KB Output is correct
25 Correct 71 ms 17692 KB Output is correct
26 Correct 69 ms 15956 KB Output is correct
27 Correct 59 ms 15432 KB Output is correct
28 Correct 74 ms 17692 KB Output is correct
29 Correct 66 ms 15532 KB Output is correct
30 Correct 69 ms 17628 KB Output is correct
31 Correct 59 ms 15452 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 7 ms 7508 KB Output is correct
3 Correct 5 ms 7592 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 5 ms 7508 KB Output is correct
6 Correct 7 ms 7508 KB Output is correct
7 Correct 8 ms 7380 KB Output is correct
8 Correct 4 ms 7368 KB Output is correct
9 Correct 5 ms 7476 KB Output is correct
10 Correct 5 ms 7508 KB Output is correct
11 Correct 4 ms 7508 KB Output is correct
12 Correct 6 ms 7548 KB Output is correct
13 Correct 5 ms 7508 KB Output is correct
14 Correct 6 ms 7508 KB Output is correct
15 Correct 5 ms 7508 KB Output is correct
16 Correct 230 ms 24432 KB Output is correct
17 Correct 634 ms 52316 KB Output is correct
18 Correct 50 ms 11592 KB Output is correct
19 Correct 202 ms 28744 KB Output is correct
20 Correct 616 ms 54172 KB Output is correct
21 Correct 386 ms 36960 KB Output is correct
22 Correct 159 ms 26944 KB Output is correct
23 Correct 651 ms 54088 KB Output is correct
24 Correct 662 ms 54156 KB Output is correct
25 Correct 643 ms 54184 KB Output is correct
26 Correct 193 ms 28472 KB Output is correct
27 Correct 188 ms 28544 KB Output is correct
28 Correct 198 ms 28476 KB Output is correct
29 Correct 182 ms 28736 KB Output is correct
30 Correct 204 ms 28728 KB Output is correct
31 Correct 4 ms 7380 KB Output is correct
32 Correct 4 ms 7380 KB Output is correct
33 Correct 4 ms 7380 KB Output is correct
34 Correct 4 ms 7380 KB Output is correct
35 Correct 4 ms 7380 KB Output is correct
36 Correct 5 ms 7380 KB Output is correct
37 Correct 4 ms 7320 KB Output is correct
38 Correct 5 ms 7380 KB Output is correct
39 Correct 4 ms 7380 KB Output is correct
40 Correct 5 ms 7380 KB Output is correct
41 Correct 183 ms 21664 KB Output is correct
42 Correct 445 ms 42236 KB Output is correct
43 Correct 458 ms 42124 KB Output is correct
44 Correct 69 ms 15432 KB Output is correct
45 Correct 418 ms 42196 KB Output is correct
46 Correct 374 ms 42172 KB Output is correct
47 Correct 402 ms 42232 KB Output is correct
48 Correct 381 ms 42172 KB Output is correct
49 Correct 387 ms 42176 KB Output is correct
50 Correct 364 ms 42116 KB Output is correct
51 Correct 376 ms 42264 KB Output is correct
52 Correct 363 ms 42176 KB Output is correct
53 Correct 375 ms 42228 KB Output is correct
54 Correct 376 ms 42176 KB Output is correct
55 Correct 388 ms 42996 KB Output is correct
56 Correct 358 ms 42204 KB Output is correct
57 Correct 410 ms 42304 KB Output is correct
58 Correct 371 ms 42112 KB Output is correct
59 Correct 57 ms 15412 KB Output is correct
60 Correct 385 ms 42128 KB Output is correct
61 Correct 355 ms 42336 KB Output is correct
62 Correct 81 ms 17808 KB Output is correct
63 Correct 63 ms 15868 KB Output is correct
64 Correct 71 ms 17728 KB Output is correct
65 Correct 71 ms 17692 KB Output is correct
66 Correct 69 ms 15956 KB Output is correct
67 Correct 59 ms 15432 KB Output is correct
68 Correct 74 ms 17692 KB Output is correct
69 Correct 66 ms 15532 KB Output is correct
70 Correct 69 ms 17628 KB Output is correct
71 Correct 59 ms 15452 KB Output is correct
72 Correct 365 ms 39164 KB Output is correct
73 Correct 573 ms 54920 KB Output is correct
74 Correct 588 ms 54988 KB Output is correct
75 Correct 591 ms 55092 KB Output is correct
76 Correct 590 ms 54972 KB Output is correct
77 Correct 595 ms 54888 KB Output is correct
78 Correct 616 ms 54864 KB Output is correct
79 Correct 607 ms 54928 KB Output is correct
80 Correct 596 ms 54984 KB Output is correct
81 Correct 612 ms 54952 KB Output is correct
82 Correct 588 ms 55020 KB Output is correct
83 Correct 628 ms 54824 KB Output is correct
84 Correct 659 ms 54960 KB Output is correct
85 Correct 659 ms 55100 KB Output is correct
86 Correct 676 ms 54928 KB Output is correct
87 Correct 670 ms 54904 KB Output is correct
88 Correct 653 ms 54928 KB Output is correct
89 Correct 231 ms 29236 KB Output is correct
90 Correct 565 ms 54960 KB Output is correct
91 Correct 569 ms 55724 KB Output is correct
92 Correct 224 ms 30244 KB Output is correct
93 Correct 325 ms 55144 KB Output is correct
94 Correct 236 ms 30092 KB Output is correct
95 Correct 227 ms 30236 KB Output is correct
96 Correct 355 ms 59392 KB Output is correct
97 Correct 245 ms 31192 KB Output is correct
98 Correct 221 ms 30264 KB Output is correct
99 Correct 238 ms 31164 KB Output is correct
100 Correct 228 ms 30328 KB Output is correct