oj.uz

Submission #642906

# Submission time Handle Problem Language Result Execution time Memory
642906 2022-09-20T18:36:21 Z KiriLL1ca Evacuation plan (IZhO18_plan) C++14
100 / 100
 533 ms 45232 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pw(x) (1ll << x)
#define sz(x) (int)((x).size())
#define pb push_back
#define endl '\n'
#define mp make_pair
#define vec vector

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

template <typename T> inline bool umin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template <typename T> inline bool umax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <typename T>
using oset = tree<T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

inline void solve () {
        int n, m; cin >> n >> m;
        vector <vector <pii>> g (n);
        vector <array <int, 3>> edge (m);
        for (int i = 0; i < m; ++i) {
                int u, v, w; cin >> u >> v >> w; --u, --v;
                g[u].pb({v, w}); g[v].pb({u, w}); edge[i] = {0, u, v};
        }
        int k; cin >> k;
        vector <int> hui (k);
        for (auto &i : hui) cin >> i, --i;

        priority_queue <pii, vector <pii>, greater <pii>> pq;
        vector <int> dist (n, 1e9);
        for (auto i : hui) {
                dist[i] = 0; pq.push({0, i});
        }

        while (sz(pq)) {
                auto [d, v] = pq.top(); pq.pop();
                if (dist[v] > d) continue;
                for (auto [u, w] : g[v]) {
                        if (dist[u] > d + w) {
                                dist[u] = d + w;
                                pq.push({dist[u], u});
                        }
                }
        }

        for (auto &[w, u, v] : edge) w = min(dist[u], dist[v]);
        sort(rall(edge));

        int q; cin >> q;
        vector <vector <pii>> qry (n);
        vector <int> ans (q);
        for (int i = 0; i < q; ++i) {
                int s, t; cin >> s >> t; --s, --t;
                qry[s].pb({t, i}); qry[t].pb({s, i});
        }

        vector <int> p (n); iota(all(p), 0);
        vector <vector <int>> sub (n); for (int i = 0; i < n; ++i) sub[i].pb(i);

        function <int(int)> par = [&] (int x) { return (p[x] != x ? p[x] = par(p[x]) : x); };
        auto unite = [&] (int x, int y, int cost) {
                x = par(x); y = par(y);
                if (x == y) return;
                if (sz(sub[x]) < sz(sub[y])) swap(x, y);
                for (auto u : sub[y]) {
                        for (auto [v, id] : qry[u]) {
                                if (par(v) == x) ans[id] = cost;
                        }
                        sub[x].pb(u);
                }
                p[y] = x; sub[y].clear();
        };

        for (auto [w, u, v] : edge) unite(u, v, w);
        for (auto i : ans) cout << i << endl;
}

signed main() {
        ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
        int t = 1; // cin >> t;
        while (t--) solve();
        return 0;
}

Compilation message

plan.cpp: In function 'void solve()':
plan.cpp:47:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   47 |                 auto [d, v] = pq.top(); pq.pop();
      |                      ^
plan.cpp:49:27: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   49 |                 for (auto [u, w] : g[v]) {
      |                           ^
plan.cpp:57:20: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   57 |         for (auto &[w, u, v] : edge) w = min(dist[u], dist[v]);
      |                    ^
plan.cpp: In lambda function:
plan.cpp:77:35: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   77 |                         for (auto [v, id] : qry[u]) {
      |                                   ^
plan.cpp: In function 'void solve()':
plan.cpp:85:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   85 |         for (auto [w, u, v] : edge) unite(u, v, w);
      |                   ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 2 ms 536 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 476 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 524 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 2 ms 536 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 476 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 524 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 152 ms 21016 KB Output is correct
17 Correct 523 ms 45096 KB Output is correct
18 Correct 29 ms 4564 KB Output is correct
19 Correct 126 ms 25560 KB Output is correct
20 Correct 490 ms 45068 KB Output is correct
21 Correct 254 ms 29856 KB Output is correct
22 Correct 130 ms 23292 KB Output is correct
23 Correct 468 ms 44960 KB Output is correct
24 Correct 482 ms 45168 KB Output is correct
25 Correct 454 ms 45024 KB Output is correct
26 Correct 134 ms 25452 KB Output is correct
27 Correct 116 ms 25556 KB Output is correct
28 Correct 119 ms 25424 KB Output is correct
29 Correct 118 ms 25552 KB Output is correct
30 Correct 126 ms 25644 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 23928 KB Output is correct
2 Correct 438 ms 39728 KB Output is correct
3 Correct 400 ms 39756 KB Output is correct
4 Correct 87 ms 17964 KB Output is correct
5 Correct 398 ms 39744 KB Output is correct
6 Correct 454 ms 39716 KB Output is correct
7 Correct 415 ms 39720 KB Output is correct
8 Correct 393 ms 39876 KB Output is correct
9 Correct 423 ms 39688 KB Output is correct
10 Correct 402 ms 39880 KB Output is correct
11 Correct 422 ms 39744 KB Output is correct
12 Correct 385 ms 39716 KB Output is correct
13 Correct 394 ms 39716 KB Output is correct
14 Correct 403 ms 39792 KB Output is correct
15 Correct 391 ms 39868 KB Output is correct
16 Correct 421 ms 39760 KB Output is correct
17 Correct 419 ms 39764 KB Output is correct
18 Correct 387 ms 39704 KB Output is correct
19 Correct 69 ms 17864 KB Output is correct
20 Correct 404 ms 39688 KB Output is correct
21 Correct 365 ms 40228 KB Output is correct
22 Correct 97 ms 19716 KB Output is correct
23 Correct 93 ms 19728 KB Output is correct
24 Correct 77 ms 19700 KB Output is correct
25 Correct 84 ms 19696 KB Output is correct
26 Correct 118 ms 20156 KB Output is correct
27 Correct 80 ms 18044 KB Output is correct
28 Correct 79 ms 19664 KB Output is correct
29 Correct 73 ms 18032 KB Output is correct
30 Correct 73 ms 19588 KB Output is correct
31 Correct 79 ms 18112 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 2 ms 536 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 476 KB Output is correct
10 Correct 2 ms 464 KB Output is correct
11 Correct 2 ms 524 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 152 ms 21016 KB Output is correct
17 Correct 523 ms 45096 KB Output is correct
18 Correct 29 ms 4564 KB Output is correct
19 Correct 126 ms 25560 KB Output is correct
20 Correct 490 ms 45068 KB Output is correct
21 Correct 254 ms 29856 KB Output is correct
22 Correct 130 ms 23292 KB Output is correct
23 Correct 468 ms 44960 KB Output is correct
24 Correct 482 ms 45168 KB Output is correct
25 Correct 454 ms 45024 KB Output is correct
26 Correct 134 ms 25452 KB Output is correct
27 Correct 116 ms 25556 KB Output is correct
28 Correct 119 ms 25424 KB Output is correct
29 Correct 118 ms 25552 KB Output is correct
30 Correct 126 ms 25644 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 180 ms 23928 KB Output is correct
42 Correct 438 ms 39728 KB Output is correct
43 Correct 400 ms 39756 KB Output is correct
44 Correct 87 ms 17964 KB Output is correct
45 Correct 398 ms 39744 KB Output is correct
46 Correct 454 ms 39716 KB Output is correct
47 Correct 415 ms 39720 KB Output is correct
48 Correct 393 ms 39876 KB Output is correct
49 Correct 423 ms 39688 KB Output is correct
50 Correct 402 ms 39880 KB Output is correct
51 Correct 422 ms 39744 KB Output is correct
52 Correct 385 ms 39716 KB Output is correct
53 Correct 394 ms 39716 KB Output is correct
54 Correct 403 ms 39792 KB Output is correct
55 Correct 391 ms 39868 KB Output is correct
56 Correct 421 ms 39760 KB Output is correct
57 Correct 419 ms 39764 KB Output is correct
58 Correct 387 ms 39704 KB Output is correct
59 Correct 69 ms 17864 KB Output is correct
60 Correct 404 ms 39688 KB Output is correct
61 Correct 365 ms 40228 KB Output is correct
62 Correct 97 ms 19716 KB Output is correct
63 Correct 93 ms 19728 KB Output is correct
64 Correct 77 ms 19700 KB Output is correct
65 Correct 84 ms 19696 KB Output is correct
66 Correct 118 ms 20156 KB Output is correct
67 Correct 80 ms 18044 KB Output is correct
68 Correct 79 ms 19664 KB Output is correct
69 Correct 73 ms 18032 KB Output is correct
70 Correct 73 ms 19588 KB Output is correct
71 Correct 79 ms 18112 KB Output is correct
72 Correct 256 ms 29288 KB Output is correct
73 Correct 486 ms 45016 KB Output is correct
74 Correct 469 ms 45124 KB Output is correct
75 Correct 470 ms 45056 KB Output is correct
76 Correct 504 ms 45136 KB Output is correct
77 Correct 498 ms 45172 KB Output is correct
78 Correct 489 ms 45064 KB Output is correct
79 Correct 509 ms 45144 KB Output is correct
80 Correct 490 ms 45080 KB Output is correct
81 Correct 481 ms 45020 KB Output is correct
82 Correct 486 ms 45024 KB Output is correct
83 Correct 503 ms 44960 KB Output is correct
84 Correct 492 ms 45068 KB Output is correct
85 Correct 473 ms 45124 KB Output is correct
86 Correct 453 ms 45000 KB Output is correct
87 Correct 496 ms 45036 KB Output is correct
88 Correct 533 ms 45092 KB Output is correct
89 Correct 125 ms 23624 KB Output is correct
90 Correct 522 ms 45032 KB Output is correct
91 Correct 460 ms 45232 KB Output is correct
92 Correct 126 ms 24916 KB Output is correct
93 Correct 176 ms 25480 KB Output is correct
94 Correct 138 ms 24908 KB Output is correct
95 Correct 125 ms 24932 KB Output is correct
96 Correct 224 ms 25672 KB Output is correct
97 Correct 141 ms 23412 KB Output is correct
98 Correct 126 ms 24820 KB Output is correct
99 Correct 149 ms 23484 KB Output is correct
100 Correct 130 ms 24920 KB Output is correct