oj.uz

Submission #947310

# Submission time Handle Problem Language Result Execution time Memory
947310 2024-03-15T21:30:13 Z AlphaMale06 Evacuation plan (IZhO18_plan) C++17
100 / 100
 388 ms 53064 KB 
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define F first
#define S second

const int N = 1e5+3;

vector<pair<int, pair<int, int>>> edges;
vector<pair<int, int>> adj[N], g[N];
int dist[N], mark[N], p[N], sz[N], tin[N], tout[N];
int up[N][17], cost[N][17];
int timer=-1;

int find(int v){
    if(p[v]==v)return v;
    return p[v]=find(p[v]);
}

void merge(int u, int v){
    u=find(u);
    v=find(v);
    if(u==v)return;
    if(sz[u]<sz[v])swap(u, v);
    sz[u]+=sz[v];
    p[v]=u;
}

void dfs(int v, int par){
    tin[v]=++timer;
    for(int i=1; i<17; i++){
        up[v][i]=up[up[v][i-1]][i-1];
        cost[v][i]=min(cost[v][i-1], cost[up[v][i-1]][i-1]);
    }
    for(auto to : adj[v]){
        if(to.F!=par){
            up[to.F][0]=v;
            cost[to.F][0]=to.S;
            dfs(to.F, v);
        }
    }
    tout[v]=++timer;
}

bool isanc(int u, int v){
    if(tin[u]<=tin[v] && tout[u]>=tout[v])return 1;
    return 0;
}

int lca(int u, int v){
    if(isanc(v, u))swap(u, v);
    int mx=1e9;
    if(!isanc(u, v)){
        for(int i=16; i>=0; i--){
            if(!isanc(up[u][i], v)){
                mx=min(mx, cost[u][i]);
                u=up[u][i];
            }
        }
        mx=min(mx, cost[u][0]);
        u=up[u][0];
    }
    for(int i=16; i>=0; i--){
        if(!isanc(up[v][i], u)){
            mx=min(mx, cost[v][i]);
            v=up[v][i];
        }
    }
    mx=min(mx, cost[v][0]);
    return mx;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for(int i=0; i< m; i++){
        int a, b, c;
        cin >> a >> b >> c;
        g[a].pb({b, c});
        g[b].pb({a, c});
        edges.pb({c, {a, b}});
    }
    int k;
    cin >> k;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    for(int i=0; i<=n; i++)dist[i]=1e9;
    for(int i=0; i< k; i++){
        int a;
        cin >> a;
        pq.push({0, a});
        dist[a]=0;
    }
    while(pq.size()){
        auto pr = pq.top();
        pq.pop();
        int v = pr.S;
        if(mark[v])continue;
        mark[v]=1;
        for(auto to : g[v]){
            if(mark[to.F])continue;
            if(to.S+pr.F < dist[to.F]){
                dist[to.F]=to.S+pr.F;
                pq.push({dist[to.F], to.F});
            }
        }
    }
    for(auto & e : edges){
        e.F = min(dist[e.S.F], dist[e.S.S]);
    }
    sort(edges.begin(), edges.end());
    reverse(edges.begin(), edges.end());
    for(int i=1; i<=n; i++){
        p[i]=i;
        sz[i]=1;
    }
    for(auto e : edges){
        if(find(e.S.F)!=find(e.S.S)){
            merge(e.S.F, e.S.S);
            adj[e.S.F].pb({e.S.S, e.F});
            adj[e.S.S].pb({e.S.F, e.F});
        }
    }
    up[1][0]=1;
    cost[1][0]=1e9;
    dfs(1, 0);
    int q;
    cin >> q;
    while(q--){
        int a, b;
        cin >> a >> b;
        cout << lca(a, b) << '\n';
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10332 KB Output is correct
2 Correct 3 ms 10392 KB Output is correct
3 Correct 3 ms 10332 KB Output is correct
4 Correct 3 ms 10332 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 6 ms 10576 KB Output is correct
7 Correct 2 ms 10332 KB Output is correct
8 Correct 2 ms 10332 KB Output is correct
9 Correct 3 ms 10332 KB Output is correct
10 Correct 3 ms 10328 KB Output is correct
11 Correct 4 ms 10332 KB Output is correct
12 Correct 3 ms 10332 KB Output is correct
13 Correct 3 ms 10380 KB Output is correct
14 Correct 3 ms 10332 KB Output is correct
15 Correct 3 ms 10384 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10332 KB Output is correct
2 Correct 3 ms 10392 KB Output is correct
3 Correct 3 ms 10332 KB Output is correct
4 Correct 3 ms 10332 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 6 ms 10576 KB Output is correct
7 Correct 2 ms 10332 KB Output is correct
8 Correct 2 ms 10332 KB Output is correct
9 Correct 3 ms 10332 KB Output is correct
10 Correct 3 ms 10328 KB Output is correct
11 Correct 4 ms 10332 KB Output is correct
12 Correct 3 ms 10332 KB Output is correct
13 Correct 3 ms 10380 KB Output is correct
14 Correct 3 ms 10332 KB Output is correct
15 Correct 3 ms 10384 KB Output is correct
16 Correct 109 ms 31532 KB Output is correct
17 Correct 365 ms 52032 KB Output is correct
18 Correct 25 ms 15372 KB Output is correct
19 Correct 98 ms 33392 KB Output is correct
20 Correct 355 ms 51932 KB Output is correct
21 Correct 178 ms 37888 KB Output is correct
22 Correct 116 ms 39404 KB Output is correct
23 Correct 368 ms 51524 KB Output is correct
24 Correct 324 ms 51700 KB Output is correct
25 Correct 354 ms 51612 KB Output is correct
26 Correct 90 ms 33244 KB Output is correct
27 Correct 94 ms 33408 KB Output is correct
28 Correct 111 ms 33376 KB Output is correct
29 Correct 92 ms 33372 KB Output is correct
30 Correct 103 ms 33468 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10332 KB Output is correct
2 Correct 2 ms 10332 KB Output is correct
3 Correct 3 ms 10332 KB Output is correct
4 Correct 3 ms 10588 KB Output is correct
5 Correct 2 ms 10372 KB Output is correct
6 Correct 2 ms 10332 KB Output is correct
7 Correct 2 ms 10332 KB Output is correct
8 Correct 2 ms 10160 KB Output is correct
9 Correct 2 ms 10332 KB Output is correct
10 Correct 2 ms 10328 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 33276 KB Output is correct
2 Correct 315 ms 50420 KB Output is correct
3 Correct 359 ms 50080 KB Output is correct
4 Correct 79 ms 34572 KB Output is correct
5 Correct 356 ms 50168 KB Output is correct
6 Correct 302 ms 50172 KB Output is correct
7 Correct 304 ms 50144 KB Output is correct
8 Correct 336 ms 50160 KB Output is correct
9 Correct 305 ms 50216 KB Output is correct
10 Correct 302 ms 50224 KB Output is correct
11 Correct 341 ms 50292 KB Output is correct
12 Correct 305 ms 50220 KB Output is correct
13 Correct 356 ms 50512 KB Output is correct
14 Correct 295 ms 50168 KB Output is correct
15 Correct 341 ms 50588 KB Output is correct
16 Correct 318 ms 50228 KB Output is correct
17 Correct 358 ms 50264 KB Output is correct
18 Correct 287 ms 50164 KB Output is correct
19 Correct 79 ms 37148 KB Output is correct
20 Correct 308 ms 50224 KB Output is correct
21 Correct 294 ms 50420 KB Output is correct
22 Correct 63 ms 32116 KB Output is correct
23 Correct 82 ms 31492 KB Output is correct
24 Correct 70 ms 32116 KB Output is correct
25 Correct 65 ms 32036 KB Output is correct
26 Correct 90 ms 32256 KB Output is correct
27 Correct 87 ms 36780 KB Output is correct
28 Correct 70 ms 32028 KB Output is correct
29 Correct 81 ms 35484 KB Output is correct
30 Correct 67 ms 32120 KB Output is correct
31 Correct 76 ms 35584 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10332 KB Output is correct
2 Correct 3 ms 10392 KB Output is correct
3 Correct 3 ms 10332 KB Output is correct
4 Correct 3 ms 10332 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 6 ms 10576 KB Output is correct
7 Correct 2 ms 10332 KB Output is correct
8 Correct 2 ms 10332 KB Output is correct
9 Correct 3 ms 10332 KB Output is correct
10 Correct 3 ms 10328 KB Output is correct
11 Correct 4 ms 10332 KB Output is correct
12 Correct 3 ms 10332 KB Output is correct
13 Correct 3 ms 10380 KB Output is correct
14 Correct 3 ms 10332 KB Output is correct
15 Correct 3 ms 10384 KB Output is correct
16 Correct 109 ms 31532 KB Output is correct
17 Correct 365 ms 52032 KB Output is correct
18 Correct 25 ms 15372 KB Output is correct
19 Correct 98 ms 33392 KB Output is correct
20 Correct 355 ms 51932 KB Output is correct
21 Correct 178 ms 37888 KB Output is correct
22 Correct 116 ms 39404 KB Output is correct
23 Correct 368 ms 51524 KB Output is correct
24 Correct 324 ms 51700 KB Output is correct
25 Correct 354 ms 51612 KB Output is correct
26 Correct 90 ms 33244 KB Output is correct
27 Correct 94 ms 33408 KB Output is correct
28 Correct 111 ms 33376 KB Output is correct
29 Correct 92 ms 33372 KB Output is correct
30 Correct 103 ms 33468 KB Output is correct
31 Correct 2 ms 10332 KB Output is correct
32 Correct 2 ms 10332 KB Output is correct
33 Correct 3 ms 10332 KB Output is correct
34 Correct 3 ms 10588 KB Output is correct
35 Correct 2 ms 10372 KB Output is correct
36 Correct 2 ms 10332 KB Output is correct
37 Correct 2 ms 10332 KB Output is correct
38 Correct 2 ms 10160 KB Output is correct
39 Correct 2 ms 10332 KB Output is correct
40 Correct 2 ms 10328 KB Output is correct
41 Correct 150 ms 33276 KB Output is correct
42 Correct 315 ms 50420 KB Output is correct
43 Correct 359 ms 50080 KB Output is correct
44 Correct 79 ms 34572 KB Output is correct
45 Correct 356 ms 50168 KB Output is correct
46 Correct 302 ms 50172 KB Output is correct
47 Correct 304 ms 50144 KB Output is correct
48 Correct 336 ms 50160 KB Output is correct
49 Correct 305 ms 50216 KB Output is correct
50 Correct 302 ms 50224 KB Output is correct
51 Correct 341 ms 50292 KB Output is correct
52 Correct 305 ms 50220 KB Output is correct
53 Correct 356 ms 50512 KB Output is correct
54 Correct 295 ms 50168 KB Output is correct
55 Correct 341 ms 50588 KB Output is correct
56 Correct 318 ms 50228 KB Output is correct
57 Correct 358 ms 50264 KB Output is correct
58 Correct 287 ms 50164 KB Output is correct
59 Correct 79 ms 37148 KB Output is correct
60 Correct 308 ms 50224 KB Output is correct
61 Correct 294 ms 50420 KB Output is correct
62 Correct 63 ms 32116 KB Output is correct
63 Correct 82 ms 31492 KB Output is correct
64 Correct 70 ms 32116 KB Output is correct
65 Correct 65 ms 32036 KB Output is correct
66 Correct 90 ms 32256 KB Output is correct
67 Correct 87 ms 36780 KB Output is correct
68 Correct 70 ms 32028 KB Output is correct
69 Correct 81 ms 35484 KB Output is correct
70 Correct 67 ms 32120 KB Output is correct
71 Correct 76 ms 35584 KB Output is correct
72 Correct 210 ms 37700 KB Output is correct
73 Correct 348 ms 51700 KB Output is correct
74 Correct 365 ms 51544 KB Output is correct
75 Correct 347 ms 51512 KB Output is correct
76 Correct 328 ms 51596 KB Output is correct
77 Correct 345 ms 51700 KB Output is correct
78 Correct 360 ms 51516 KB Output is correct
79 Correct 361 ms 51528 KB Output is correct
80 Correct 358 ms 51676 KB Output is correct
81 Correct 344 ms 51700 KB Output is correct
82 Correct 330 ms 51500 KB Output is correct
83 Correct 331 ms 52208 KB Output is correct
84 Correct 370 ms 52824 KB Output is correct
85 Correct 388 ms 53064 KB Output is correct
86 Correct 370 ms 52840 KB Output is correct
87 Correct 326 ms 52984 KB Output is correct
88 Correct 361 ms 52896 KB Output is correct
89 Correct 144 ms 38064 KB Output is correct
90 Correct 358 ms 52896 KB Output is correct
91 Correct 330 ms 52836 KB Output is correct
92 Correct 96 ms 33648 KB Output is correct
93 Correct 134 ms 33796 KB Output is correct
94 Correct 91 ms 33448 KB Output is correct
95 Correct 107 ms 33656 KB Output is correct
96 Correct 130 ms 33028 KB Output is correct
97 Correct 151 ms 36868 KB Output is correct
98 Correct 112 ms 33656 KB Output is correct
99 Correct 156 ms 38660 KB Output is correct
100 Correct 90 ms 33656 KB Output is correct