oj.uz

Submission #536139

# Submission time Handle Problem Language Result Execution time Memory
536139 2022-03-12T12:48:46 Z ddy888 Evacuation plan (IZhO18_plan) C++17
100 / 100
 608 ms 114140 KB 
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long 
#define pb push_back
#define fi first
#define si second
#define ar array
typedef pair<int,int> pi;
typedef tuple<int,int,int> ti;  
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {cerr<<" "<<to_string(H);debug_out(T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)

struct edge {
    int u, v, c;
};

const int INF = 1e14;
int N, M, K, Q;
int toxic[100010], dist[100010];
vector<pi> adj[100010], tree[100010];
vector<edge> edges, proc;
priority_queue<pi, vector<pi>, greater<pi> > pq;

int par[100010];
int root(int x) { return (par[x]==x)? x:par[x]=root(par[x]); }
bool same(int a, int b) { return root(a) == root(b); }
void merge(int a, int b) {
    par[root(a)] = root(b);
}

void dijkstra() {
    while (pq.size()) {
        auto [d, x] = pq.top(); pq.pop();
        if (dist[x] != d) continue;
        for (auto i: adj[x]) {
            if (dist[i.fi] == -1 || dist[i.fi] > i.si + d) {
                dist[i.fi] = i.si + d;
                pq.push({dist[i.fi], i.fi});
            }
        }
    }
}

int twok[100010][20], depth[100010], mn[100010][20];

void dfs(int x, int par, int d, int pw) {
    twok[x][0] = par;
    depth[x] = d;
    for (int i = 1; i <= 17; i++) {
        if (twok[x][i-1] == -1) break;
        twok[x][i] = twok[twok[x][i-1]][i-1];
    }
    mn[x][0] = pw;
    for (int i = 1; i <= 17; i++) {
        if (twok[x][i-1] == -1) break;
        mn[x][i] = min(mn[x][i - 1], mn[twok[x][i-1]][i-1]);
    }
    for (auto it: tree[x]) {
        if (it.first != par) dfs(it.first,x,d+1,it.second);
    }
}

signed main() {
    fast;
    cin >> N >> M;
    for (int i = 0; i < M; ++i) {
        int u, v, c; cin >> u >> v >> c;
        edges.pb({u, v, c});
        adj[u].pb({v, c});
        adj[v].pb({u, c});
    }
    cin >> K;
    memset(dist, -1, sizeof dist);
    for (int i = 0; i < K; ++i) {
        int x; cin >> x;
        toxic[x] = 1;
        dist[x] = 0;
        pq.push({0, x});
    }
    dijkstra();

    for (int i = 1; i <= N; ++i) par[i] = i;
    for (auto i: edges) proc.pb({i.u, i.v, min(dist[i.u], dist[i.v])});
    sort(proc.begin(), proc.end(), [](edge a, edge b){return a.c > b.c;});
    for (auto i: proc) {
        if (same(i.u, i.v)) continue;
        tree[i.u].pb({i.v, i.c});
        tree[i.v].pb({i.u, i.c});
        merge(i.u, i.v);
    }

    memset(twok, -1, sizeof twok);
    dfs(1, -1, 0, 0);

    cin >> Q;
    while (Q--) {
        int a, b; cin >> a >> b; int ans = INF;
        if (depth[a] > depth[b]) swap(a,b);
        int dd = depth[b] - depth[a];
        for (int i = 0; i <= 17; i++) {
            if (dd & (1<<i)) {
                ans = min(ans,mn[b][i]);
                b = twok[b][i];
            }
        }
        if (a==b) {
            cout << ans << '\n';
            continue;
        }
        for (int i = 17; i >= 0; i--) {
            if (twok[a][i] != twok[b][i]) {
                ans = min(ans, mn[a][i]);
                ans = min(ans, mn[b][i]);
                a = twok[a][i];
                b = twok[b][i];
            }
        }
        ans = min(ans, mn[a][0]);
        ans = min(ans, mn[b][0]);
        cout << ans << '\n';
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21416 KB Output is correct
2 Correct 10 ms 21844 KB Output is correct
3 Correct 10 ms 21768 KB Output is correct
4 Correct 11 ms 21436 KB Output is correct
5 Correct 11 ms 21728 KB Output is correct
6 Correct 12 ms 21716 KB Output is correct
7 Correct 10 ms 21420 KB Output is correct
8 Correct 10 ms 21460 KB Output is correct
9 Correct 11 ms 21840 KB Output is correct
10 Correct 14 ms 21828 KB Output is correct
11 Correct 15 ms 21796 KB Output is correct
12 Correct 11 ms 21844 KB Output is correct
13 Correct 12 ms 21812 KB Output is correct
14 Correct 11 ms 21812 KB Output is correct
15 Correct 11 ms 21756 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21416 KB Output is correct
2 Correct 10 ms 21844 KB Output is correct
3 Correct 10 ms 21768 KB Output is correct
4 Correct 11 ms 21436 KB Output is correct
5 Correct 11 ms 21728 KB Output is correct
6 Correct 12 ms 21716 KB Output is correct
7 Correct 10 ms 21420 KB Output is correct
8 Correct 10 ms 21460 KB Output is correct
9 Correct 11 ms 21840 KB Output is correct
10 Correct 14 ms 21828 KB Output is correct
11 Correct 15 ms 21796 KB Output is correct
12 Correct 11 ms 21844 KB Output is correct
13 Correct 12 ms 21812 KB Output is correct
14 Correct 11 ms 21812 KB Output is correct
15 Correct 11 ms 21756 KB Output is correct
16 Correct 179 ms 52144 KB Output is correct
17 Correct 586 ms 112844 KB Output is correct
18 Correct 41 ms 30208 KB Output is correct
19 Correct 150 ms 57708 KB Output is correct
20 Correct 608 ms 112928 KB Output is correct
21 Correct 332 ms 72448 KB Output is correct
22 Correct 238 ms 61152 KB Output is correct
23 Correct 588 ms 112812 KB Output is correct
24 Correct 539 ms 113208 KB Output is correct
25 Correct 589 ms 113612 KB Output is correct
26 Correct 157 ms 58108 KB Output is correct
27 Correct 149 ms 57588 KB Output is correct
28 Correct 190 ms 58056 KB Output is correct
29 Correct 147 ms 57572 KB Output is correct
30 Correct 170 ms 57636 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21420 KB Output is correct
2 Correct 11 ms 21416 KB Output is correct
3 Correct 12 ms 21396 KB Output is correct
4 Correct 11 ms 21460 KB Output is correct
5 Correct 12 ms 21460 KB Output is correct
6 Correct 10 ms 21460 KB Output is correct
7 Correct 12 ms 21488 KB Output is correct
8 Correct 10 ms 21364 KB Output is correct
9 Correct 10 ms 21460 KB Output is correct
10 Correct 10 ms 21412 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 293 ms 69464 KB Output is correct
2 Correct 516 ms 111052 KB Output is correct
3 Correct 542 ms 111196 KB Output is correct
4 Correct 172 ms 57388 KB Output is correct
5 Correct 569 ms 111068 KB Output is correct
6 Correct 524 ms 111392 KB Output is correct
7 Correct 508 ms 111508 KB Output is correct
8 Correct 495 ms 111196 KB Output is correct
9 Correct 519 ms 111196 KB Output is correct
10 Correct 534 ms 111076 KB Output is correct
11 Correct 544 ms 111124 KB Output is correct
12 Correct 470 ms 111700 KB Output is correct
13 Correct 501 ms 111924 KB Output is correct
14 Correct 474 ms 111964 KB Output is correct
15 Correct 470 ms 112604 KB Output is correct
16 Correct 468 ms 111888 KB Output is correct
17 Correct 468 ms 111388 KB Output is correct
18 Correct 466 ms 111180 KB Output is correct
19 Correct 172 ms 58740 KB Output is correct
20 Correct 465 ms 111296 KB Output is correct
21 Correct 448 ms 111868 KB Output is correct
22 Correct 103 ms 55924 KB Output is correct
23 Correct 136 ms 55588 KB Output is correct
24 Correct 99 ms 56648 KB Output is correct
25 Correct 105 ms 55984 KB Output is correct
26 Correct 149 ms 56144 KB Output is correct
27 Correct 167 ms 58584 KB Output is correct
28 Correct 101 ms 56660 KB Output is correct
29 Correct 166 ms 57984 KB Output is correct
30 Correct 101 ms 56328 KB Output is correct
31 Correct 168 ms 57996 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21416 KB Output is correct
2 Correct 10 ms 21844 KB Output is correct
3 Correct 10 ms 21768 KB Output is correct
4 Correct 11 ms 21436 KB Output is correct
5 Correct 11 ms 21728 KB Output is correct
6 Correct 12 ms 21716 KB Output is correct
7 Correct 10 ms 21420 KB Output is correct
8 Correct 10 ms 21460 KB Output is correct
9 Correct 11 ms 21840 KB Output is correct
10 Correct 14 ms 21828 KB Output is correct
11 Correct 15 ms 21796 KB Output is correct
12 Correct 11 ms 21844 KB Output is correct
13 Correct 12 ms 21812 KB Output is correct
14 Correct 11 ms 21812 KB Output is correct
15 Correct 11 ms 21756 KB Output is correct
16 Correct 179 ms 52144 KB Output is correct
17 Correct 586 ms 112844 KB Output is correct
18 Correct 41 ms 30208 KB Output is correct
19 Correct 150 ms 57708 KB Output is correct
20 Correct 608 ms 112928 KB Output is correct
21 Correct 332 ms 72448 KB Output is correct
22 Correct 238 ms 61152 KB Output is correct
23 Correct 588 ms 112812 KB Output is correct
24 Correct 539 ms 113208 KB Output is correct
25 Correct 589 ms 113612 KB Output is correct
26 Correct 157 ms 58108 KB Output is correct
27 Correct 149 ms 57588 KB Output is correct
28 Correct 190 ms 58056 KB Output is correct
29 Correct 147 ms 57572 KB Output is correct
30 Correct 170 ms 57636 KB Output is correct
31 Correct 11 ms 21420 KB Output is correct
32 Correct 11 ms 21416 KB Output is correct
33 Correct 12 ms 21396 KB Output is correct
34 Correct 11 ms 21460 KB Output is correct
35 Correct 12 ms 21460 KB Output is correct
36 Correct 10 ms 21460 KB Output is correct
37 Correct 12 ms 21488 KB Output is correct
38 Correct 10 ms 21364 KB Output is correct
39 Correct 10 ms 21460 KB Output is correct
40 Correct 10 ms 21412 KB Output is correct
41 Correct 293 ms 69464 KB Output is correct
42 Correct 516 ms 111052 KB Output is correct
43 Correct 542 ms 111196 KB Output is correct
44 Correct 172 ms 57388 KB Output is correct
45 Correct 569 ms 111068 KB Output is correct
46 Correct 524 ms 111392 KB Output is correct
47 Correct 508 ms 111508 KB Output is correct
48 Correct 495 ms 111196 KB Output is correct
49 Correct 519 ms 111196 KB Output is correct
50 Correct 534 ms 111076 KB Output is correct
51 Correct 544 ms 111124 KB Output is correct
52 Correct 470 ms 111700 KB Output is correct
53 Correct 501 ms 111924 KB Output is correct
54 Correct 474 ms 111964 KB Output is correct
55 Correct 470 ms 112604 KB Output is correct
56 Correct 468 ms 111888 KB Output is correct
57 Correct 468 ms 111388 KB Output is correct
58 Correct 466 ms 111180 KB Output is correct
59 Correct 172 ms 58740 KB Output is correct
60 Correct 465 ms 111296 KB Output is correct
61 Correct 448 ms 111868 KB Output is correct
62 Correct 103 ms 55924 KB Output is correct
63 Correct 136 ms 55588 KB Output is correct
64 Correct 99 ms 56648 KB Output is correct
65 Correct 105 ms 55984 KB Output is correct
66 Correct 149 ms 56144 KB Output is correct
67 Correct 167 ms 58584 KB Output is correct
68 Correct 101 ms 56660 KB Output is correct
69 Correct 166 ms 57984 KB Output is correct
70 Correct 101 ms 56328 KB Output is correct
71 Correct 168 ms 57996 KB Output is correct
72 Correct 350 ms 71252 KB Output is correct
73 Correct 525 ms 112864 KB Output is correct
74 Correct 531 ms 112800 KB Output is correct
75 Correct 533 ms 112920 KB Output is correct
76 Correct 530 ms 113004 KB Output is correct
77 Correct 539 ms 113036 KB Output is correct
78 Correct 559 ms 112920 KB Output is correct
79 Correct 537 ms 112864 KB Output is correct
80 Correct 533 ms 112916 KB Output is correct
81 Correct 539 ms 113064 KB Output is correct
82 Correct 536 ms 113396 KB Output is correct
83 Correct 553 ms 113572 KB Output is correct
84 Correct 534 ms 113508 KB Output is correct
85 Correct 574 ms 114140 KB Output is correct
86 Correct 550 ms 113628 KB Output is correct
87 Correct 538 ms 113116 KB Output is correct
88 Correct 537 ms 112848 KB Output is correct
89 Correct 287 ms 60068 KB Output is correct
90 Correct 562 ms 112784 KB Output is correct
91 Correct 519 ms 113228 KB Output is correct
92 Correct 160 ms 57532 KB Output is correct
93 Correct 221 ms 57700 KB Output is correct
94 Correct 174 ms 58080 KB Output is correct
95 Correct 150 ms 57544 KB Output is correct
96 Correct 262 ms 57716 KB Output is correct
97 Correct 306 ms 59168 KB Output is correct
98 Correct 160 ms 58148 KB Output is correct
99 Correct 287 ms 60392 KB Output is correct
100 Correct 161 ms 57752 KB Output is correct