oj.uz

Submission #501360

# Submission time Handle Problem Language Result Execution time Memory
501360 2022-01-02T22:15:27 Z NachoLibre Evacuation plan (IZhO18_plan) C++17
100 / 100
 576 ms 36868 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;

const int N = 100005, M = 17;
vector<int> dyup(N, -1);
int up[N][M];
int P(int x) {
	return dyup[x] < 0 ? x : dyup[x] = P(dyup[x]);
}
void H(int x, int y) {
	if(P(y) == x) return;
	up[P(y)][0] = x;
	dyup[P(y)] = x;
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	#ifdef wambule
	freopen("Untitledfile.txt", "r", stdin);
	#endif
	int n, m;
	cin >> n >> m;
	vector<array<int, 2>> v1[n + 1];
	for(int i = 1; i <= m; ++i) {
		int x, y, z;
		cin >> x >> y >> z;
		v1[x].push_back({y, z});
		v1[y].push_back({x, z});
	}
	int k;
	cin >> k;
	set<array<int, 2>> s1;
	vector<int> d(n + 1, -1);
	for(int i = 1; i <= k; ++i) {
		int x;
		cin >> x;
		s1.insert({0, x});
		d[x] = 0;
	}
	while(s1.size()) {
		int x = (*s1.begin())[1];
		s1.erase(s1.begin());
		for(auto y : v1[x]) {
			if(d[y[0]] == -1 || d[y[0]] > d[x] + y[1]) {
				if(d[y[0]] != -1) s1.erase({d[y[0]], y[0]});
				d[y[0]] = d[x] + y[1];
				s1.insert({d[y[0]], y[0]});
			}
		}
	}
	vector<array<int, 2>> v2;
	for(int i = 1; i <= n; ++i) {
		v2.push_back({d[i], i});
	}
	sort(all(v2));
	reverse(all(v2));
	vector<bool> cc(n + 1);
	for(auto x : v2) {
		cc[x[1]] = 1;
		for(auto y : v1[x[1]]) {
			if(!cc[y[0]]) continue;
			H(x[1], y[0]);
		}
	}
	for(int j = 1; j < M; ++j) {
		for(int i = 1; i <= n; ++i) {
			up[i][j] = up[up[i][j - 1]][j - 1];
		}
	}
	vector<int> dt(n + 1);
	for(int i = 1; i <= n; ++i) {
		int x = i;
		for(int j = M - 1; j >= 0; --j) {
			if(up[x][j] != 0) {
				x = up[x][j];
				dt[i] |= (1 << j);
			}
		}
	}
	int q;
	cin >> q;
	for(int i = 1; i <= q; ++i) {
		int x, y;
		cin >> x >> y;
		if(dt[x] < dt[y]) { swap(x, y); }
		for(int j = M - 1; j >= 0; --j) {
			if(dt[x] - (1 << j) >= dt[y]) {
				x = up[x][j];
			}
		}
		int ap = 0;
		if(x == y) {
			ap = d[x];
		} else {
			for(int j = M - 1; j >= 0; --j) {
				if(up[x][j] != up[y][j]) {
					x = up[x][j];
					y = up[y][j];
				}
			}
			ap = d[up[x][0]];
		}
		cout << ap << "\n";
	}
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 1 ms 928 KB Output is correct
3 Correct 1 ms 844 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 844 KB Output is correct
6 Correct 2 ms 864 KB Output is correct
7 Correct 1 ms 720 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 864 KB Output is correct
10 Correct 2 ms 868 KB Output is correct
11 Correct 2 ms 868 KB Output is correct
12 Correct 2 ms 844 KB Output is correct
13 Correct 2 ms 844 KB Output is correct
14 Correct 1 ms 844 KB Output is correct
15 Correct 1 ms 864 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 1 ms 928 KB Output is correct
3 Correct 1 ms 844 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 844 KB Output is correct
6 Correct 2 ms 864 KB Output is correct
7 Correct 1 ms 720 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 864 KB Output is correct
10 Correct 2 ms 868 KB Output is correct
11 Correct 2 ms 868 KB Output is correct
12 Correct 2 ms 844 KB Output is correct
13 Correct 2 ms 844 KB Output is correct
14 Correct 1 ms 844 KB Output is correct
15 Correct 1 ms 864 KB Output is correct
16 Correct 143 ms 16348 KB Output is correct
17 Correct 525 ms 36568 KB Output is correct
18 Correct 30 ms 4120 KB Output is correct
19 Correct 135 ms 21968 KB Output is correct
20 Correct 500 ms 36608 KB Output is correct
21 Correct 250 ms 24720 KB Output is correct
22 Correct 127 ms 18176 KB Output is correct
23 Correct 504 ms 36572 KB Output is correct
24 Correct 576 ms 36584 KB Output is correct
25 Correct 513 ms 36740 KB Output is correct
26 Correct 130 ms 21680 KB Output is correct
27 Correct 124 ms 21796 KB Output is correct
28 Correct 128 ms 21736 KB Output is correct
29 Correct 138 ms 21880 KB Output is correct
30 Correct 129 ms 21892 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 22472 KB Output is correct
2 Correct 430 ms 35028 KB Output is correct
3 Correct 424 ms 35020 KB Output is correct
4 Correct 77 ms 15936 KB Output is correct
5 Correct 435 ms 35000 KB Output is correct
6 Correct 436 ms 35052 KB Output is correct
7 Correct 423 ms 35152 KB Output is correct
8 Correct 427 ms 35088 KB Output is correct
9 Correct 438 ms 34864 KB Output is correct
10 Correct 425 ms 34884 KB Output is correct
11 Correct 435 ms 34984 KB Output is correct
12 Correct 451 ms 34876 KB Output is correct
13 Correct 453 ms 35096 KB Output is correct
14 Correct 453 ms 35000 KB Output is correct
15 Correct 460 ms 35096 KB Output is correct
16 Correct 453 ms 34984 KB Output is correct
17 Correct 456 ms 34928 KB Output is correct
18 Correct 467 ms 35060 KB Output is correct
19 Correct 81 ms 16008 KB Output is correct
20 Correct 446 ms 35104 KB Output is correct
21 Correct 406 ms 36252 KB Output is correct
22 Correct 100 ms 20300 KB Output is correct
23 Correct 84 ms 16488 KB Output is correct
24 Correct 99 ms 20264 KB Output is correct
25 Correct 97 ms 20356 KB Output is correct
26 Correct 98 ms 16880 KB Output is correct
27 Correct 81 ms 16032 KB Output is correct
28 Correct 99 ms 20184 KB Output is correct
29 Correct 81 ms 15944 KB Output is correct
30 Correct 100 ms 20328 KB Output is correct
31 Correct 83 ms 16000 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 1 ms 928 KB Output is correct
3 Correct 1 ms 844 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 844 KB Output is correct
6 Correct 2 ms 864 KB Output is correct
7 Correct 1 ms 720 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 864 KB Output is correct
10 Correct 2 ms 868 KB Output is correct
11 Correct 2 ms 868 KB Output is correct
12 Correct 2 ms 844 KB Output is correct
13 Correct 2 ms 844 KB Output is correct
14 Correct 1 ms 844 KB Output is correct
15 Correct 1 ms 864 KB Output is correct
16 Correct 143 ms 16348 KB Output is correct
17 Correct 525 ms 36568 KB Output is correct
18 Correct 30 ms 4120 KB Output is correct
19 Correct 135 ms 21968 KB Output is correct
20 Correct 500 ms 36608 KB Output is correct
21 Correct 250 ms 24720 KB Output is correct
22 Correct 127 ms 18176 KB Output is correct
23 Correct 504 ms 36572 KB Output is correct
24 Correct 576 ms 36584 KB Output is correct
25 Correct 513 ms 36740 KB Output is correct
26 Correct 130 ms 21680 KB Output is correct
27 Correct 124 ms 21796 KB Output is correct
28 Correct 128 ms 21736 KB Output is correct
29 Correct 138 ms 21880 KB Output is correct
30 Correct 129 ms 21892 KB Output is correct
31 Correct 1 ms 716 KB Output is correct
32 Correct 1 ms 716 KB Output is correct
33 Correct 1 ms 728 KB Output is correct
34 Correct 1 ms 716 KB Output is correct
35 Correct 1 ms 716 KB Output is correct
36 Correct 1 ms 716 KB Output is correct
37 Correct 1 ms 716 KB Output is correct
38 Correct 1 ms 716 KB Output is correct
39 Correct 1 ms 588 KB Output is correct
40 Correct 1 ms 716 KB Output is correct
41 Correct 211 ms 22472 KB Output is correct
42 Correct 430 ms 35028 KB Output is correct
43 Correct 424 ms 35020 KB Output is correct
44 Correct 77 ms 15936 KB Output is correct
45 Correct 435 ms 35000 KB Output is correct
46 Correct 436 ms 35052 KB Output is correct
47 Correct 423 ms 35152 KB Output is correct
48 Correct 427 ms 35088 KB Output is correct
49 Correct 438 ms 34864 KB Output is correct
50 Correct 425 ms 34884 KB Output is correct
51 Correct 435 ms 34984 KB Output is correct
52 Correct 451 ms 34876 KB Output is correct
53 Correct 453 ms 35096 KB Output is correct
54 Correct 453 ms 35000 KB Output is correct
55 Correct 460 ms 35096 KB Output is correct
56 Correct 453 ms 34984 KB Output is correct
57 Correct 456 ms 34928 KB Output is correct
58 Correct 467 ms 35060 KB Output is correct
59 Correct 81 ms 16008 KB Output is correct
60 Correct 446 ms 35104 KB Output is correct
61 Correct 406 ms 36252 KB Output is correct
62 Correct 100 ms 20300 KB Output is correct
63 Correct 84 ms 16488 KB Output is correct
64 Correct 99 ms 20264 KB Output is correct
65 Correct 97 ms 20356 KB Output is correct
66 Correct 98 ms 16880 KB Output is correct
67 Correct 81 ms 16032 KB Output is correct
68 Correct 99 ms 20184 KB Output is correct
69 Correct 81 ms 15944 KB Output is correct
70 Correct 100 ms 20328 KB Output is correct
71 Correct 83 ms 16000 KB Output is correct
72 Correct 275 ms 24072 KB Output is correct
73 Correct 523 ms 36644 KB Output is correct
74 Correct 517 ms 36708 KB Output is correct
75 Correct 518 ms 36636 KB Output is correct
76 Correct 518 ms 36700 KB Output is correct
77 Correct 521 ms 36744 KB Output is correct
78 Correct 542 ms 36644 KB Output is correct
79 Correct 509 ms 36548 KB Output is correct
80 Correct 520 ms 36636 KB Output is correct
81 Correct 515 ms 36636 KB Output is correct
82 Correct 515 ms 36604 KB Output is correct
83 Correct 533 ms 36552 KB Output is correct
84 Correct 563 ms 36704 KB Output is correct
85 Correct 535 ms 36660 KB Output is correct
86 Correct 545 ms 36664 KB Output is correct
87 Correct 519 ms 36676 KB Output is correct
88 Correct 534 ms 36676 KB Output is correct
89 Correct 163 ms 18216 KB Output is correct
90 Correct 524 ms 36636 KB Output is correct
91 Correct 456 ms 36868 KB Output is correct
92 Correct 140 ms 21784 KB Output is correct
93 Correct 147 ms 18484 KB Output is correct
94 Correct 139 ms 21816 KB Output is correct
95 Correct 133 ms 21840 KB Output is correct
96 Correct 143 ms 18392 KB Output is correct
97 Correct 155 ms 17800 KB Output is correct
98 Correct 133 ms 21752 KB Output is correct
99 Correct 175 ms 17744 KB Output is correct
100 Correct 138 ms 21816 KB Output is correct