oj.uz

Submission #969807

# Submission time Handle Problem Language Result Execution time Memory
969807 2024-04-25T15:50:18 Z jadai007 Evacuation plan (IZhO18_plan) C++14
100 / 100
 366 ms 56044 KB 
#include<bits/stdc++.h>

using namespace std;

struct graph{
    int u, w;
    bool operator<(const graph&d2)const{
        return w > d2.w;
    }
};

vector<pair<int, int>> vc[100100], tree[100100];
int n,m,u,v,w, k, dis[100100], pa[100100], parent[100100][20], dp[100100][20], depth[100100];
priority_queue<graph> pq;
vector<tuple<int, int, int>> f_edge, edge;

int fp(int n){
    if(pa[n] == n) return n;
    return pa[n] = fp(pa[n]);
}

void dfs(int u, int pa){
    for(auto x:tree[u]){
        int v = x.first, w = x.second;
        if(v == pa) continue;
        parent[v][0] = u;
        dp[v][0] = w;
        depth[v] = depth[u] + 1;
        dfs(v, u);
    }
}

int cal(int u, int v){
    if(depth[u] > depth[v]) swap(u, v);
    int k = depth[v] - depth[u], mn = 1e9;
    for(int i = 0; i<=17; ++i){
        if(k&(1<<i)){
           mn = min(mn, dp[v][i]);
           v = parent[v][i];
        }
    }
    if(u == v) return mn;
    for(int i = 17; i>=0; --i){
        if(parent[u][i]!=parent[v][i]){
            mn = min({mn, dp[u][i], dp[v][i]});
            u = parent[u][i];
            v = parent[v][i];
        }
    }
    return min({mn, dp[u][0], dp[v][0]});
}

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> m;
    for(int i = 1; i<=n; ++i) for(int j = 0; j<=17; ++j) dp[i][j] = 1e9;
    for(int i = 0; i<m; ++i){
        cin >> u >> v >> w;
        f_edge.emplace_back(u, v, w);
        vc[u].emplace_back(v, w);
        vc[v].emplace_back(u, w);
    }
    for(int i = 1; i<=n; ++i) dis[i] = 1e9;
    for(int i = 1; i<=n; ++i) pa[i] = i;
    cin >> k;
    for(int i = 1; i<=k; ++i){
        int u; cin >> u;
        dis[u] = 0;
        pq.push({u, dis[u]});
    }
    while(!pq.empty()){
        int u = pq.top().u, w = pq.top().w; pq.pop();
        if(dis[u] < w) continue;
        for(auto x:vc[u]){
            int v = x.first, ww = x.second;
            if(dis[v] > w+ww){
                dis[v] = w+ww;
                pq.push({v, dis[v]});
            }
        }
    }
    for(auto x:f_edge){
        int u = get<0>(x), v = get<1>(x);
        edge.emplace_back(min(dis[u], dis[v]), u, v);
    }
    sort(edge.begin(), edge.end());
    reverse(edge.begin(), edge.end());
    for(auto x:edge){
        int w = get<0>(x), u = get<1>(x), v = get<2>(x);
        if(fp(u)!=fp(v)){
            tree[u].emplace_back(v, w);
            tree[v].emplace_back(u, w);
            pa[fp(v)] = fp(u);
        }
    }
    dfs(1, -1);
    for(int j = 1; j<=17; ++j){
		for(int i = 1; i<=n; ++i){
			parent[i][j] = parent[parent[i][j-1]][j-1];
			dp[i][j] = min(dp[i][j-1], dp[parent[i][j-1]][j-1]);
		}
	}
    int q; cin >> q;
    while(q--){
        int u, v; cin >> u >> v;
        cout << cal(u, v) << '\n';
    }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11356 KB Output is correct
2 Correct 3 ms 11612 KB Output is correct
3 Correct 3 ms 11612 KB Output is correct
4 Correct 2 ms 11356 KB Output is correct
5 Correct 3 ms 11624 KB Output is correct
6 Correct 3 ms 11612 KB Output is correct
7 Correct 2 ms 11356 KB Output is correct
8 Correct 2 ms 11356 KB Output is correct
9 Correct 3 ms 11612 KB Output is correct
10 Correct 3 ms 11612 KB Output is correct
11 Correct 3 ms 11612 KB Output is correct
12 Correct 3 ms 11612 KB Output is correct
13 Correct 3 ms 11612 KB Output is correct
14 Correct 3 ms 11612 KB Output is correct
15 Correct 3 ms 11612 KB Output is correct
16 Correct 108 ms 31048 KB Output is correct
17 Correct 361 ms 55528 KB Output is correct
18 Correct 25 ms 16116 KB Output is correct
19 Correct 88 ms 33264 KB Output is correct
20 Correct 330 ms 55448 KB Output is correct
21 Correct 180 ms 37116 KB Output is correct
22 Correct 101 ms 37556 KB Output is correct
23 Correct 344 ms 55604 KB Output is correct
24 Correct 351 ms 55544 KB Output is correct
25 Correct 333 ms 55424 KB Output is correct
26 Correct 93 ms 33092 KB Output is correct
27 Correct 90 ms 33156 KB Output is correct
28 Correct 90 ms 33132 KB Output is correct
29 Correct 92 ms 33092 KB Output is correct
30 Correct 95 ms 33272 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 36588 KB Output is correct
2 Correct 292 ms 55280 KB Output is correct
3 Correct 300 ms 55080 KB Output is correct
4 Correct 80 ms 34444 KB Output is correct
5 Correct 290 ms 55024 KB Output is correct
6 Correct 284 ms 55416 KB Output is correct
7 Correct 307 ms 55032 KB Output is correct
8 Correct 309 ms 54960 KB Output is correct
9 Correct 289 ms 55072 KB Output is correct
10 Correct 303 ms 55388 KB Output is correct
11 Correct 297 ms 55168 KB Output is correct
12 Correct 315 ms 55276 KB Output is correct
13 Correct 278 ms 55032 KB Output is correct
14 Correct 301 ms 55024 KB Output is correct
15 Correct 336 ms 55280 KB Output is correct
16 Correct 320 ms 55208 KB Output is correct
17 Correct 295 ms 55280 KB Output is correct
18 Correct 328 ms 55028 KB Output is correct
19 Correct 78 ms 36328 KB Output is correct
20 Correct 294 ms 54968 KB Output is correct
21 Correct 287 ms 55300 KB Output is correct
22 Correct 63 ms 33012 KB Output is correct
23 Correct 71 ms 32140 KB Output is correct
24 Correct 64 ms 32824 KB Output is correct
25 Correct 63 ms 32792 KB Output is correct
26 Correct 80 ms 32664 KB Output is correct
27 Correct 86 ms 36240 KB Output is correct
28 Correct 63 ms 32968 KB Output is correct
29 Correct 78 ms 35372 KB Output is correct
30 Correct 63 ms 32860 KB Output is correct
31 Correct 81 ms 35204 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11356 KB Output is correct
2 Correct 3 ms 11612 KB Output is correct
3 Correct 3 ms 11612 KB Output is correct
4 Correct 2 ms 11356 KB Output is correct
5 Correct 3 ms 11624 KB Output is correct
6 Correct 3 ms 11612 KB Output is correct
7 Correct 2 ms 11356 KB Output is correct
8 Correct 2 ms 11356 KB Output is correct
9 Correct 3 ms 11612 KB Output is correct
10 Correct 3 ms 11612 KB Output is correct
11 Correct 3 ms 11612 KB Output is correct
12 Correct 3 ms 11612 KB Output is correct
13 Correct 3 ms 11612 KB Output is correct
14 Correct 3 ms 11612 KB Output is correct
15 Correct 3 ms 11612 KB Output is correct
16 Correct 108 ms 31048 KB Output is correct
17 Correct 361 ms 55528 KB Output is correct
18 Correct 25 ms 16116 KB Output is correct
19 Correct 88 ms 33264 KB Output is correct
20 Correct 330 ms 55448 KB Output is correct
21 Correct 180 ms 37116 KB Output is correct
22 Correct 101 ms 37556 KB Output is correct
23 Correct 344 ms 55604 KB Output is correct
24 Correct 351 ms 55544 KB Output is correct
25 Correct 333 ms 55424 KB Output is correct
26 Correct 93 ms 33092 KB Output is correct
27 Correct 90 ms 33156 KB Output is correct
28 Correct 90 ms 33132 KB Output is correct
29 Correct 92 ms 33092 KB Output is correct
30 Correct 95 ms 33272 KB Output is correct
31 Correct 2 ms 11352 KB Output is correct
32 Correct 2 ms 11356 KB Output is correct
33 Correct 2 ms 11356 KB Output is correct
34 Correct 2 ms 11356 KB Output is correct
35 Correct 2 ms 11608 KB Output is correct
36 Correct 2 ms 11356 KB Output is correct
37 Correct 3 ms 11356 KB Output is correct
38 Correct 2 ms 11356 KB Output is correct
39 Correct 2 ms 11352 KB Output is correct
40 Correct 2 ms 11556 KB Output is correct
41 Correct 137 ms 36588 KB Output is correct
42 Correct 292 ms 55280 KB Output is correct
43 Correct 300 ms 55080 KB Output is correct
44 Correct 80 ms 34444 KB Output is correct
45 Correct 290 ms 55024 KB Output is correct
46 Correct 284 ms 55416 KB Output is correct
47 Correct 307 ms 55032 KB Output is correct
48 Correct 309 ms 54960 KB Output is correct
49 Correct 289 ms 55072 KB Output is correct
50 Correct 303 ms 55388 KB Output is correct
51 Correct 297 ms 55168 KB Output is correct
52 Correct 315 ms 55276 KB Output is correct
53 Correct 278 ms 55032 KB Output is correct
54 Correct 301 ms 55024 KB Output is correct
55 Correct 336 ms 55280 KB Output is correct
56 Correct 320 ms 55208 KB Output is correct
57 Correct 295 ms 55280 KB Output is correct
58 Correct 328 ms 55028 KB Output is correct
59 Correct 78 ms 36328 KB Output is correct
60 Correct 294 ms 54968 KB Output is correct
61 Correct 287 ms 55300 KB Output is correct
62 Correct 63 ms 33012 KB Output is correct
63 Correct 71 ms 32140 KB Output is correct
64 Correct 64 ms 32824 KB Output is correct
65 Correct 63 ms 32792 KB Output is correct
66 Correct 80 ms 32664 KB Output is correct
67 Correct 86 ms 36240 KB Output is correct
68 Correct 63 ms 32968 KB Output is correct
69 Correct 78 ms 35372 KB Output is correct
70 Correct 63 ms 32860 KB Output is correct
71 Correct 81 ms 35204 KB Output is correct
72 Correct 193 ms 37256 KB Output is correct
73 Correct 329 ms 55380 KB Output is correct
74 Correct 350 ms 55452 KB Output is correct
75 Correct 336 ms 55796 KB Output is correct
76 Correct 336 ms 55536 KB Output is correct
77 Correct 346 ms 55368 KB Output is correct
78 Correct 355 ms 55912 KB Output is correct
79 Correct 331 ms 55544 KB Output is correct
80 Correct 325 ms 55772 KB Output is correct
81 Correct 337 ms 55428 KB Output is correct
82 Correct 344 ms 55676 KB Output is correct
83 Correct 333 ms 55796 KB Output is correct
84 Correct 345 ms 56044 KB Output is correct
85 Correct 332 ms 55792 KB Output is correct
86 Correct 352 ms 55808 KB Output is correct
87 Correct 325 ms 55536 KB Output is correct
88 Correct 366 ms 55744 KB Output is correct
89 Correct 146 ms 36204 KB Output is correct
90 Correct 347 ms 55544 KB Output is correct
91 Correct 323 ms 55000 KB Output is correct
92 Correct 97 ms 33128 KB Output is correct
93 Correct 132 ms 33196 KB Output is correct
94 Correct 92 ms 33020 KB Output is correct
95 Correct 96 ms 33084 KB Output is correct
96 Correct 124 ms 32496 KB Output is correct
97 Correct 143 ms 35088 KB Output is correct
98 Correct 121 ms 33088 KB Output is correct
99 Correct 137 ms 36736 KB Output is correct
100 Correct 100 ms 33228 KB Output is correct