oj.uz

Submission #969803

# Submission time Handle Problem Language Result Execution time Memory
969803 2024-04-25T15:48:51 Z vjudge1 Evacuation plan (IZhO18_plan) C++17
100 / 100
 382 ms 65268 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 11352 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 11612 KB Output is correct
6 Correct 4 ms 11904 KB Output is correct
7 Correct 3 ms 11352 KB Output is correct
8 Correct 2 ms 11352 KB Output is correct
9 Correct 3 ms 11612 KB Output is correct
10 Correct 3 ms 11576 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 11676 KB Output is correct
15 Correct 3 ms 11608 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11352 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 11612 KB Output is correct
6 Correct 4 ms 11904 KB Output is correct
7 Correct 3 ms 11352 KB Output is correct
8 Correct 2 ms 11352 KB Output is correct
9 Correct 3 ms 11612 KB Output is correct
10 Correct 3 ms 11576 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 11676 KB Output is correct
15 Correct 3 ms 11608 KB Output is correct
16 Correct 97 ms 33892 KB Output is correct
17 Correct 349 ms 65008 KB Output is correct
18 Correct 26 ms 16872 KB Output is correct
19 Correct 92 ms 36020 KB Output is correct
20 Correct 330 ms 65016 KB Output is correct
21 Correct 184 ms 42072 KB Output is correct
22 Correct 112 ms 40772 KB Output is correct
23 Correct 340 ms 64776 KB Output is correct
24 Correct 334 ms 64916 KB Output is correct
25 Correct 344 ms 64880 KB Output is correct
26 Correct 95 ms 35820 KB Output is correct
27 Correct 103 ms 36276 KB Output is correct
28 Correct 91 ms 35828 KB Output is correct
29 Correct 91 ms 36080 KB Output is correct
30 Correct 95 ms 36084 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11356 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 11356 KB Output is correct
6 Correct 2 ms 11356 KB Output is correct
7 Correct 2 ms 11356 KB Output is correct
8 Correct 2 ms 11564 KB Output is correct
9 Correct 2 ms 11356 KB Output is correct
10 Correct 2 ms 11356 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 37472 KB Output is correct
2 Correct 325 ms 63736 KB Output is correct
3 Correct 306 ms 63220 KB Output is correct
4 Correct 81 ms 35976 KB Output is correct
5 Correct 287 ms 63116 KB Output is correct
6 Correct 337 ms 63208 KB Output is correct
7 Correct 307 ms 63308 KB Output is correct
8 Correct 308 ms 63220 KB Output is correct
9 Correct 289 ms 63060 KB Output is correct
10 Correct 295 ms 63360 KB Output is correct
11 Correct 306 ms 63264 KB Output is correct
12 Correct 287 ms 63224 KB Output is correct
13 Correct 296 ms 63224 KB Output is correct
14 Correct 303 ms 63116 KB Output is correct
15 Correct 294 ms 63472 KB Output is correct
16 Correct 305 ms 63316 KB Output is correct
17 Correct 295 ms 63220 KB Output is correct
18 Correct 314 ms 63432 KB Output is correct
19 Correct 78 ms 38024 KB Output is correct
20 Correct 309 ms 63120 KB Output is correct
21 Correct 282 ms 63280 KB Output is correct
22 Correct 63 ms 34556 KB Output is correct
23 Correct 75 ms 33680 KB Output is correct
24 Correct 68 ms 34812 KB Output is correct
25 Correct 66 ms 34480 KB Output is correct
26 Correct 81 ms 34496 KB Output is correct
27 Correct 82 ms 37924 KB Output is correct
28 Correct 63 ms 34380 KB Output is correct
29 Correct 81 ms 37016 KB Output is correct
30 Correct 64 ms 34552 KB Output is correct
31 Correct 79 ms 37004 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11352 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 11612 KB Output is correct
6 Correct 4 ms 11904 KB Output is correct
7 Correct 3 ms 11352 KB Output is correct
8 Correct 2 ms 11352 KB Output is correct
9 Correct 3 ms 11612 KB Output is correct
10 Correct 3 ms 11576 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 11676 KB Output is correct
15 Correct 3 ms 11608 KB Output is correct
16 Correct 97 ms 33892 KB Output is correct
17 Correct 349 ms 65008 KB Output is correct
18 Correct 26 ms 16872 KB Output is correct
19 Correct 92 ms 36020 KB Output is correct
20 Correct 330 ms 65016 KB Output is correct
21 Correct 184 ms 42072 KB Output is correct
22 Correct 112 ms 40772 KB Output is correct
23 Correct 340 ms 64776 KB Output is correct
24 Correct 334 ms 64916 KB Output is correct
25 Correct 344 ms 64880 KB Output is correct
26 Correct 95 ms 35820 KB Output is correct
27 Correct 103 ms 36276 KB Output is correct
28 Correct 91 ms 35828 KB Output is correct
29 Correct 91 ms 36080 KB Output is correct
30 Correct 95 ms 36084 KB Output is correct
31 Correct 2 ms 11356 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 11356 KB Output is correct
36 Correct 2 ms 11356 KB Output is correct
37 Correct 2 ms 11356 KB Output is correct
38 Correct 2 ms 11564 KB Output is correct
39 Correct 2 ms 11356 KB Output is correct
40 Correct 2 ms 11356 KB Output is correct
41 Correct 152 ms 37472 KB Output is correct
42 Correct 325 ms 63736 KB Output is correct
43 Correct 306 ms 63220 KB Output is correct
44 Correct 81 ms 35976 KB Output is correct
45 Correct 287 ms 63116 KB Output is correct
46 Correct 337 ms 63208 KB Output is correct
47 Correct 307 ms 63308 KB Output is correct
48 Correct 308 ms 63220 KB Output is correct
49 Correct 289 ms 63060 KB Output is correct
50 Correct 295 ms 63360 KB Output is correct
51 Correct 306 ms 63264 KB Output is correct
52 Correct 287 ms 63224 KB Output is correct
53 Correct 296 ms 63224 KB Output is correct
54 Correct 303 ms 63116 KB Output is correct
55 Correct 294 ms 63472 KB Output is correct
56 Correct 305 ms 63316 KB Output is correct
57 Correct 295 ms 63220 KB Output is correct
58 Correct 314 ms 63432 KB Output is correct
59 Correct 78 ms 38024 KB Output is correct
60 Correct 309 ms 63120 KB Output is correct
61 Correct 282 ms 63280 KB Output is correct
62 Correct 63 ms 34556 KB Output is correct
63 Correct 75 ms 33680 KB Output is correct
64 Correct 68 ms 34812 KB Output is correct
65 Correct 66 ms 34480 KB Output is correct
66 Correct 81 ms 34496 KB Output is correct
67 Correct 82 ms 37924 KB Output is correct
68 Correct 63 ms 34380 KB Output is correct
69 Correct 81 ms 37016 KB Output is correct
70 Correct 64 ms 34552 KB Output is correct
71 Correct 79 ms 37004 KB Output is correct
72 Correct 180 ms 41976 KB Output is correct
73 Correct 330 ms 64984 KB Output is correct
74 Correct 325 ms 65008 KB Output is correct
75 Correct 333 ms 64916 KB Output is correct
76 Correct 335 ms 64984 KB Output is correct
77 Correct 342 ms 65012 KB Output is correct
78 Correct 332 ms 64756 KB Output is correct
79 Correct 332 ms 64840 KB Output is correct
80 Correct 328 ms 64756 KB Output is correct
81 Correct 348 ms 64952 KB Output is correct
82 Correct 328 ms 64760 KB Output is correct
83 Correct 361 ms 65124 KB Output is correct
84 Correct 348 ms 64752 KB Output is correct
85 Correct 329 ms 65268 KB Output is correct
86 Correct 337 ms 64812 KB Output is correct
87 Correct 374 ms 64840 KB Output is correct
88 Correct 382 ms 65016 KB Output is correct
89 Correct 175 ms 39148 KB Output is correct
90 Correct 360 ms 64848 KB Output is correct
91 Correct 353 ms 64756 KB Output is correct
92 Correct 100 ms 36152 KB Output is correct
93 Correct 129 ms 35992 KB Output is correct
94 Correct 119 ms 35888 KB Output is correct
95 Correct 110 ms 36128 KB Output is correct
96 Correct 148 ms 35376 KB Output is correct
97 Correct 170 ms 38260 KB Output is correct
98 Correct 123 ms 36000 KB Output is correct
99 Correct 157 ms 39560 KB Output is correct
100 Correct 112 ms 36024 KB Output is correct