oj.uz

답안 #970427

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970427 2024-04-26T14:01:52 Z jadai007 Evacuation plan (IZhO18_plan) C++14
100 / 100
 385 ms 66032 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11352 KB Output is correct
2 Correct 3 ms 11588 KB Output is correct
3 Correct 3 ms 11584 KB Output is correct
4 Correct 2 ms 11352 KB Output is correct
5 Correct 3 ms 11612 KB Output is correct
6 Correct 3 ms 11612 KB Output is correct
7 Correct 2 ms 11356 KB Output is correct
8 Correct 3 ms 11612 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 11736 KB Output is correct
13 Correct 3 ms 11608 KB Output is correct
14 Correct 3 ms 11612 KB Output is correct
15 Correct 3 ms 11608 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11352 KB Output is correct
2 Correct 3 ms 11588 KB Output is correct
3 Correct 3 ms 11584 KB Output is correct
4 Correct 2 ms 11352 KB Output is correct
5 Correct 3 ms 11612 KB Output is correct
6 Correct 3 ms 11612 KB Output is correct
7 Correct 2 ms 11356 KB Output is correct
8 Correct 3 ms 11612 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 11736 KB Output is correct
13 Correct 3 ms 11608 KB Output is correct
14 Correct 3 ms 11612 KB Output is correct
15 Correct 3 ms 11608 KB Output is correct
16 Correct 105 ms 33800 KB Output is correct
17 Correct 372 ms 65140 KB Output is correct
18 Correct 27 ms 17032 KB Output is correct
19 Correct 98 ms 36012 KB Output is correct
20 Correct 343 ms 65076 KB Output is correct
21 Correct 175 ms 42752 KB Output is correct
22 Correct 103 ms 37604 KB Output is correct
23 Correct 371 ms 65056 KB Output is correct
24 Correct 358 ms 64752 KB Output is correct
25 Correct 350 ms 65016 KB Output is correct
26 Correct 91 ms 35836 KB Output is correct
27 Correct 97 ms 36024 KB Output is correct
28 Correct 104 ms 36160 KB Output is correct
29 Correct 95 ms 36024 KB Output is correct
30 Correct 96 ms 36024 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 11572 KB Output is correct
2 Correct 2 ms 11352 KB Output is correct
3 Correct 2 ms 11576 KB Output is correct
4 Correct 2 ms 11352 KB Output is correct
5 Correct 2 ms 11352 KB Output is correct
6 Correct 3 ms 11356 KB Output is correct
7 Correct 2 ms 11356 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

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 40156 KB Output is correct
2 Correct 320 ms 63988 KB Output is correct
3 Correct 293 ms 63220 KB Output is correct
4 Correct 74 ms 34400 KB Output is correct
5 Correct 316 ms 63116 KB Output is correct
6 Correct 298 ms 63476 KB Output is correct
7 Correct 307 ms 63148 KB Output is correct
8 Correct 300 ms 63252 KB Output is correct
9 Correct 324 ms 63556 KB Output is correct
10 Correct 326 ms 63132 KB Output is correct
11 Correct 310 ms 63136 KB Output is correct
12 Correct 320 ms 63112 KB Output is correct
13 Correct 303 ms 63336 KB Output is correct
14 Correct 305 ms 63220 KB Output is correct
15 Correct 329 ms 64500 KB Output is correct
16 Correct 296 ms 63300 KB Output is correct
17 Correct 320 ms 63140 KB Output is correct
18 Correct 311 ms 63160 KB Output is correct
19 Correct 68 ms 35464 KB Output is correct
20 Correct 332 ms 63416 KB Output is correct
21 Correct 286 ms 63460 KB Output is correct
22 Correct 65 ms 34552 KB Output is correct
23 Correct 73 ms 33608 KB Output is correct
24 Correct 68 ms 34616 KB Output is correct
25 Correct 66 ms 34520 KB Output is correct
26 Correct 79 ms 33760 KB Output is correct
27 Correct 77 ms 35208 KB Output is correct
28 Correct 66 ms 34488 KB Output is correct
29 Correct 75 ms 34700 KB Output is correct
30 Correct 90 ms 34576 KB Output is correct
31 Correct 73 ms 34708 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11352 KB Output is correct
2 Correct 3 ms 11588 KB Output is correct
3 Correct 3 ms 11584 KB Output is correct
4 Correct 2 ms 11352 KB Output is correct
5 Correct 3 ms 11612 KB Output is correct
6 Correct 3 ms 11612 KB Output is correct
7 Correct 2 ms 11356 KB Output is correct
8 Correct 3 ms 11612 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 11736 KB Output is correct
13 Correct 3 ms 11608 KB Output is correct
14 Correct 3 ms 11612 KB Output is correct
15 Correct 3 ms 11608 KB Output is correct
16 Correct 105 ms 33800 KB Output is correct
17 Correct 372 ms 65140 KB Output is correct
18 Correct 27 ms 17032 KB Output is correct
19 Correct 98 ms 36012 KB Output is correct
20 Correct 343 ms 65076 KB Output is correct
21 Correct 175 ms 42752 KB Output is correct
22 Correct 103 ms 37604 KB Output is correct
23 Correct 371 ms 65056 KB Output is correct
24 Correct 358 ms 64752 KB Output is correct
25 Correct 350 ms 65016 KB Output is correct
26 Correct 91 ms 35836 KB Output is correct
27 Correct 97 ms 36024 KB Output is correct
28 Correct 104 ms 36160 KB Output is correct
29 Correct 95 ms 36024 KB Output is correct
30 Correct 96 ms 36024 KB Output is correct
31 Correct 3 ms 11572 KB Output is correct
32 Correct 2 ms 11352 KB Output is correct
33 Correct 2 ms 11576 KB Output is correct
34 Correct 2 ms 11352 KB Output is correct
35 Correct 2 ms 11352 KB Output is correct
36 Correct 3 ms 11356 KB Output is correct
37 Correct 2 ms 11356 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 149 ms 40156 KB Output is correct
42 Correct 320 ms 63988 KB Output is correct
43 Correct 293 ms 63220 KB Output is correct
44 Correct 74 ms 34400 KB Output is correct
45 Correct 316 ms 63116 KB Output is correct
46 Correct 298 ms 63476 KB Output is correct
47 Correct 307 ms 63148 KB Output is correct
48 Correct 300 ms 63252 KB Output is correct
49 Correct 324 ms 63556 KB Output is correct
50 Correct 326 ms 63132 KB Output is correct
51 Correct 310 ms 63136 KB Output is correct
52 Correct 320 ms 63112 KB Output is correct
53 Correct 303 ms 63336 KB Output is correct
54 Correct 305 ms 63220 KB Output is correct
55 Correct 329 ms 64500 KB Output is correct
56 Correct 296 ms 63300 KB Output is correct
57 Correct 320 ms 63140 KB Output is correct
58 Correct 311 ms 63160 KB Output is correct
59 Correct 68 ms 35464 KB Output is correct
60 Correct 332 ms 63416 KB Output is correct
61 Correct 286 ms 63460 KB Output is correct
62 Correct 65 ms 34552 KB Output is correct
63 Correct 73 ms 33608 KB Output is correct
64 Correct 68 ms 34616 KB Output is correct
65 Correct 66 ms 34520 KB Output is correct
66 Correct 79 ms 33760 KB Output is correct
67 Correct 77 ms 35208 KB Output is correct
68 Correct 66 ms 34488 KB Output is correct
69 Correct 75 ms 34700 KB Output is correct
70 Correct 90 ms 34576 KB Output is correct
71 Correct 73 ms 34708 KB Output is correct
72 Correct 212 ms 42168 KB Output is correct
73 Correct 341 ms 64756 KB Output is correct
74 Correct 358 ms 64864 KB Output is correct
75 Correct 347 ms 64776 KB Output is correct
76 Correct 355 ms 65472 KB Output is correct
77 Correct 340 ms 64752 KB Output is correct
78 Correct 377 ms 64932 KB Output is correct
79 Correct 360 ms 64756 KB Output is correct
80 Correct 349 ms 64976 KB Output is correct
81 Correct 349 ms 64780 KB Output is correct
82 Correct 385 ms 64888 KB Output is correct
83 Correct 345 ms 64744 KB Output is correct
84 Correct 359 ms 65264 KB Output is correct
85 Correct 333 ms 66032 KB Output is correct
86 Correct 368 ms 64756 KB Output is correct
87 Correct 334 ms 65052 KB Output is correct
88 Correct 343 ms 64780 KB Output is correct
89 Correct 149 ms 36880 KB Output is correct
90 Correct 357 ms 65084 KB Output is correct
91 Correct 336 ms 64756 KB Output is correct
92 Correct 97 ms 36132 KB Output is correct
93 Correct 131 ms 35728 KB Output is correct
94 Correct 98 ms 35888 KB Output is correct
95 Correct 95 ms 36092 KB Output is correct
96 Correct 124 ms 35036 KB Output is correct
97 Correct 146 ms 36260 KB Output is correct
98 Correct 104 ms 35832 KB Output is correct
99 Correct 130 ms 36928 KB Output is correct
100 Correct 97 ms 36080 KB Output is correct