oj.uz

Submission #1002626

# Submission time Handle Problem Language Result Execution time Memory
1002626 2024-06-19T17:09:20 Z Tob Evacuation plan (IZhO18_plan) C++14
100 / 100
 428 ms 80704 KB 
#include <bits/stdc++.h>

#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair <ll, ll> pii;

const int N = 1e5 + 7;
const ll inf = 1e18;

int n, m, k, q;
int pa[N], siz[N], par[N][18], dub[N];
ll mini[N][18], dis[N];
pii ed[5*N];
vector <pii> adj[N];

int find(int x) {return x == pa[x] ? x : (pa[x] = find(pa[x]));}
bool unite(int x, int y) {
	x = find(x); y = find(y);
	if (x == y) return 1;
	if (siz[x] < siz[y]) swap(x, y);
	pa[y] = x;
	siz[x] += siz[y];
	return 0;
}

void dfs(int x, int p = -1) {
	if (x) par[x][0] = p;
	if (x) dub[x] = dub[p] + 1;
	for (auto y : adj[x]) {
		if (y.F == p) continue;
		mini[y.F][0] = y.S;
		dfs(y.F, x);
	}
}

int query(int x, int y) {
	if (dub[x] < dub[y]) swap(x, y);
	ll mn = inf;
	for (int i = 17; i >= 0; i--) {
		int z = par[x][i]; if (z==-1) continue;
		if (dub[z] >= dub[y]) {mn = min(mn, mini[x][i]); x = z;}
	}
	if (x == y) return mn;
	for (int i = 17; i >= 0; i--) {
		int z = par[x][i], w = par[y][i];
		if (z != w) {mn = min(mn, min(mini[x][i], mini[y][i])); x = z, y = w;}
	}
	return min(mn, min(mini[x][0], mini[y][0]));
}

int main () {
	FIO;
	cin >> n >> m;
	
	for (int i = 0; i < m; i++) {
		int x, y, w; cin >> x >> y >> w; x--; y--;
		adj[x].pb({y, w});
		adj[y].pb({x, w});
		ed[i] = {x, y};
	}
	
	cin >> k;
	
	set <pii> s;
	for (int i = 0; i < n; i++) dis[i] = inf;
	for (int i = 0; i < k; i++) {
		int x; cin >> x; x--;
		dis[x] = 0;
		s.insert({0, x});
	}
	while (!s.empty()) {
		auto p = s.begin();
		int x = p -> S;
		s.erase(p);
		for (auto y : adj[x]) {
			if (dis[x] + y.S < dis[y.F]) {
				if (dis[y.F] != inf) s.erase({dis[y.F], y.F});
				dis[y.F] = dis[x] + y.S;
				s.insert({dis[y.F], y.F});
			}
		}
	}
	for (int i = 0; i < n; i++) {
		adj[i].clear();
		pa[i] = i;
		siz[i] = 1;
	}
	vector <pii> v;
	for (int i = 0; i < m; i++) v.pb({min(dis[ed[i].F], dis[ed[i].S]), i});
	sort(all(v)); reverse(all(v));
	for (int i = 0; i < m; i++) {
		int x = ed[v[i].S].F, y = ed[v[i].S].S;
		if (unite(x, y)) continue;
		adj[x].pb({y, v[i].F});
		adj[y].pb({x, v[i].F});
	}
	mini[0][0] = inf;
	dfs(0);
	for (int j = 1; j < 18; j++) {
		for (int i = 0; i < n; i++) {
			par[i][j] = par[par[i][j-1]][j-1];
			mini[i][j] = min(mini[i][j-1], mini[par[i][j-1]][j-1]);
		}
	}
	
	cin >> q;
	
	while (q--) {
		int x, y; cin >> x >> y; x--; y--;
		cout << query(x, y) << "\n";
	}

	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 3 ms 13004 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12944 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12820 KB Output is correct
10 Correct 2 ms 13060 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 3 ms 12888 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 3 ms 13004 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12944 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12820 KB Output is correct
10 Correct 2 ms 13060 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 3 ms 12888 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 116 ms 38472 KB Output is correct
17 Correct 376 ms 78932 KB Output is correct
18 Correct 26 ms 18896 KB Output is correct
19 Correct 92 ms 43712 KB Output is correct
20 Correct 391 ms 78804 KB Output is correct
21 Correct 190 ms 54892 KB Output is correct
22 Correct 76 ms 44216 KB Output is correct
23 Correct 428 ms 78972 KB Output is correct
24 Correct 367 ms 79068 KB Output is correct
25 Correct 376 ms 78680 KB Output is correct
26 Correct 94 ms 44992 KB Output is correct
27 Correct 92 ms 45244 KB Output is correct
28 Correct 92 ms 44992 KB Output is correct
29 Correct 92 ms 43712 KB Output is correct
30 Correct 81 ms 45244 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 50860 KB Output is correct
2 Correct 295 ms 76740 KB Output is correct
3 Correct 312 ms 76852 KB Output is correct
4 Correct 54 ms 40388 KB Output is correct
5 Correct 303 ms 77588 KB Output is correct
6 Correct 297 ms 76652 KB Output is correct
7 Correct 322 ms 76752 KB Output is correct
8 Correct 311 ms 77368 KB Output is correct
9 Correct 333 ms 76700 KB Output is correct
10 Correct 324 ms 76920 KB Output is correct
11 Correct 332 ms 77056 KB Output is correct
12 Correct 324 ms 77472 KB Output is correct
13 Correct 293 ms 77340 KB Output is correct
14 Correct 322 ms 76640 KB Output is correct
15 Correct 319 ms 77340 KB Output is correct
16 Correct 313 ms 77288 KB Output is correct
17 Correct 299 ms 76764 KB Output is correct
18 Correct 298 ms 77372 KB Output is correct
19 Correct 46 ms 41920 KB Output is correct
20 Correct 309 ms 77316 KB Output is correct
21 Correct 231 ms 78904 KB Output is correct
22 Correct 71 ms 43708 KB Output is correct
23 Correct 64 ms 38292 KB Output is correct
24 Correct 75 ms 43708 KB Output is correct
25 Correct 82 ms 42072 KB Output is correct
26 Correct 79 ms 39236 KB Output is correct
27 Correct 60 ms 41720 KB Output is correct
28 Correct 74 ms 43720 KB Output is correct
29 Correct 56 ms 41152 KB Output is correct
30 Correct 71 ms 43708 KB Output is correct
31 Correct 57 ms 41156 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 3 ms 13004 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12944 KB Output is correct
6 Correct 3 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 2 ms 12820 KB Output is correct
10 Correct 2 ms 13060 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 3 ms 12888 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 116 ms 38472 KB Output is correct
17 Correct 376 ms 78932 KB Output is correct
18 Correct 26 ms 18896 KB Output is correct
19 Correct 92 ms 43712 KB Output is correct
20 Correct 391 ms 78804 KB Output is correct
21 Correct 190 ms 54892 KB Output is correct
22 Correct 76 ms 44216 KB Output is correct
23 Correct 428 ms 78972 KB Output is correct
24 Correct 367 ms 79068 KB Output is correct
25 Correct 376 ms 78680 KB Output is correct
26 Correct 94 ms 44992 KB Output is correct
27 Correct 92 ms 45244 KB Output is correct
28 Correct 92 ms 44992 KB Output is correct
29 Correct 92 ms 43712 KB Output is correct
30 Correct 81 ms 45244 KB Output is correct
31 Correct 1 ms 12888 KB Output is correct
32 Correct 2 ms 12892 KB Output is correct
33 Correct 1 ms 12892 KB Output is correct
34 Correct 1 ms 12960 KB Output is correct
35 Correct 1 ms 12892 KB Output is correct
36 Correct 2 ms 12892 KB Output is correct
37 Correct 1 ms 12892 KB Output is correct
38 Correct 1 ms 12892 KB Output is correct
39 Correct 1 ms 12892 KB Output is correct
40 Correct 1 ms 12892 KB Output is correct
41 Correct 154 ms 50860 KB Output is correct
42 Correct 295 ms 76740 KB Output is correct
43 Correct 312 ms 76852 KB Output is correct
44 Correct 54 ms 40388 KB Output is correct
45 Correct 303 ms 77588 KB Output is correct
46 Correct 297 ms 76652 KB Output is correct
47 Correct 322 ms 76752 KB Output is correct
48 Correct 311 ms 77368 KB Output is correct
49 Correct 333 ms 76700 KB Output is correct
50 Correct 324 ms 76920 KB Output is correct
51 Correct 332 ms 77056 KB Output is correct
52 Correct 324 ms 77472 KB Output is correct
53 Correct 293 ms 77340 KB Output is correct
54 Correct 322 ms 76640 KB Output is correct
55 Correct 319 ms 77340 KB Output is correct
56 Correct 313 ms 77288 KB Output is correct
57 Correct 299 ms 76764 KB Output is correct
58 Correct 298 ms 77372 KB Output is correct
59 Correct 46 ms 41920 KB Output is correct
60 Correct 309 ms 77316 KB Output is correct
61 Correct 231 ms 78904 KB Output is correct
62 Correct 71 ms 43708 KB Output is correct
63 Correct 64 ms 38292 KB Output is correct
64 Correct 75 ms 43708 KB Output is correct
65 Correct 82 ms 42072 KB Output is correct
66 Correct 79 ms 39236 KB Output is correct
67 Correct 60 ms 41720 KB Output is correct
68 Correct 74 ms 43720 KB Output is correct
69 Correct 56 ms 41152 KB Output is correct
70 Correct 71 ms 43708 KB Output is correct
71 Correct 57 ms 41156 KB Output is correct
72 Correct 196 ms 52700 KB Output is correct
73 Correct 360 ms 79068 KB Output is correct
74 Correct 344 ms 77944 KB Output is correct
75 Correct 355 ms 79552 KB Output is correct
76 Correct 352 ms 78812 KB Output is correct
77 Correct 410 ms 79164 KB Output is correct
78 Correct 378 ms 78344 KB Output is correct
79 Correct 367 ms 78932 KB Output is correct
80 Correct 356 ms 78488 KB Output is correct
81 Correct 380 ms 78996 KB Output is correct
82 Correct 392 ms 79168 KB Output is correct
83 Correct 386 ms 79140 KB Output is correct
84 Correct 381 ms 78072 KB Output is correct
85 Correct 427 ms 78964 KB Output is correct
86 Correct 364 ms 79168 KB Output is correct
87 Correct 342 ms 79164 KB Output is correct
88 Correct 366 ms 78968 KB Output is correct
89 Correct 107 ms 43192 KB Output is correct
90 Correct 368 ms 79156 KB Output is correct
91 Correct 299 ms 80704 KB Output is correct
92 Correct 91 ms 43708 KB Output is correct
93 Correct 109 ms 40584 KB Output is correct
94 Correct 95 ms 44992 KB Output is correct
95 Correct 79 ms 43708 KB Output is correct
96 Correct 126 ms 40256 KB Output is correct
97 Correct 134 ms 42428 KB Output is correct
98 Correct 99 ms 43704 KB Output is correct
99 Correct 107 ms 43584 KB Output is correct
100 Correct 93 ms 43708 KB Output is correct