oj.uz

Submission #378594

# Submission time Handle Problem Language Result Execution time Memory
378594 2021-03-17T02:06:38 Z syl123456 Evacuation plan (IZhO18_plan) C++17
100 / 100
 629 ms 22620 KB 
#include <bits/stdc++.h>
#define all(i) i.begin(), i.end()
#define rall(i) i.rbegin(), i.rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
struct sq {
    int u, l, d, r;
    sq() = default;
    sq(int _u, int _l, int _d, int _r) : u(_u), l(_l), d(_d), r(_r) {}
};
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<vector<pi>> g(n);
    for (int i = 0; i < m; ++i) {
        int x, y, z;
        cin >> x >> y >> z;
        --x, --y;
        g[x].emplace_back(y, z), g[y].emplace_back(x, z);
    }
    int k;
    cin >> k;
    vector<int> dis(n, -1);
    priority_queue<pi, vector<pi>, greater<pi>> pq;
    for (int i = 0; i < k; ++i) {
        int x;
        cin >> x;
        --x;
        pq.emplace(0, x);
    }
    while (!pq.empty()) {
        int d = pq.top().first, i = pq.top().second;
        pq.pop();
        if (dis[i] != -1) continue;
        dis[i] = d;
        for (pi j : g[i]) if (dis[j.first] == -1)
            pq.emplace(d + j.second, j.first);
    }
    vector<int> ord(n);
    iota(all(ord), 0);
    sort(all(ord), [&](int i, int j){return dis[i] > dis[j] || dis[i] == dis[j] && i < j;});
    vector<pi> p(n, pi(-1, -1));
    vector<int> rank(n, -1);
    function<int(int)> find = [&](int i) {
        return p[i].first == -1 ? i : find(p[i].first);
    };
    for (int i : ord) {
        rank[i] = 0;
        int _t = dis[i];
        for (pi j : g[i]) if (~rank[j.first]) {
            int x = find(j.first);
            if (x == i) continue;
            if (rank[x] > rank[i]) p[i] = pi(x, _t), i = x;
            else if (rank[i] > rank[x]) p[x] = pi(i, _t);
            else p[x] = pi(i, _t), ++rank[i];
        }
    }
    int q;
    cin >> q;
    while (q--) {
        int s, t;
        cin >> s >> t;
        --s, --t;
        int ans = min(dis[s], dis[t]);
        while (p[s].second >= ans) s = p[s].first;
        while (p[t].second >= ans) t = p[t].first;
        while (s != t) {
            ans = max(p[s].second, p[t].second);
            while (p[s].second >= ans) s = p[s].first;
            while (p[t].second >= ans) t = p[t].first;
        }
        cout << ans << '\n';
    }
}
/*
 * dijkstra min dis(i, g) for every i
 * sort 321, add, get persistent dsu, rank, record time
 * for q : find max k that s-t connected, every time max(p[s], p[t]) till s = t
 */

Compilation message

plan.cpp: In lambda function:
plan.cpp:43:81: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   43 |     sort(all(ord), [&](int i, int j){return dis[i] > dis[j] || dis[i] == dis[j] && i < j;});

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 140 ms 8240 KB Output is correct
17 Correct 552 ms 21976 KB Output is correct
18 Correct 33 ms 2408 KB Output is correct
19 Correct 130 ms 9820 KB Output is correct
20 Correct 547 ms 21976 KB Output is correct
21 Correct 266 ms 12516 KB Output is correct
22 Correct 112 ms 8684 KB Output is correct
23 Correct 548 ms 22072 KB Output is correct
24 Correct 551 ms 21980 KB Output is correct
25 Correct 585 ms 21976 KB Output is correct
26 Correct 127 ms 9564 KB Output is correct
27 Correct 142 ms 9604 KB Output is correct
28 Correct 129 ms 9564 KB Output is correct
29 Correct 131 ms 9832 KB Output is correct
30 Correct 137 ms 9820 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 11996 KB Output is correct
2 Correct 513 ms 21468 KB Output is correct
3 Correct 514 ms 21464 KB Output is correct
4 Correct 79 ms 7788 KB Output is correct
5 Correct 511 ms 21592 KB Output is correct
6 Correct 522 ms 21596 KB Output is correct
7 Correct 522 ms 21588 KB Output is correct
8 Correct 528 ms 21720 KB Output is correct
9 Correct 543 ms 21592 KB Output is correct
10 Correct 506 ms 21544 KB Output is correct
11 Correct 522 ms 21596 KB Output is correct
12 Correct 511 ms 21720 KB Output is correct
13 Correct 523 ms 21532 KB Output is correct
14 Correct 536 ms 21596 KB Output is correct
15 Correct 507 ms 21592 KB Output is correct
16 Correct 535 ms 21848 KB Output is correct
17 Correct 542 ms 21464 KB Output is correct
18 Correct 521 ms 21488 KB Output is correct
19 Correct 74 ms 7788 KB Output is correct
20 Correct 517 ms 21464 KB Output is correct
21 Correct 504 ms 22616 KB Output is correct
22 Correct 114 ms 9308 KB Output is correct
23 Correct 90 ms 8300 KB Output is correct
24 Correct 101 ms 9308 KB Output is correct
25 Correct 99 ms 9308 KB Output is correct
26 Correct 97 ms 8428 KB Output is correct
27 Correct 74 ms 7788 KB Output is correct
28 Correct 96 ms 9308 KB Output is correct
29 Correct 79 ms 7788 KB Output is correct
30 Correct 100 ms 9308 KB Output is correct
31 Correct 82 ms 7788 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 140 ms 8240 KB Output is correct
17 Correct 552 ms 21976 KB Output is correct
18 Correct 33 ms 2408 KB Output is correct
19 Correct 130 ms 9820 KB Output is correct
20 Correct 547 ms 21976 KB Output is correct
21 Correct 266 ms 12516 KB Output is correct
22 Correct 112 ms 8684 KB Output is correct
23 Correct 548 ms 22072 KB Output is correct
24 Correct 551 ms 21980 KB Output is correct
25 Correct 585 ms 21976 KB Output is correct
26 Correct 127 ms 9564 KB Output is correct
27 Correct 142 ms 9604 KB Output is correct
28 Correct 129 ms 9564 KB Output is correct
29 Correct 131 ms 9832 KB Output is correct
30 Correct 137 ms 9820 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 220 ms 11996 KB Output is correct
42 Correct 513 ms 21468 KB Output is correct
43 Correct 514 ms 21464 KB Output is correct
44 Correct 79 ms 7788 KB Output is correct
45 Correct 511 ms 21592 KB Output is correct
46 Correct 522 ms 21596 KB Output is correct
47 Correct 522 ms 21588 KB Output is correct
48 Correct 528 ms 21720 KB Output is correct
49 Correct 543 ms 21592 KB Output is correct
50 Correct 506 ms 21544 KB Output is correct
51 Correct 522 ms 21596 KB Output is correct
52 Correct 511 ms 21720 KB Output is correct
53 Correct 523 ms 21532 KB Output is correct
54 Correct 536 ms 21596 KB Output is correct
55 Correct 507 ms 21592 KB Output is correct
56 Correct 535 ms 21848 KB Output is correct
57 Correct 542 ms 21464 KB Output is correct
58 Correct 521 ms 21488 KB Output is correct
59 Correct 74 ms 7788 KB Output is correct
60 Correct 517 ms 21464 KB Output is correct
61 Correct 504 ms 22616 KB Output is correct
62 Correct 114 ms 9308 KB Output is correct
63 Correct 90 ms 8300 KB Output is correct
64 Correct 101 ms 9308 KB Output is correct
65 Correct 99 ms 9308 KB Output is correct
66 Correct 97 ms 8428 KB Output is correct
67 Correct 74 ms 7788 KB Output is correct
68 Correct 96 ms 9308 KB Output is correct
69 Correct 79 ms 7788 KB Output is correct
70 Correct 100 ms 9308 KB Output is correct
71 Correct 82 ms 7788 KB Output is correct
72 Correct 254 ms 12388 KB Output is correct
73 Correct 547 ms 22104 KB Output is correct
74 Correct 533 ms 22104 KB Output is correct
75 Correct 569 ms 22164 KB Output is correct
76 Correct 588 ms 22156 KB Output is correct
77 Correct 537 ms 22104 KB Output is correct
78 Correct 540 ms 21976 KB Output is correct
79 Correct 589 ms 21972 KB Output is correct
80 Correct 625 ms 21972 KB Output is correct
81 Correct 584 ms 22044 KB Output is correct
82 Correct 597 ms 21888 KB Output is correct
83 Correct 599 ms 22004 KB Output is correct
84 Correct 629 ms 21852 KB Output is correct
85 Correct 568 ms 21980 KB Output is correct
86 Correct 539 ms 21976 KB Output is correct
87 Correct 581 ms 22060 KB Output is correct
88 Correct 552 ms 21976 KB Output is correct
89 Correct 109 ms 8940 KB Output is correct
90 Correct 556 ms 21972 KB Output is correct
91 Correct 531 ms 22620 KB Output is correct
92 Correct 143 ms 9692 KB Output is correct
93 Correct 126 ms 9068 KB Output is correct
94 Correct 131 ms 9600 KB Output is correct
95 Correct 126 ms 9820 KB Output is correct
96 Correct 137 ms 8812 KB Output is correct
97 Correct 106 ms 8376 KB Output is correct
98 Correct 143 ms 9648 KB Output is correct
99 Correct 103 ms 8300 KB Output is correct
100 Correct 133 ms 9820 KB Output is correct