oj.uz

Submission #945296

# Submission time Handle Problem Language Result Execution time Memory
945296 2024-03-13T15:45:42 Z oblantis Evacuation plan (IZhO18_plan) C++17
100 / 100
 391 ms 45728 KB 
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
//#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll inf = 1e15;
const int mod = 1e9+7;
const int maxn = 1e5 + 1;
vt<pii> g[maxn];
vt<int> adj[maxn];
ll dp[maxn];
int p[maxn], deep[maxn], up[maxn][20];
bool was[maxn];
bool cmp(int x, int y){
	return dp[x] < dp[y];
}
int get(int wt){
	if(p[wt] == wt)return wt;
	p[wt] = get(p[wt]);
	return p[wt];
}
void go(int v){
	for(auto i : adj[v]){
		deep[i] = deep[v] + 1;
		up[i][0] = v;
		go(i);
	}
}
int calc(int x, int y){
	if(deep[x] > deep[y])swap(x, y);
	int fup = deep[y] - deep[x], j = 0;
	while(fup){
		if(fup & 1){
			y = up[y][j];
		}
		j++;
		fup >>= 1;
	}
	if(y == x)return y;
	for(int i = 19; i >= 0; i--){
		if(up[y][i] != up[x][i])x = up[x][i], y = up[y][i];
	}
	return up[x][0];
}
void solve() {
	int n, m;
	cin >> n >> m;
	fill(dp, dp + n + 1, inf);
	vt<int> it(n);
	for(int i = 1; i <= n; i++){
		it.pb(i);
		p[i] = i;
	}
	for(int i = 0, u, v, w; i < m; i++){
		cin >> u >> v >> w;
		g[u].pb({v, w});
		g[v].pb({u, w});
	}
	int k;
	priority_queue<pair<ll, int>, vt<pair<ll, int>>, greater<pair<ll, int>>> pq;
	cin >> k;
	for(int i = 0; i < k; i++){
		int wt;
		cin >> wt;
		dp[wt] = 0;
		pq.push({0, wt});
	}
	while(!pq.empty()){
		pair<ll, int> nw = pq.top();
		pq.pop();
		if(nw.ff != dp[nw.ss])continue;
		for(auto i : g[nw.ss]){
			if(dp[i.ff] > nw.ff + i.ss){
				dp[i.ff] = nw.ff + i.ss;
				pq.push({dp[i.ff], i.ff});
			}
		}
	}
	sort(all(it), cmp);
	for(int i = n - 1; i >= 0; i--){
		was[it[i]] = 1;
		for(auto j : g[it[i]]){
			if(!was[j.ff])continue;
			get(j.ff);
			if(p[j.ff] == it[i])continue;
			adj[it[i]].pb(p[j.ff]);
			p[p[j.ff]] = it[i];
		}
	}
	go(it[0]);
	for(int i = 1; i < 20; i++)for(int j = 1; j <= n; j++)up[j][i] = up[up[j][i - 1]][i - 1];
	int q;
	cin >> q;
	while(q--){
		int s, t;
		cin >> s >> t;
		cout << dp[calc(s, t)] << '\n';
	}
}
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int times = 1;
	//cin >> times;
	for(int i = 1; i <= times; i++) {
		solve();
	}
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 3 ms 10332 KB Output is correct
3 Correct 3 ms 10372 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 3 ms 10420 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 2 ms 8312 KB Output is correct
9 Correct 3 ms 10332 KB Output is correct
10 Correct 3 ms 10324 KB Output is correct
11 Correct 3 ms 10332 KB Output is correct
12 Correct 3 ms 10332 KB Output is correct
13 Correct 3 ms 10328 KB Output is correct
14 Correct 3 ms 10332 KB Output is correct
15 Correct 3 ms 10332 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 3 ms 10332 KB Output is correct
3 Correct 3 ms 10372 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 3 ms 10420 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 2 ms 8312 KB Output is correct
9 Correct 3 ms 10332 KB Output is correct
10 Correct 3 ms 10324 KB Output is correct
11 Correct 3 ms 10332 KB Output is correct
12 Correct 3 ms 10332 KB Output is correct
13 Correct 3 ms 10328 KB Output is correct
14 Correct 3 ms 10332 KB Output is correct
15 Correct 3 ms 10332 KB Output is correct
16 Correct 96 ms 24444 KB Output is correct
17 Correct 312 ms 45092 KB Output is correct
18 Correct 23 ms 13004 KB Output is correct
19 Correct 91 ms 24940 KB Output is correct
20 Correct 317 ms 45016 KB Output is correct
21 Correct 158 ms 31140 KB Output is correct
22 Correct 89 ms 28364 KB Output is correct
23 Correct 308 ms 44868 KB Output is correct
24 Correct 299 ms 44924 KB Output is correct
25 Correct 318 ms 45124 KB Output is correct
26 Correct 88 ms 24800 KB Output is correct
27 Correct 93 ms 24932 KB Output is correct
28 Correct 98 ms 24676 KB Output is correct
29 Correct 90 ms 24940 KB Output is correct
30 Correct 107 ms 24944 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 29396 KB Output is correct
2 Correct 317 ms 43188 KB Output is correct
3 Correct 289 ms 43228 KB Output is correct
4 Correct 65 ms 24780 KB Output is correct
5 Correct 306 ms 43296 KB Output is correct
6 Correct 303 ms 43432 KB Output is correct
7 Correct 285 ms 43200 KB Output is correct
8 Correct 306 ms 43260 KB Output is correct
9 Correct 265 ms 43356 KB Output is correct
10 Correct 290 ms 43260 KB Output is correct
11 Correct 287 ms 43424 KB Output is correct
12 Correct 261 ms 43208 KB Output is correct
13 Correct 264 ms 43204 KB Output is correct
14 Correct 250 ms 43280 KB Output is correct
15 Correct 278 ms 44116 KB Output is correct
16 Correct 249 ms 43432 KB Output is correct
17 Correct 254 ms 43204 KB Output is correct
18 Correct 270 ms 43204 KB Output is correct
19 Correct 65 ms 26060 KB Output is correct
20 Correct 269 ms 43204 KB Output is correct
21 Correct 228 ms 43204 KB Output is correct
22 Correct 60 ms 23364 KB Output is correct
23 Correct 68 ms 22984 KB Output is correct
24 Correct 69 ms 23364 KB Output is correct
25 Correct 62 ms 23416 KB Output is correct
26 Correct 72 ms 22688 KB Output is correct
27 Correct 61 ms 24780 KB Output is correct
28 Correct 61 ms 23372 KB Output is correct
29 Correct 62 ms 24780 KB Output is correct
30 Correct 61 ms 23272 KB Output is correct
31 Correct 74 ms 24560 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 3 ms 10332 KB Output is correct
3 Correct 3 ms 10372 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 3 ms 10420 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 2 ms 8312 KB Output is correct
9 Correct 3 ms 10332 KB Output is correct
10 Correct 3 ms 10324 KB Output is correct
11 Correct 3 ms 10332 KB Output is correct
12 Correct 3 ms 10332 KB Output is correct
13 Correct 3 ms 10328 KB Output is correct
14 Correct 3 ms 10332 KB Output is correct
15 Correct 3 ms 10332 KB Output is correct
16 Correct 96 ms 24444 KB Output is correct
17 Correct 312 ms 45092 KB Output is correct
18 Correct 23 ms 13004 KB Output is correct
19 Correct 91 ms 24940 KB Output is correct
20 Correct 317 ms 45016 KB Output is correct
21 Correct 158 ms 31140 KB Output is correct
22 Correct 89 ms 28364 KB Output is correct
23 Correct 308 ms 44868 KB Output is correct
24 Correct 299 ms 44924 KB Output is correct
25 Correct 318 ms 45124 KB Output is correct
26 Correct 88 ms 24800 KB Output is correct
27 Correct 93 ms 24932 KB Output is correct
28 Correct 98 ms 24676 KB Output is correct
29 Correct 90 ms 24940 KB Output is correct
30 Correct 107 ms 24944 KB Output is correct
31 Correct 2 ms 8280 KB Output is correct
32 Correct 3 ms 8284 KB Output is correct
33 Correct 2 ms 8284 KB Output is correct
34 Correct 2 ms 8284 KB Output is correct
35 Correct 2 ms 8284 KB Output is correct
36 Correct 2 ms 8284 KB Output is correct
37 Correct 2 ms 8284 KB Output is correct
38 Correct 2 ms 8284 KB Output is correct
39 Correct 2 ms 8284 KB Output is correct
40 Correct 3 ms 8284 KB Output is correct
41 Correct 151 ms 29396 KB Output is correct
42 Correct 317 ms 43188 KB Output is correct
43 Correct 289 ms 43228 KB Output is correct
44 Correct 65 ms 24780 KB Output is correct
45 Correct 306 ms 43296 KB Output is correct
46 Correct 303 ms 43432 KB Output is correct
47 Correct 285 ms 43200 KB Output is correct
48 Correct 306 ms 43260 KB Output is correct
49 Correct 265 ms 43356 KB Output is correct
50 Correct 290 ms 43260 KB Output is correct
51 Correct 287 ms 43424 KB Output is correct
52 Correct 261 ms 43208 KB Output is correct
53 Correct 264 ms 43204 KB Output is correct
54 Correct 250 ms 43280 KB Output is correct
55 Correct 278 ms 44116 KB Output is correct
56 Correct 249 ms 43432 KB Output is correct
57 Correct 254 ms 43204 KB Output is correct
58 Correct 270 ms 43204 KB Output is correct
59 Correct 65 ms 26060 KB Output is correct
60 Correct 269 ms 43204 KB Output is correct
61 Correct 228 ms 43204 KB Output is correct
62 Correct 60 ms 23364 KB Output is correct
63 Correct 68 ms 22984 KB Output is correct
64 Correct 69 ms 23364 KB Output is correct
65 Correct 62 ms 23416 KB Output is correct
66 Correct 72 ms 22688 KB Output is correct
67 Correct 61 ms 24780 KB Output is correct
68 Correct 61 ms 23372 KB Output is correct
69 Correct 62 ms 24780 KB Output is correct
70 Correct 61 ms 23272 KB Output is correct
71 Correct 74 ms 24560 KB Output is correct
72 Correct 175 ms 31056 KB Output is correct
73 Correct 315 ms 44908 KB Output is correct
74 Correct 303 ms 45080 KB Output is correct
75 Correct 324 ms 45728 KB Output is correct
76 Correct 330 ms 44996 KB Output is correct
77 Correct 309 ms 44996 KB Output is correct
78 Correct 299 ms 44996 KB Output is correct
79 Correct 344 ms 44996 KB Output is correct
80 Correct 310 ms 45072 KB Output is correct
81 Correct 321 ms 44996 KB Output is correct
82 Correct 391 ms 44996 KB Output is correct
83 Correct 326 ms 44992 KB Output is correct
84 Correct 315 ms 45000 KB Output is correct
85 Correct 308 ms 45244 KB Output is correct
86 Correct 370 ms 45020 KB Output is correct
87 Correct 334 ms 45000 KB Output is correct
88 Correct 306 ms 45116 KB Output is correct
89 Correct 109 ms 28368 KB Output is correct
90 Correct 308 ms 44924 KB Output is correct
91 Correct 325 ms 44708 KB Output is correct
92 Correct 89 ms 24952 KB Output is correct
93 Correct 152 ms 25036 KB Output is correct
94 Correct 84 ms 24904 KB Output is correct
95 Correct 84 ms 24764 KB Output is correct
96 Correct 99 ms 24268 KB Output is correct
97 Correct 104 ms 26572 KB Output is correct
98 Correct 82 ms 24920 KB Output is correct
99 Correct 105 ms 26548 KB Output is correct
100 Correct 85 ms 24896 KB Output is correct