oj.uz

Submission #995690

# Submission time Handle Problem Language Result Execution time Memory
995690 2024-06-09T17:53:14 Z Acanikolic Evacuation plan (IZhO18_plan) C++14
100 / 100
 338 ms 51832 KB 
#include <bits/stdc++.h>  

#define pb push_back
 
#define F first
 
#define S second
 
using namespace std;
 
const int N = 1e5 + 10;
 
const int mod = 998244353;
 
const int inf = 1e9;
 
const int LOG = 17; 
 
vector<pair<int,int>>g[N],graf[N]; 
bool mark[N]; 
long long dist[N];
int par[N],siz[N],up[N][LOG],mn[N][LOG],val[N],in[N],out[N],timer = 0,dep[N];

int get(int x) {
	return (x == par[x] ? x : par[x] = get(par[x]));
}

void unite(int u,int v) {
	u = get(u);
	v = get(v);
	if(u == v) return;
	if(siz[u] > siz[v]) swap(u,v);
	siz[v] += siz[u];
	par[u] = v;
}

bool same(int u,int v) {
	return get(u) == get(v);
}

bool cmp(array<int,3>A,array<int,3>B) {
	return A[2] > B[2];
}

void dfs(int x,int par) {
	dep[x] = dep[par] + 1;
	in[x] = ++timer;
	up[x][0] = par;
	mn[x][0] = val[x];
	for(int j = 1; j < LOG; j++) {
		up[x][j] = up[up[x][j - 1]][j - 1];
		mn[x][j] = min(mn[x][j - 1],mn[up[x][j - 1]][j - 1]);
	}
	for(auto X : graf[x]) {
		if(X.F == par) continue;
		val[X.F] = X.S;
		dfs(X.F,x);
	}
	out[x] = timer;
}

bool intree(int u,int v) {
	return in[u] <= in[v] && out[u] >= out[v];
}

int lca(int u,int v) {
	if(intree(u,v)) return u;
	if(intree(v,u)) return v;
	for(int j = LOG - 1; j >= 0; j--) {
		if(up[u][j] > 0 && !intree(up[u][j],v)) u = up[u][j];
	}
	return up[u][0];
}

int get(int u,int LCA) {
	int k = dep[u] - dep[LCA],res = inf;
	for(int j = 0; j < LOG; j++) {
		if((1 << j) & k) {
			res = min(res,mn[u][j]);
			u = up[u][j];
		}
	}
	return res;
}
 
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
 
 	int n,m;
 	cin >> n >> m;
 	for(int i = 1; i <= n; i++) {
 		dist[i] = inf;
 		par[i] = i;
 		siz[i] = 1;
 	}
 	vector<array<int,3>>edges;
 	vector<pair<int,int>>vec;
 	for(int i = 1; i <= m; i++) {
 		int u,v,w;
 		cin >> u >> v >> w;
 		vec.pb({u,v});
 		g[u].pb({v,w});
 		g[v].pb({u,w});
 	}
 	int k;
 	cin >> k;
 	priority_queue<pair<long long,int>,vector<pair<long long,int>>,greater<pair<long long,int>>>pq;
 	for(int i = 1; i <= k; i++) {
 		int x;
 		cin >> x;
 		mark[x] = true;
 		pq.push({0,x});
 		dist[x] = 0;
 	}
 	while(!pq.empty()) {
 		long long dst = pq.top().F;
 		int u = pq.top().S;
 		pq.pop();
 		for(auto X : g[u]) {
 			if(dist[X.F] > dst + X.S) {
 				dist[X.F] = dst + X.S;
 				pq.push({dist[X.F],X.F});
 			}
 		}
 	}
 	for(auto X : vec) {
 		int w = min(dist[X.F],dist[X.S]);
 		edges.pb({X.F,X.S,w});
 	}
 	sort(edges.begin(),edges.end(),cmp);
 	for(auto X : edges) {
 		if(!same(X[0],X[1])) {
 			graf[X[0]].pb({X[1],X[2]});
 			graf[X[1]].pb({X[0],X[2]});
 			unite(X[0],X[1]);
 		}
 	}
 	dfs(1,0);
 	int q;
 	cin >> q;
 	while(q--) {
 		int u,v;
 		cin >> u >> v;
		int LCA = lca(u,v);
		cout << min(get(u,LCA),get(v,LCA)) << "\n";
 	}
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9048 KB Output is correct
2 Correct 2 ms 9308 KB Output is correct
3 Correct 2 ms 9308 KB Output is correct
4 Correct 1 ms 9052 KB Output is correct
5 Correct 2 ms 9308 KB Output is correct
6 Correct 2 ms 9308 KB Output is correct
7 Correct 1 ms 9304 KB Output is correct
8 Correct 1 ms 9256 KB Output is correct
9 Correct 2 ms 9376 KB Output is correct
10 Correct 2 ms 9308 KB Output is correct
11 Correct 2 ms 9308 KB Output is correct
12 Correct 2 ms 9300 KB Output is correct
13 Correct 2 ms 9308 KB Output is correct
14 Correct 2 ms 9308 KB Output is correct
15 Correct 3 ms 9308 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9048 KB Output is correct
2 Correct 2 ms 9308 KB Output is correct
3 Correct 2 ms 9308 KB Output is correct
4 Correct 1 ms 9052 KB Output is correct
5 Correct 2 ms 9308 KB Output is correct
6 Correct 2 ms 9308 KB Output is correct
7 Correct 1 ms 9304 KB Output is correct
8 Correct 1 ms 9256 KB Output is correct
9 Correct 2 ms 9376 KB Output is correct
10 Correct 2 ms 9308 KB Output is correct
11 Correct 2 ms 9308 KB Output is correct
12 Correct 2 ms 9300 KB Output is correct
13 Correct 2 ms 9308 KB Output is correct
14 Correct 2 ms 9308 KB Output is correct
15 Correct 3 ms 9308 KB Output is correct
16 Correct 98 ms 30236 KB Output is correct
17 Correct 278 ms 51300 KB Output is correct
18 Correct 22 ms 16720 KB Output is correct
19 Correct 82 ms 33308 KB Output is correct
20 Correct 289 ms 51284 KB Output is correct
21 Correct 143 ms 36408 KB Output is correct
22 Correct 85 ms 36792 KB Output is correct
23 Correct 280 ms 51372 KB Output is correct
24 Correct 272 ms 51376 KB Output is correct
25 Correct 273 ms 51376 KB Output is correct
26 Correct 79 ms 33200 KB Output is correct
27 Correct 82 ms 33208 KB Output is correct
28 Correct 104 ms 33004 KB Output is correct
29 Correct 82 ms 33204 KB Output is correct
30 Correct 83 ms 33296 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9048 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 1 ms 9052 KB Output is correct
4 Correct 1 ms 9052 KB Output is correct
5 Correct 1 ms 9052 KB Output is correct
6 Correct 1 ms 9052 KB Output is correct
7 Correct 2 ms 9048 KB Output is correct
8 Correct 2 ms 9052 KB Output is correct
9 Correct 2 ms 9052 KB Output is correct
10 Correct 1 ms 9052 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 36448 KB Output is correct
2 Correct 265 ms 50864 KB Output is correct
3 Correct 239 ms 50912 KB Output is correct
4 Correct 67 ms 33752 KB Output is correct
5 Correct 236 ms 50852 KB Output is correct
6 Correct 241 ms 50940 KB Output is correct
7 Correct 238 ms 50860 KB Output is correct
8 Correct 234 ms 51380 KB Output is correct
9 Correct 244 ms 50984 KB Output is correct
10 Correct 244 ms 50860 KB Output is correct
11 Correct 239 ms 51040 KB Output is correct
12 Correct 231 ms 51116 KB Output is correct
13 Correct 246 ms 51120 KB Output is correct
14 Correct 243 ms 50916 KB Output is correct
15 Correct 259 ms 51056 KB Output is correct
16 Correct 241 ms 50932 KB Output is correct
17 Correct 247 ms 51120 KB Output is correct
18 Correct 239 ms 50876 KB Output is correct
19 Correct 64 ms 35780 KB Output is correct
20 Correct 250 ms 51380 KB Output is correct
21 Correct 213 ms 50600 KB Output is correct
22 Correct 62 ms 32940 KB Output is correct
23 Correct 67 ms 31428 KB Output is correct
24 Correct 61 ms 32972 KB Output is correct
25 Correct 63 ms 33004 KB Output is correct
26 Correct 70 ms 31676 KB Output is correct
27 Correct 69 ms 35520 KB Output is correct
28 Correct 62 ms 32792 KB Output is correct
29 Correct 67 ms 34512 KB Output is correct
30 Correct 65 ms 32948 KB Output is correct
31 Correct 89 ms 34496 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9048 KB Output is correct
2 Correct 2 ms 9308 KB Output is correct
3 Correct 2 ms 9308 KB Output is correct
4 Correct 1 ms 9052 KB Output is correct
5 Correct 2 ms 9308 KB Output is correct
6 Correct 2 ms 9308 KB Output is correct
7 Correct 1 ms 9304 KB Output is correct
8 Correct 1 ms 9256 KB Output is correct
9 Correct 2 ms 9376 KB Output is correct
10 Correct 2 ms 9308 KB Output is correct
11 Correct 2 ms 9308 KB Output is correct
12 Correct 2 ms 9300 KB Output is correct
13 Correct 2 ms 9308 KB Output is correct
14 Correct 2 ms 9308 KB Output is correct
15 Correct 3 ms 9308 KB Output is correct
16 Correct 98 ms 30236 KB Output is correct
17 Correct 278 ms 51300 KB Output is correct
18 Correct 22 ms 16720 KB Output is correct
19 Correct 82 ms 33308 KB Output is correct
20 Correct 289 ms 51284 KB Output is correct
21 Correct 143 ms 36408 KB Output is correct
22 Correct 85 ms 36792 KB Output is correct
23 Correct 280 ms 51372 KB Output is correct
24 Correct 272 ms 51376 KB Output is correct
25 Correct 273 ms 51376 KB Output is correct
26 Correct 79 ms 33200 KB Output is correct
27 Correct 82 ms 33208 KB Output is correct
28 Correct 104 ms 33004 KB Output is correct
29 Correct 82 ms 33204 KB Output is correct
30 Correct 83 ms 33296 KB Output is correct
31 Correct 1 ms 9048 KB Output is correct
32 Correct 2 ms 9052 KB Output is correct
33 Correct 1 ms 9052 KB Output is correct
34 Correct 1 ms 9052 KB Output is correct
35 Correct 1 ms 9052 KB Output is correct
36 Correct 1 ms 9052 KB Output is correct
37 Correct 2 ms 9048 KB Output is correct
38 Correct 2 ms 9052 KB Output is correct
39 Correct 2 ms 9052 KB Output is correct
40 Correct 1 ms 9052 KB Output is correct
41 Correct 122 ms 36448 KB Output is correct
42 Correct 265 ms 50864 KB Output is correct
43 Correct 239 ms 50912 KB Output is correct
44 Correct 67 ms 33752 KB Output is correct
45 Correct 236 ms 50852 KB Output is correct
46 Correct 241 ms 50940 KB Output is correct
47 Correct 238 ms 50860 KB Output is correct
48 Correct 234 ms 51380 KB Output is correct
49 Correct 244 ms 50984 KB Output is correct
50 Correct 244 ms 50860 KB Output is correct
51 Correct 239 ms 51040 KB Output is correct
52 Correct 231 ms 51116 KB Output is correct
53 Correct 246 ms 51120 KB Output is correct
54 Correct 243 ms 50916 KB Output is correct
55 Correct 259 ms 51056 KB Output is correct
56 Correct 241 ms 50932 KB Output is correct
57 Correct 247 ms 51120 KB Output is correct
58 Correct 239 ms 50876 KB Output is correct
59 Correct 64 ms 35780 KB Output is correct
60 Correct 250 ms 51380 KB Output is correct
61 Correct 213 ms 50600 KB Output is correct
62 Correct 62 ms 32940 KB Output is correct
63 Correct 67 ms 31428 KB Output is correct
64 Correct 61 ms 32972 KB Output is correct
65 Correct 63 ms 33004 KB Output is correct
66 Correct 70 ms 31676 KB Output is correct
67 Correct 69 ms 35520 KB Output is correct
68 Correct 62 ms 32792 KB Output is correct
69 Correct 67 ms 34512 KB Output is correct
70 Correct 65 ms 32948 KB Output is correct
71 Correct 89 ms 34496 KB Output is correct
72 Correct 153 ms 36788 KB Output is correct
73 Correct 291 ms 51340 KB Output is correct
74 Correct 273 ms 51436 KB Output is correct
75 Correct 277 ms 51372 KB Output is correct
76 Correct 288 ms 51416 KB Output is correct
77 Correct 280 ms 51376 KB Output is correct
78 Correct 284 ms 51372 KB Output is correct
79 Correct 282 ms 51376 KB Output is correct
80 Correct 275 ms 51372 KB Output is correct
81 Correct 282 ms 51436 KB Output is correct
82 Correct 270 ms 51380 KB Output is correct
83 Correct 291 ms 51376 KB Output is correct
84 Correct 270 ms 51372 KB Output is correct
85 Correct 275 ms 51516 KB Output is correct
86 Correct 287 ms 51388 KB Output is correct
87 Correct 286 ms 51388 KB Output is correct
88 Correct 285 ms 51464 KB Output is correct
89 Correct 105 ms 35516 KB Output is correct
90 Correct 338 ms 51832 KB Output is correct
91 Correct 243 ms 50604 KB Output is correct
92 Correct 103 ms 33196 KB Output is correct
93 Correct 113 ms 32444 KB Output is correct
94 Correct 88 ms 33132 KB Output is correct
95 Correct 83 ms 33192 KB Output is correct
96 Correct 122 ms 32212 KB Output is correct
97 Correct 112 ms 34240 KB Output is correct
98 Correct 82 ms 33204 KB Output is correct
99 Correct 115 ms 36044 KB Output is correct
100 Correct 81 ms 33180 KB Output is correct