oj.uz

Submission #508776

# Submission time Handle Problem Language Result Execution time Memory
508776 2022-01-13T17:54:47 Z thiago_bastos Evacuation plan (IZhO18_plan) C++17
100 / 100
 464 ms 34892 KB 
#include "bits/stdc++.h"

using namespace std;

using i64 = long long;
using u64 = unsigned long long;
using i32 = int;
using u32 = unsigned;
using i16 = short;
using u16 = unsigned short;
using ld = long double;
using ii = pair<int, int>;

int n, m, k, q;
vector<vector<ii>> G;

auto dijkstra(vector<int>& v) {
	priority_queue<pair<i64, int>> pq;
	vector<i64> cost(n, -1);
	for(int u : v) pq.emplace(0LL, u);
	while(!pq.empty()) {
		auto [c, v] = pq.top();
		pq.pop();
		c *= -1;
		if(cost[v] != -1) continue;
		cost[v] = c;
		for(auto [u, w] : G[v]) {
			if(cost[u] != -1) continue;
			pq.emplace(-c - w, u);
		}
	}
	return cost;
}

vector<int> pai, rnk;
vector<i64> lb;

int findSet(int v) {
	return v == pai[v] ? v : findSet(pai[v]);
}

int depth(int u) {
	return u == pai[u] ? 0 : 1 + depth(pai[u]);
}

void join(int u, int v, i64 x) {
	u = findSet(u);
	v = findSet(v);
	if(u == v) return;
	else if(rnk[u] > rnk[v]) swap(u, v);
	lb[u] = x;
	pai[u] = v;
	rnk[v] += rnk[u] == rnk[v];
}

void solve() {	
	
	cin >> n >> m;

	G.resize(n);

	for(int i = 0; i < m; ++i) {
		int a, b, c;
		cin >> a >> b >> c;
		--a, --b;
		G[a].emplace_back(b, c);
		G[b].emplace_back(a, c);
	}

	cin >> k;

	vector<int> npp(k);

	for(int& v : npp) {
		cin >> v;
		--v;
	}

	auto cost = dijkstra(npp);

	vector<pair<i64, int>> s(n);

	for(int i = 0; i < n; ++i) s[i] = {cost[i], i};

	sort(s.rbegin(), s.rend());

	pai.resize(n);
	rnk.assign(n, 0);
	lb.resize(n);
	iota(pai.begin(), pai.end(), 0);

	for(auto [c, v] : s) {
		for(auto [u, w] : G[v]) {
			if(make_pair(cost[u], u) > make_pair(c, v))
				join(u, v, c);
		}
	}

	cin >> q;

	while(q--) {
		int s, t;
		cin >> s >> t;

		--s, --t;

		int ds = depth(s), dt = depth(t);
		i64 ans = LLONG_MAX;

		while(s != t) {
			if(ds > dt) ans = min(ans, lb[s]), s = pai[s], --ds;
			else if(ds < dt) ans = min(ans, lb[t]), t = pai[t], --dt;
			else ans = min(ans, min(lb[s], lb[t])), s = pai[s], t = pai[t];
		}

		cout << ans << '\n';
	}
}

int main() {
	ios_base :: sync_with_stdio(false);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) solve();
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 0 ms 308 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 0 ms 308 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 106 ms 11996 KB Output is correct
17 Correct 432 ms 34096 KB Output is correct
18 Correct 26 ms 3260 KB Output is correct
19 Correct 112 ms 13796 KB Output is correct
20 Correct 407 ms 34096 KB Output is correct
21 Correct 197 ms 18168 KB Output is correct
22 Correct 76 ms 13380 KB Output is correct
23 Correct 463 ms 34092 KB Output is correct
24 Correct 410 ms 34076 KB Output is correct
25 Correct 418 ms 34188 KB Output is correct
26 Correct 93 ms 13536 KB Output is correct
27 Correct 100 ms 13672 KB Output is correct
28 Correct 102 ms 13500 KB Output is correct
29 Correct 90 ms 13724 KB Output is correct
30 Correct 97 ms 13716 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 16188 KB Output is correct
2 Correct 426 ms 33852 KB Output is correct
3 Correct 379 ms 33844 KB Output is correct
4 Correct 57 ms 11288 KB Output is correct
5 Correct 435 ms 33944 KB Output is correct
6 Correct 403 ms 33912 KB Output is correct
7 Correct 363 ms 33956 KB Output is correct
8 Correct 445 ms 34004 KB Output is correct
9 Correct 434 ms 33888 KB Output is correct
10 Correct 443 ms 33924 KB Output is correct
11 Correct 388 ms 33904 KB Output is correct
12 Correct 376 ms 33976 KB Output is correct
13 Correct 383 ms 33812 KB Output is correct
14 Correct 431 ms 33956 KB Output is correct
15 Correct 398 ms 33996 KB Output is correct
16 Correct 415 ms 33916 KB Output is correct
17 Correct 380 ms 33908 KB Output is correct
18 Correct 394 ms 33864 KB Output is correct
19 Correct 55 ms 11300 KB Output is correct
20 Correct 425 ms 33960 KB Output is correct
21 Correct 388 ms 34660 KB Output is correct
22 Correct 80 ms 12060 KB Output is correct
23 Correct 62 ms 11812 KB Output is correct
24 Correct 77 ms 12092 KB Output is correct
25 Correct 68 ms 12104 KB Output is correct
26 Correct 66 ms 11932 KB Output is correct
27 Correct 53 ms 11340 KB Output is correct
28 Correct 81 ms 12048 KB Output is correct
29 Correct 62 ms 11284 KB Output is correct
30 Correct 76 ms 12188 KB Output is correct
31 Correct 67 ms 11296 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 0 ms 308 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 106 ms 11996 KB Output is correct
17 Correct 432 ms 34096 KB Output is correct
18 Correct 26 ms 3260 KB Output is correct
19 Correct 112 ms 13796 KB Output is correct
20 Correct 407 ms 34096 KB Output is correct
21 Correct 197 ms 18168 KB Output is correct
22 Correct 76 ms 13380 KB Output is correct
23 Correct 463 ms 34092 KB Output is correct
24 Correct 410 ms 34076 KB Output is correct
25 Correct 418 ms 34188 KB Output is correct
26 Correct 93 ms 13536 KB Output is correct
27 Correct 100 ms 13672 KB Output is correct
28 Correct 102 ms 13500 KB Output is correct
29 Correct 90 ms 13724 KB Output is correct
30 Correct 97 ms 13716 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 288 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 316 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 ms 308 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 166 ms 16188 KB Output is correct
42 Correct 426 ms 33852 KB Output is correct
43 Correct 379 ms 33844 KB Output is correct
44 Correct 57 ms 11288 KB Output is correct
45 Correct 435 ms 33944 KB Output is correct
46 Correct 403 ms 33912 KB Output is correct
47 Correct 363 ms 33956 KB Output is correct
48 Correct 445 ms 34004 KB Output is correct
49 Correct 434 ms 33888 KB Output is correct
50 Correct 443 ms 33924 KB Output is correct
51 Correct 388 ms 33904 KB Output is correct
52 Correct 376 ms 33976 KB Output is correct
53 Correct 383 ms 33812 KB Output is correct
54 Correct 431 ms 33956 KB Output is correct
55 Correct 398 ms 33996 KB Output is correct
56 Correct 415 ms 33916 KB Output is correct
57 Correct 380 ms 33908 KB Output is correct
58 Correct 394 ms 33864 KB Output is correct
59 Correct 55 ms 11300 KB Output is correct
60 Correct 425 ms 33960 KB Output is correct
61 Correct 388 ms 34660 KB Output is correct
62 Correct 80 ms 12060 KB Output is correct
63 Correct 62 ms 11812 KB Output is correct
64 Correct 77 ms 12092 KB Output is correct
65 Correct 68 ms 12104 KB Output is correct
66 Correct 66 ms 11932 KB Output is correct
67 Correct 53 ms 11340 KB Output is correct
68 Correct 81 ms 12048 KB Output is correct
69 Correct 62 ms 11284 KB Output is correct
70 Correct 76 ms 12188 KB Output is correct
71 Correct 67 ms 11296 KB Output is correct
72 Correct 237 ms 17984 KB Output is correct
73 Correct 464 ms 34068 KB Output is correct
74 Correct 435 ms 34084 KB Output is correct
75 Correct 446 ms 34064 KB Output is correct
76 Correct 444 ms 33984 KB Output is correct
77 Correct 430 ms 34040 KB Output is correct
78 Correct 404 ms 33996 KB Output is correct
79 Correct 446 ms 34012 KB Output is correct
80 Correct 400 ms 34072 KB Output is correct
81 Correct 444 ms 34076 KB Output is correct
82 Correct 418 ms 34044 KB Output is correct
83 Correct 438 ms 34084 KB Output is correct
84 Correct 429 ms 34088 KB Output is correct
85 Correct 427 ms 34176 KB Output is correct
86 Correct 447 ms 34112 KB Output is correct
87 Correct 420 ms 34244 KB Output is correct
88 Correct 413 ms 34076 KB Output is correct
89 Correct 79 ms 13432 KB Output is correct
90 Correct 406 ms 34104 KB Output is correct
91 Correct 427 ms 34892 KB Output is correct
92 Correct 105 ms 13644 KB Output is correct
93 Correct 93 ms 13764 KB Output is correct
94 Correct 94 ms 13480 KB Output is correct
95 Correct 113 ms 13596 KB Output is correct
96 Correct 108 ms 13424 KB Output is correct
97 Correct 75 ms 13028 KB Output is correct
98 Correct 90 ms 13556 KB Output is correct
99 Correct 85 ms 13060 KB Output is correct
100 Correct 92 ms 13616 KB Output is correct