oj.uz

Submission #392828

# Submission time Handle Problem Language Result Execution time Memory
392828 2021-04-21T21:18:16 Z knightron0 Evacuation plan (IZhO18_plan) C++14
100 / 100
 739 ms 119332 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define pii pair<int, int>
#define float long double

const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 1e5 + 5;

int n, m, k, l;
vector<pii> adj[MAXN];
vector<int> mst[MAXN];
int dist[MAXN], b[MAXN], up[MAXN][100], tout[MAXN], tin[MAXN], upmn[MAXN][100], depth[MAXN];
int timer = 0;

void dfs(int v, int p, int d = 0){
	timer++;
	tin[v] = timer;
	up[v][0] = p;
	upmn[v][0] = min(dist[v], dist[p]);
	for(int i=1;i<=l;i++){
		up[v][i] = up[up[v][i-1]][i-1];
		upmn[v][i] = min(upmn[up[v][i-1]][i-1], upmn[v][i-1]);
	}
	depth[v] = d;
	for(int u: mst[v]){
		if(u != p){
			dfs(u, v, d+1);
		}
	}
	timer++;
	tout[v] = timer;
}

bool isanc(int a, int b){
	return tin[a] <= tin[b] && tout[a] >= tout[b];
}
int lca(int u, int v){
	if(isanc(u, v)) return u;
	if(isanc(v, u)) return v;
	for(int i = l;i >= 0;i--){
        if(!isanc(up[u][i], v)){
            u = up[u][i];
        }
    }
    return up[u][0];
}

int getmn(int u, int kx){
	int ans = dist[u];
	for(int i= 0;i<=l;i++){
		if(kx & (1<<i)){
			ans = min(ans, upmn[u][i]);
			u = up[u][i];
		}
	}
	return ans;
}

void dstra(){
	for(int i=1;i<=n;i++){
		dist[i] = INF;
	}
	priority_queue<pii> pq;
	for(int j= 1;j<=k;j++){
		dist[b[j]] = 0;
		pq.push({0, b[j]});
	}
	while(!pq.empty()){
		int u = pq.top().sc;
		pq.pop();
		for(auto e: adj[u]){
			int w = e.sc, v = e.fr;
			if(dist[u]+w < dist[v]){
				dist[v] = dist[u] + w;
				pq.push({-dist[v], v});
			}
		}
	}
}


int parent[MAXN] = {-1};

void init(){
    for(int i= 1;i<=n;i++) parent[i] = i;
    timer = 0;
	clr(tout, 0);
	clr(tin, 0);
	l = ceil(log2(n));	
	clr(up, 0);
}

int find_set(int s){
    if(s == parent[s]){
        return s;
    }
    return parent[s] = find_set(parent[s]);
}

bool union_sets(int a, int b){
    a = find_set(a);
    b = find_set(b);
    if(a != b){
        parent[b] = a;
        return true;
    } else {
    	return false;
    }
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #endif
	cin>>n>>m;
	vector<pii> edges;
	for(int i=0;i<m;i++){
		int u, v, w;
		cin>>u>>v>>w;
		adj[u].pb({v, w});
		adj[v].pb({u, w});
		edges.pb({u, v});
	}
	cin>>k;
	for(int i= 1;i<=k;i++){
		cin>>b[i];
	}
	dstra();
	init();
	vector<pair<int, pii>> wedges;
	for(auto edge: edges){
		wedges.pb({min(dist[edge.fr], dist[edge.sc]), {edge}});
	}
	sort(all(wedges));
	reverse(all(wedges));
	for(auto edge: wedges){
		int u = edge.sc.fr, v = edge.sc.sc;
		if(union_sets(u, v)){
			mst[v].pb(u);
			mst[u].pb(v);
		}
	}
	dfs(1, 1);
	int q;
	cin>>q;
	while(q--){
		int u, v;
		cin>>u>>v;
		int lc = lca(u, v);
		int du = depth[u]-depth[lc];
		int dv = depth[v]-depth[lc];
		cout<<min(getmn(u, du), getmn(v, dv))<<endl;

	}
    return 0;
}

Compilation message

plan.cpp:18:17: warning: overflow in conversion from 'double' to 'int' changes value from '2.0e+15' to '2147483647' [-Woverflow]
   18 | const int INF = 2e15;
      |                 ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 44904 KB Output is correct
2 Correct 24 ms 45460 KB Output is correct
3 Correct 23 ms 45416 KB Output is correct
4 Correct 22 ms 44880 KB Output is correct
5 Correct 24 ms 45504 KB Output is correct
6 Correct 23 ms 45388 KB Output is correct
7 Correct 22 ms 44968 KB Output is correct
8 Correct 22 ms 45004 KB Output is correct
9 Correct 23 ms 45396 KB Output is correct
10 Correct 24 ms 45380 KB Output is correct
11 Correct 24 ms 45488 KB Output is correct
12 Correct 23 ms 45388 KB Output is correct
13 Correct 24 ms 45384 KB Output is correct
14 Correct 23 ms 45388 KB Output is correct
15 Correct 24 ms 45432 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 44904 KB Output is correct
2 Correct 24 ms 45460 KB Output is correct
3 Correct 23 ms 45416 KB Output is correct
4 Correct 22 ms 44880 KB Output is correct
5 Correct 24 ms 45504 KB Output is correct
6 Correct 23 ms 45388 KB Output is correct
7 Correct 22 ms 44968 KB Output is correct
8 Correct 22 ms 45004 KB Output is correct
9 Correct 23 ms 45396 KB Output is correct
10 Correct 24 ms 45380 KB Output is correct
11 Correct 24 ms 45488 KB Output is correct
12 Correct 23 ms 45388 KB Output is correct
13 Correct 24 ms 45384 KB Output is correct
14 Correct 23 ms 45388 KB Output is correct
15 Correct 24 ms 45432 KB Output is correct
16 Correct 237 ms 87236 KB Output is correct
17 Correct 721 ms 119332 KB Output is correct
18 Correct 63 ms 53048 KB Output is correct
19 Correct 197 ms 97924 KB Output is correct
20 Correct 703 ms 119256 KB Output is correct
21 Correct 394 ms 103308 KB Output is correct
22 Correct 257 ms 103384 KB Output is correct
23 Correct 722 ms 118808 KB Output is correct
24 Correct 717 ms 119032 KB Output is correct
25 Correct 723 ms 118612 KB Output is correct
26 Correct 202 ms 97824 KB Output is correct
27 Correct 202 ms 97968 KB Output is correct
28 Correct 198 ms 97644 KB Output is correct
29 Correct 202 ms 97812 KB Output is correct
30 Correct 197 ms 98068 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 44996 KB Output is correct
2 Correct 22 ms 44876 KB Output is correct
3 Correct 21 ms 44876 KB Output is correct
4 Correct 22 ms 44876 KB Output is correct
5 Correct 22 ms 44920 KB Output is correct
6 Correct 21 ms 44864 KB Output is correct
7 Correct 22 ms 44900 KB Output is correct
8 Correct 22 ms 44932 KB Output is correct
9 Correct 21 ms 44876 KB Output is correct
10 Correct 22 ms 44868 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 101272 KB Output is correct
2 Correct 610 ms 117840 KB Output is correct
3 Correct 603 ms 117660 KB Output is correct
4 Correct 192 ms 98868 KB Output is correct
5 Correct 585 ms 117512 KB Output is correct
6 Correct 579 ms 117436 KB Output is correct
7 Correct 608 ms 117420 KB Output is correct
8 Correct 611 ms 117172 KB Output is correct
9 Correct 603 ms 117184 KB Output is correct
10 Correct 602 ms 117276 KB Output is correct
11 Correct 597 ms 117124 KB Output is correct
12 Correct 610 ms 116760 KB Output is correct
13 Correct 608 ms 116660 KB Output is correct
14 Correct 574 ms 116648 KB Output is correct
15 Correct 582 ms 116548 KB Output is correct
16 Correct 594 ms 116508 KB Output is correct
17 Correct 604 ms 116380 KB Output is correct
18 Correct 598 ms 116232 KB Output is correct
19 Correct 210 ms 101036 KB Output is correct
20 Correct 588 ms 116220 KB Output is correct
21 Correct 560 ms 116252 KB Output is correct
22 Correct 149 ms 96288 KB Output is correct
23 Correct 169 ms 96312 KB Output is correct
24 Correct 143 ms 96296 KB Output is correct
25 Correct 147 ms 96272 KB Output is correct
26 Correct 193 ms 96808 KB Output is correct
27 Correct 204 ms 100764 KB Output is correct
28 Correct 146 ms 96288 KB Output is correct
29 Correct 205 ms 99780 KB Output is correct
30 Correct 147 ms 96252 KB Output is correct
31 Correct 201 ms 99840 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 44904 KB Output is correct
2 Correct 24 ms 45460 KB Output is correct
3 Correct 23 ms 45416 KB Output is correct
4 Correct 22 ms 44880 KB Output is correct
5 Correct 24 ms 45504 KB Output is correct
6 Correct 23 ms 45388 KB Output is correct
7 Correct 22 ms 44968 KB Output is correct
8 Correct 22 ms 45004 KB Output is correct
9 Correct 23 ms 45396 KB Output is correct
10 Correct 24 ms 45380 KB Output is correct
11 Correct 24 ms 45488 KB Output is correct
12 Correct 23 ms 45388 KB Output is correct
13 Correct 24 ms 45384 KB Output is correct
14 Correct 23 ms 45388 KB Output is correct
15 Correct 24 ms 45432 KB Output is correct
16 Correct 237 ms 87236 KB Output is correct
17 Correct 721 ms 119332 KB Output is correct
18 Correct 63 ms 53048 KB Output is correct
19 Correct 197 ms 97924 KB Output is correct
20 Correct 703 ms 119256 KB Output is correct
21 Correct 394 ms 103308 KB Output is correct
22 Correct 257 ms 103384 KB Output is correct
23 Correct 722 ms 118808 KB Output is correct
24 Correct 717 ms 119032 KB Output is correct
25 Correct 723 ms 118612 KB Output is correct
26 Correct 202 ms 97824 KB Output is correct
27 Correct 202 ms 97968 KB Output is correct
28 Correct 198 ms 97644 KB Output is correct
29 Correct 202 ms 97812 KB Output is correct
30 Correct 197 ms 98068 KB Output is correct
31 Correct 23 ms 44996 KB Output is correct
32 Correct 22 ms 44876 KB Output is correct
33 Correct 21 ms 44876 KB Output is correct
34 Correct 22 ms 44876 KB Output is correct
35 Correct 22 ms 44920 KB Output is correct
36 Correct 21 ms 44864 KB Output is correct
37 Correct 22 ms 44900 KB Output is correct
38 Correct 22 ms 44932 KB Output is correct
39 Correct 21 ms 44876 KB Output is correct
40 Correct 22 ms 44868 KB Output is correct
41 Correct 331 ms 101272 KB Output is correct
42 Correct 610 ms 117840 KB Output is correct
43 Correct 603 ms 117660 KB Output is correct
44 Correct 192 ms 98868 KB Output is correct
45 Correct 585 ms 117512 KB Output is correct
46 Correct 579 ms 117436 KB Output is correct
47 Correct 608 ms 117420 KB Output is correct
48 Correct 611 ms 117172 KB Output is correct
49 Correct 603 ms 117184 KB Output is correct
50 Correct 602 ms 117276 KB Output is correct
51 Correct 597 ms 117124 KB Output is correct
52 Correct 610 ms 116760 KB Output is correct
53 Correct 608 ms 116660 KB Output is correct
54 Correct 574 ms 116648 KB Output is correct
55 Correct 582 ms 116548 KB Output is correct
56 Correct 594 ms 116508 KB Output is correct
57 Correct 604 ms 116380 KB Output is correct
58 Correct 598 ms 116232 KB Output is correct
59 Correct 210 ms 101036 KB Output is correct
60 Correct 588 ms 116220 KB Output is correct
61 Correct 560 ms 116252 KB Output is correct
62 Correct 149 ms 96288 KB Output is correct
63 Correct 169 ms 96312 KB Output is correct
64 Correct 143 ms 96296 KB Output is correct
65 Correct 147 ms 96272 KB Output is correct
66 Correct 193 ms 96808 KB Output is correct
67 Correct 204 ms 100764 KB Output is correct
68 Correct 146 ms 96288 KB Output is correct
69 Correct 205 ms 99780 KB Output is correct
70 Correct 147 ms 96252 KB Output is correct
71 Correct 201 ms 99840 KB Output is correct
72 Correct 436 ms 102468 KB Output is correct
73 Correct 739 ms 116112 KB Output is correct
74 Correct 707 ms 116120 KB Output is correct
75 Correct 713 ms 115988 KB Output is correct
76 Correct 707 ms 115764 KB Output is correct
77 Correct 719 ms 115720 KB Output is correct
78 Correct 712 ms 115488 KB Output is correct
79 Correct 722 ms 115436 KB Output is correct
80 Correct 713 ms 115356 KB Output is correct
81 Correct 727 ms 115064 KB Output is correct
82 Correct 708 ms 114992 KB Output is correct
83 Correct 700 ms 114928 KB Output is correct
84 Correct 700 ms 114852 KB Output is correct
85 Correct 729 ms 114564 KB Output is correct
86 Correct 734 ms 114468 KB Output is correct
87 Correct 712 ms 114332 KB Output is correct
88 Correct 726 ms 114192 KB Output is correct
89 Correct 351 ms 100628 KB Output is correct
90 Correct 702 ms 113964 KB Output is correct
91 Correct 696 ms 113904 KB Output is correct
92 Correct 232 ms 96220 KB Output is correct
93 Correct 323 ms 96908 KB Output is correct
94 Correct 234 ms 96128 KB Output is correct
95 Correct 229 ms 96280 KB Output is correct
96 Correct 323 ms 96284 KB Output is correct
97 Correct 374 ms 99432 KB Output is correct
98 Correct 225 ms 96188 KB Output is correct
99 Correct 352 ms 101020 KB Output is correct
100 Correct 231 ms 96248 KB Output is correct