oj.uz

Submission #969847

# Submission time Handle Problem Language Result Execution time Memory
969847 2024-04-25T16:53:44 Z jadai007 Evacuation plan (IZhO18_plan) C++14
100 / 100
 400 ms 55776 KB 
// I
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,tune=native")

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 4 ms 11700 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 3 ms 11608 KB Output is correct
7 Correct 2 ms 11356 KB Output is correct
8 Correct 2 ms 11352 KB Output is correct
9 Correct 3 ms 11608 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 4 ms 11700 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 3 ms 11608 KB Output is correct
7 Correct 2 ms 11356 KB Output is correct
8 Correct 2 ms 11352 KB Output is correct
9 Correct 3 ms 11608 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 106 ms 31112 KB Output is correct
17 Correct 355 ms 55484 KB Output is correct
18 Correct 26 ms 16324 KB Output is correct
19 Correct 93 ms 33304 KB Output is correct
20 Correct 344 ms 55540 KB Output is correct
21 Correct 180 ms 37584 KB Output is correct
22 Correct 100 ms 34760 KB Output is correct
23 Correct 344 ms 55452 KB Output is correct
24 Correct 335 ms 55536 KB Output is correct
25 Correct 339 ms 55564 KB Output is correct
26 Correct 92 ms 33020 KB Output is correct
27 Correct 97 ms 33228 KB Output is correct
28 Correct 101 ms 33112 KB Output is correct
29 Correct 98 ms 33104 KB Output is correct
30 Correct 90 ms 33276 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 3 ms 11352 KB Output is correct
8 Correct 2 ms 11356 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 148 ms 36860 KB Output is correct
2 Correct 317 ms 55048 KB Output is correct
3 Correct 302 ms 55024 KB Output is correct
4 Correct 76 ms 32648 KB Output is correct
5 Correct 304 ms 55160 KB Output is correct
6 Correct 320 ms 55068 KB Output is correct
7 Correct 308 ms 55192 KB Output is correct
8 Correct 328 ms 55320 KB Output is correct
9 Correct 303 ms 55028 KB Output is correct
10 Correct 336 ms 55176 KB Output is correct
11 Correct 298 ms 54960 KB Output is correct
12 Correct 310 ms 55256 KB Output is correct
13 Correct 291 ms 55024 KB Output is correct
14 Correct 370 ms 55216 KB Output is correct
15 Correct 302 ms 55328 KB Output is correct
16 Correct 357 ms 55028 KB Output is correct
17 Correct 292 ms 55024 KB Output is correct
18 Correct 309 ms 55352 KB Output is correct
19 Correct 70 ms 33676 KB Output is correct
20 Correct 311 ms 55044 KB Output is correct
21 Correct 301 ms 54900 KB Output is correct
22 Correct 67 ms 32764 KB Output is correct
23 Correct 76 ms 31968 KB Output is correct
24 Correct 68 ms 32844 KB Output is correct
25 Correct 66 ms 32852 KB Output is correct
26 Correct 83 ms 32140 KB Output is correct
27 Correct 74 ms 33620 KB Output is correct
28 Correct 66 ms 32800 KB Output is correct
29 Correct 81 ms 33580 KB Output is correct
30 Correct 65 ms 32764 KB Output is correct
31 Correct 72 ms 33276 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 4 ms 11700 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 3 ms 11608 KB Output is correct
7 Correct 2 ms 11356 KB Output is correct
8 Correct 2 ms 11352 KB Output is correct
9 Correct 3 ms 11608 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 106 ms 31112 KB Output is correct
17 Correct 355 ms 55484 KB Output is correct
18 Correct 26 ms 16324 KB Output is correct
19 Correct 93 ms 33304 KB Output is correct
20 Correct 344 ms 55540 KB Output is correct
21 Correct 180 ms 37584 KB Output is correct
22 Correct 100 ms 34760 KB Output is correct
23 Correct 344 ms 55452 KB Output is correct
24 Correct 335 ms 55536 KB Output is correct
25 Correct 339 ms 55564 KB Output is correct
26 Correct 92 ms 33020 KB Output is correct
27 Correct 97 ms 33228 KB Output is correct
28 Correct 101 ms 33112 KB Output is correct
29 Correct 98 ms 33104 KB Output is correct
30 Correct 90 ms 33276 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 3 ms 11352 KB Output is correct
38 Correct 2 ms 11356 KB Output is correct
39 Correct 2 ms 11356 KB Output is correct
40 Correct 2 ms 11356 KB Output is correct
41 Correct 148 ms 36860 KB Output is correct
42 Correct 317 ms 55048 KB Output is correct
43 Correct 302 ms 55024 KB Output is correct
44 Correct 76 ms 32648 KB Output is correct
45 Correct 304 ms 55160 KB Output is correct
46 Correct 320 ms 55068 KB Output is correct
47 Correct 308 ms 55192 KB Output is correct
48 Correct 328 ms 55320 KB Output is correct
49 Correct 303 ms 55028 KB Output is correct
50 Correct 336 ms 55176 KB Output is correct
51 Correct 298 ms 54960 KB Output is correct
52 Correct 310 ms 55256 KB Output is correct
53 Correct 291 ms 55024 KB Output is correct
54 Correct 370 ms 55216 KB Output is correct
55 Correct 302 ms 55328 KB Output is correct
56 Correct 357 ms 55028 KB Output is correct
57 Correct 292 ms 55024 KB Output is correct
58 Correct 309 ms 55352 KB Output is correct
59 Correct 70 ms 33676 KB Output is correct
60 Correct 311 ms 55044 KB Output is correct
61 Correct 301 ms 54900 KB Output is correct
62 Correct 67 ms 32764 KB Output is correct
63 Correct 76 ms 31968 KB Output is correct
64 Correct 68 ms 32844 KB Output is correct
65 Correct 66 ms 32852 KB Output is correct
66 Correct 83 ms 32140 KB Output is correct
67 Correct 74 ms 33620 KB Output is correct
68 Correct 66 ms 32800 KB Output is correct
69 Correct 81 ms 33580 KB Output is correct
70 Correct 65 ms 32764 KB Output is correct
71 Correct 72 ms 33276 KB Output is correct
72 Correct 192 ms 37276 KB Output is correct
73 Correct 367 ms 55760 KB Output is correct
74 Correct 339 ms 55396 KB Output is correct
75 Correct 365 ms 55436 KB Output is correct
76 Correct 382 ms 55368 KB Output is correct
77 Correct 354 ms 55456 KB Output is correct
78 Correct 336 ms 55532 KB Output is correct
79 Correct 357 ms 55540 KB Output is correct
80 Correct 344 ms 55528 KB Output is correct
81 Correct 349 ms 55612 KB Output is correct
82 Correct 337 ms 55536 KB Output is correct
83 Correct 371 ms 55404 KB Output is correct
84 Correct 400 ms 55776 KB Output is correct
85 Correct 371 ms 55724 KB Output is correct
86 Correct 351 ms 55544 KB Output is correct
87 Correct 336 ms 55536 KB Output is correct
88 Correct 348 ms 55648 KB Output is correct
89 Correct 145 ms 34048 KB Output is correct
90 Correct 345 ms 55544 KB Output is correct
91 Correct 315 ms 54976 KB Output is correct
92 Correct 97 ms 33148 KB Output is correct
93 Correct 137 ms 32668 KB Output is correct
94 Correct 95 ms 32916 KB Output is correct
95 Correct 114 ms 33016 KB Output is correct
96 Correct 124 ms 32028 KB Output is correct
97 Correct 171 ms 33416 KB Output is correct
98 Correct 95 ms 32916 KB Output is correct
99 Correct 136 ms 34064 KB Output is correct
100 Correct 130 ms 33076 KB Output is correct