oj.uz

Submission #995687

# Submission time Handle Problem Language Result Execution time Memory
995687 2024-06-09T17:51:10 Z Acanikolic Evacuation plan (IZhO18_plan) C++14
100 / 100
 313 ms 61140 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 = LOG - 1; j >= 0; 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 1 ms 9048 KB Output is correct
2 Correct 3 ms 9304 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 2 ms 9052 KB Output is correct
8 Correct 2 ms 9048 KB Output is correct
9 Correct 2 ms 9308 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 9308 KB Output is correct
13 Correct 2 ms 9308 KB Output is correct
14 Correct 2 ms 9308 KB Output is correct
15 Correct 2 ms 9304 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9048 KB Output is correct
2 Correct 3 ms 9304 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 2 ms 9052 KB Output is correct
8 Correct 2 ms 9048 KB Output is correct
9 Correct 2 ms 9308 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 9308 KB Output is correct
13 Correct 2 ms 9308 KB Output is correct
14 Correct 2 ms 9308 KB Output is correct
15 Correct 2 ms 9304 KB Output is correct
16 Correct 95 ms 31172 KB Output is correct
17 Correct 295 ms 60848 KB Output is correct
18 Correct 24 ms 17484 KB Output is correct
19 Correct 91 ms 36344 KB Output is correct
20 Correct 290 ms 61140 KB Output is correct
21 Correct 153 ms 41012 KB Output is correct
22 Correct 86 ms 39640 KB Output is correct
23 Correct 275 ms 60848 KB Output is correct
24 Correct 276 ms 60732 KB Output is correct
25 Correct 283 ms 60748 KB Output is correct
26 Correct 82 ms 36068 KB Output is correct
27 Correct 88 ms 36028 KB Output is correct
28 Correct 87 ms 36016 KB Output is correct
29 Correct 85 ms 36160 KB Output is correct
30 Correct 86 ms 36336 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 36024 KB Output is correct
2 Correct 257 ms 50856 KB Output is correct
3 Correct 250 ms 50988 KB Output is correct
4 Correct 69 ms 33768 KB Output is correct
5 Correct 243 ms 51120 KB Output is correct
6 Correct 247 ms 51120 KB Output is correct
7 Correct 250 ms 51048 KB Output is correct
8 Correct 237 ms 50920 KB Output is correct
9 Correct 251 ms 51024 KB Output is correct
10 Correct 242 ms 50856 KB Output is correct
11 Correct 249 ms 50912 KB Output is correct
12 Correct 239 ms 50860 KB Output is correct
13 Correct 235 ms 50864 KB Output is correct
14 Correct 245 ms 51080 KB Output is correct
15 Correct 274 ms 50720 KB Output is correct
16 Correct 239 ms 50932 KB Output is correct
17 Correct 248 ms 50824 KB Output is correct
18 Correct 252 ms 50856 KB Output is correct
19 Correct 66 ms 35780 KB Output is correct
20 Correct 243 ms 50860 KB Output is correct
21 Correct 206 ms 50872 KB Output is correct
22 Correct 64 ms 32948 KB Output is correct
23 Correct 63 ms 31416 KB Output is correct
24 Correct 62 ms 33020 KB Output is correct
25 Correct 65 ms 32948 KB Output is correct
26 Correct 79 ms 31676 KB Output is correct
27 Correct 73 ms 35556 KB Output is correct
28 Correct 62 ms 33016 KB Output is correct
29 Correct 69 ms 34744 KB Output is correct
30 Correct 68 ms 32948 KB Output is correct
31 Correct 66 ms 34500 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9048 KB Output is correct
2 Correct 3 ms 9304 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 2 ms 9052 KB Output is correct
8 Correct 2 ms 9048 KB Output is correct
9 Correct 2 ms 9308 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 9308 KB Output is correct
13 Correct 2 ms 9308 KB Output is correct
14 Correct 2 ms 9308 KB Output is correct
15 Correct 2 ms 9304 KB Output is correct
16 Correct 95 ms 31172 KB Output is correct
17 Correct 295 ms 60848 KB Output is correct
18 Correct 24 ms 17484 KB Output is correct
19 Correct 91 ms 36344 KB Output is correct
20 Correct 290 ms 61140 KB Output is correct
21 Correct 153 ms 41012 KB Output is correct
22 Correct 86 ms 39640 KB Output is correct
23 Correct 275 ms 60848 KB Output is correct
24 Correct 276 ms 60732 KB Output is correct
25 Correct 283 ms 60748 KB Output is correct
26 Correct 82 ms 36068 KB Output is correct
27 Correct 88 ms 36028 KB Output is correct
28 Correct 87 ms 36016 KB Output is correct
29 Correct 85 ms 36160 KB Output is correct
30 Correct 86 ms 36336 KB Output is correct
31 Correct 2 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 2 ms 9052 KB Output is correct
37 Correct 1 ms 9048 KB Output is correct
38 Correct 2 ms 9048 KB Output is correct
39 Correct 1 ms 9048 KB Output is correct
40 Correct 2 ms 9052 KB Output is correct
41 Correct 126 ms 36024 KB Output is correct
42 Correct 257 ms 50856 KB Output is correct
43 Correct 250 ms 50988 KB Output is correct
44 Correct 69 ms 33768 KB Output is correct
45 Correct 243 ms 51120 KB Output is correct
46 Correct 247 ms 51120 KB Output is correct
47 Correct 250 ms 51048 KB Output is correct
48 Correct 237 ms 50920 KB Output is correct
49 Correct 251 ms 51024 KB Output is correct
50 Correct 242 ms 50856 KB Output is correct
51 Correct 249 ms 50912 KB Output is correct
52 Correct 239 ms 50860 KB Output is correct
53 Correct 235 ms 50864 KB Output is correct
54 Correct 245 ms 51080 KB Output is correct
55 Correct 274 ms 50720 KB Output is correct
56 Correct 239 ms 50932 KB Output is correct
57 Correct 248 ms 50824 KB Output is correct
58 Correct 252 ms 50856 KB Output is correct
59 Correct 66 ms 35780 KB Output is correct
60 Correct 243 ms 50860 KB Output is correct
61 Correct 206 ms 50872 KB Output is correct
62 Correct 64 ms 32948 KB Output is correct
63 Correct 63 ms 31416 KB Output is correct
64 Correct 62 ms 33020 KB Output is correct
65 Correct 65 ms 32948 KB Output is correct
66 Correct 79 ms 31676 KB Output is correct
67 Correct 73 ms 35556 KB Output is correct
68 Correct 62 ms 33016 KB Output is correct
69 Correct 69 ms 34744 KB Output is correct
70 Correct 68 ms 32948 KB Output is correct
71 Correct 66 ms 34500 KB Output is correct
72 Correct 167 ms 41400 KB Output is correct
73 Correct 304 ms 60888 KB Output is correct
74 Correct 281 ms 61108 KB Output is correct
75 Correct 285 ms 61024 KB Output is correct
76 Correct 313 ms 60848 KB Output is correct
77 Correct 287 ms 60848 KB Output is correct
78 Correct 290 ms 60848 KB Output is correct
79 Correct 276 ms 60860 KB Output is correct
80 Correct 299 ms 60820 KB Output is correct
81 Correct 292 ms 60812 KB Output is correct
82 Correct 283 ms 60844 KB Output is correct
83 Correct 310 ms 60608 KB Output is correct
84 Correct 275 ms 60848 KB Output is correct
85 Correct 280 ms 60468 KB Output is correct
86 Correct 273 ms 60844 KB Output is correct
87 Correct 293 ms 60844 KB Output is correct
88 Correct 290 ms 60848 KB Output is correct
89 Correct 110 ms 38460 KB Output is correct
90 Correct 278 ms 61104 KB Output is correct
91 Correct 255 ms 60816 KB Output is correct
92 Correct 95 ms 36092 KB Output is correct
93 Correct 111 ms 35296 KB Output is correct
94 Correct 94 ms 36004 KB Output is correct
95 Correct 87 ms 36020 KB Output is correct
96 Correct 123 ms 35268 KB Output is correct
97 Correct 117 ms 37328 KB Output is correct
98 Correct 88 ms 36048 KB Output is correct
99 Correct 111 ms 38884 KB Output is correct
100 Correct 91 ms 36276 KB Output is correct