oj.uz

Submission #391462

# Submission time Handle Problem Language Result Execution time Memory
391462 2021-04-18T19:27:20 Z saarang123 Evacuation plan (IZhO18_plan) C++17
100 / 100
 605 ms 43916 KB 
#include <bits/stdc++.h>
using namespace std;
struct DSU {
    int n;
    vector<int> e;
    DSU(int _) : n(_), e(_ + 1, -1) {}
    inline int root(int x) {
        return (e[x] < 0 ? x : (e[x] = root(e[x])));
    }
    inline bool same(int x, int y) { return root(x) == root(y); }
    inline bool join(int x, int y) {
        x = root(x), y = root(y); if(x == y) return false;
        if(e[y] < e[x]) swap(x, y);
        e[x] += e[y];
        e[y] = x;
        return true;
    }
};
const int mxn = 100 * 1000 + 3, lgn = 18;
vector<array<int, 2>> adj[mxn], g[mxn];
int dt[mxn], dist[mxn], up[mxn][lgn], mx[mxn][lgn];
int n, m;

void init(int v = 1, int p = 1) {
	up[v][0] = p;
	for(int i = 1; i < lgn; i++) {
		up[v][i] = up[up[v][i - 1]][i - 1];
		mx[v][i] = min(mx[up[v][i - 1]][i - 1], mx[v][i - 1]);
	}
	for(auto &[u, w] : g[v]) if(u != p) {
		dt[u] = dt[v] + 1;
		mx[u][0] = w;
		init(u, v);
	}
}

array<int, 2> kth(int v, int di) {
	int x = dist[0];
	for(int i = 0; i < lgn; i++)
		if(di >> i & 1) {
			x = min(x, mx[v][i]); v = up[v][i];
		}
	return {v, x};
}

int query(int a, int b) {
	if(dt[a] > dt[b])
		swap(a, b);
	auto [c, res] = kth(b, dt[b] - dt[a]);
	if(a == c)
		return res;
	for(int i = lgn - 1; i >= 0; i--) 
		if(up[a][i] != up[c][i]) {
			res = min({res, mx[a][i], mx[c][i]});
			a = up[a][i]; c = up[c][i];
		}
	res = min({res, mx[a][0], mx[c][0]});
	return res;
}

signed main() {
    std::ios::sync_with_stdio(0);
    std::cout.tie(0);
    std::cin.tie(0);
    #ifdef saarang
    freopen("/home/saarang/Documents/cp/input.txt", "r", stdin);
    freopen("/home/saarang/Documents/cp/output.txt", "w", stdout);
    #endif
    cin >> n >> m;
    memset(dist, 0x7f, sizeof dist);
    vector<array<int, 3>> ed;
    for(int u, v, w, i = 0; i < m; i++) {
    	cin >> u >> v >> w;
    	adj[u].push_back({v, w});
    	adj[v].push_back({u, w});
    	ed.push_back({w, u, v});
    }

    priority_queue<array<int, 2>, vector<array<int, 2>>, greater<>> pq;
    int k; cin >> k;
    for(int x, i = 0; i < k; i++) {
    	cin >> x;
    	dist[x] = 0;
    	pq.push({0, x});
    }
    while(!pq.empty()) {
    	auto [wt, v] = pq.top(); pq.pop();
    	if(dist[v] != wt) continue;
    	for(auto &[u, w] : adj[v]) if(dist[v] + w < dist[u]) {
    		dist[u] = dist[v] + w;
    		pq.push({dist[u], u});
    	}
    }

    for(auto &[w, u, v] : ed)
    	w = min(dist[u], dist[v]);
    sort(ed.begin(), ed.end(), greater<>());
    DSU uf(n);
    for(auto &[w, u, v] : ed) {
    	if(uf.join(u, v)) {
    		g[u].push_back({v, w});
    		g[v].push_back({u, w});
    	}
    }

    init();
    int q; cin >> q;
    while(q--) {
    	int u, v;
    	cin >> u >> v;
    	cout << query(u, v) << '\n';
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5324 KB Output is correct
2 Correct 5 ms 5632 KB Output is correct
3 Correct 5 ms 5580 KB Output is correct
4 Correct 4 ms 5324 KB Output is correct
5 Correct 4 ms 5580 KB Output is correct
6 Correct 6 ms 5580 KB Output is correct
7 Correct 4 ms 5452 KB Output is correct
8 Correct 4 ms 5452 KB Output is correct
9 Correct 5 ms 5580 KB Output is correct
10 Correct 5 ms 5584 KB Output is correct
11 Correct 5 ms 5588 KB Output is correct
12 Correct 5 ms 5632 KB Output is correct
13 Correct 5 ms 5580 KB Output is correct
14 Correct 5 ms 5580 KB Output is correct
15 Correct 5 ms 5580 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5324 KB Output is correct
2 Correct 5 ms 5632 KB Output is correct
3 Correct 5 ms 5580 KB Output is correct
4 Correct 4 ms 5324 KB Output is correct
5 Correct 4 ms 5580 KB Output is correct
6 Correct 6 ms 5580 KB Output is correct
7 Correct 4 ms 5452 KB Output is correct
8 Correct 4 ms 5452 KB Output is correct
9 Correct 5 ms 5580 KB Output is correct
10 Correct 5 ms 5584 KB Output is correct
11 Correct 5 ms 5588 KB Output is correct
12 Correct 5 ms 5632 KB Output is correct
13 Correct 5 ms 5580 KB Output is correct
14 Correct 5 ms 5580 KB Output is correct
15 Correct 5 ms 5580 KB Output is correct
16 Correct 189 ms 24812 KB Output is correct
17 Correct 602 ms 43792 KB Output is correct
18 Correct 39 ms 9372 KB Output is correct
19 Correct 158 ms 30380 KB Output is correct
20 Correct 593 ms 43776 KB Output is correct
21 Correct 317 ms 32884 KB Output is correct
22 Correct 198 ms 34976 KB Output is correct
23 Correct 582 ms 43704 KB Output is correct
24 Correct 590 ms 43780 KB Output is correct
25 Correct 595 ms 43748 KB Output is correct
26 Correct 156 ms 30184 KB Output is correct
27 Correct 158 ms 30312 KB Output is correct
28 Correct 164 ms 30216 KB Output is correct
29 Correct 157 ms 30352 KB Output is correct
30 Correct 159 ms 30436 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 32492 KB Output is correct
2 Correct 531 ms 43328 KB Output is correct
3 Correct 521 ms 43372 KB Output is correct
4 Correct 150 ms 31476 KB Output is correct
5 Correct 519 ms 43352 KB Output is correct
6 Correct 519 ms 43368 KB Output is correct
7 Correct 536 ms 43372 KB Output is correct
8 Correct 510 ms 43348 KB Output is correct
9 Correct 526 ms 43236 KB Output is correct
10 Correct 531 ms 43348 KB Output is correct
11 Correct 516 ms 43364 KB Output is correct
12 Correct 520 ms 43440 KB Output is correct
13 Correct 517 ms 43268 KB Output is correct
14 Correct 515 ms 43364 KB Output is correct
15 Correct 535 ms 43500 KB Output is correct
16 Correct 544 ms 43364 KB Output is correct
17 Correct 520 ms 43236 KB Output is correct
18 Correct 528 ms 43364 KB Output is correct
19 Correct 147 ms 33524 KB Output is correct
20 Correct 525 ms 43564 KB Output is correct
21 Correct 497 ms 43068 KB Output is correct
22 Correct 114 ms 30008 KB Output is correct
23 Correct 138 ms 29304 KB Output is correct
24 Correct 112 ms 29980 KB Output is correct
25 Correct 114 ms 30056 KB Output is correct
26 Correct 161 ms 30172 KB Output is correct
27 Correct 156 ms 33264 KB Output is correct
28 Correct 114 ms 30052 KB Output is correct
29 Correct 152 ms 32456 KB Output is correct
30 Correct 118 ms 30112 KB Output is correct
31 Correct 154 ms 32504 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5324 KB Output is correct
2 Correct 5 ms 5632 KB Output is correct
3 Correct 5 ms 5580 KB Output is correct
4 Correct 4 ms 5324 KB Output is correct
5 Correct 4 ms 5580 KB Output is correct
6 Correct 6 ms 5580 KB Output is correct
7 Correct 4 ms 5452 KB Output is correct
8 Correct 4 ms 5452 KB Output is correct
9 Correct 5 ms 5580 KB Output is correct
10 Correct 5 ms 5584 KB Output is correct
11 Correct 5 ms 5588 KB Output is correct
12 Correct 5 ms 5632 KB Output is correct
13 Correct 5 ms 5580 KB Output is correct
14 Correct 5 ms 5580 KB Output is correct
15 Correct 5 ms 5580 KB Output is correct
16 Correct 189 ms 24812 KB Output is correct
17 Correct 602 ms 43792 KB Output is correct
18 Correct 39 ms 9372 KB Output is correct
19 Correct 158 ms 30380 KB Output is correct
20 Correct 593 ms 43776 KB Output is correct
21 Correct 317 ms 32884 KB Output is correct
22 Correct 198 ms 34976 KB Output is correct
23 Correct 582 ms 43704 KB Output is correct
24 Correct 590 ms 43780 KB Output is correct
25 Correct 595 ms 43748 KB Output is correct
26 Correct 156 ms 30184 KB Output is correct
27 Correct 158 ms 30312 KB Output is correct
28 Correct 164 ms 30216 KB Output is correct
29 Correct 157 ms 30352 KB Output is correct
30 Correct 159 ms 30436 KB Output is correct
31 Correct 3 ms 5324 KB Output is correct
32 Correct 3 ms 5324 KB Output is correct
33 Correct 4 ms 5324 KB Output is correct
34 Correct 4 ms 5324 KB Output is correct
35 Correct 3 ms 5324 KB Output is correct
36 Correct 4 ms 5324 KB Output is correct
37 Correct 3 ms 5324 KB Output is correct
38 Correct 4 ms 5324 KB Output is correct
39 Correct 4 ms 5424 KB Output is correct
40 Correct 4 ms 5324 KB Output is correct
41 Correct 258 ms 32492 KB Output is correct
42 Correct 531 ms 43328 KB Output is correct
43 Correct 521 ms 43372 KB Output is correct
44 Correct 150 ms 31476 KB Output is correct
45 Correct 519 ms 43352 KB Output is correct
46 Correct 519 ms 43368 KB Output is correct
47 Correct 536 ms 43372 KB Output is correct
48 Correct 510 ms 43348 KB Output is correct
49 Correct 526 ms 43236 KB Output is correct
50 Correct 531 ms 43348 KB Output is correct
51 Correct 516 ms 43364 KB Output is correct
52 Correct 520 ms 43440 KB Output is correct
53 Correct 517 ms 43268 KB Output is correct
54 Correct 515 ms 43364 KB Output is correct
55 Correct 535 ms 43500 KB Output is correct
56 Correct 544 ms 43364 KB Output is correct
57 Correct 520 ms 43236 KB Output is correct
58 Correct 528 ms 43364 KB Output is correct
59 Correct 147 ms 33524 KB Output is correct
60 Correct 525 ms 43564 KB Output is correct
61 Correct 497 ms 43068 KB Output is correct
62 Correct 114 ms 30008 KB Output is correct
63 Correct 138 ms 29304 KB Output is correct
64 Correct 112 ms 29980 KB Output is correct
65 Correct 114 ms 30056 KB Output is correct
66 Correct 161 ms 30172 KB Output is correct
67 Correct 156 ms 33264 KB Output is correct
68 Correct 114 ms 30052 KB Output is correct
69 Correct 152 ms 32456 KB Output is correct
70 Correct 118 ms 30112 KB Output is correct
71 Correct 154 ms 32504 KB Output is correct
72 Correct 330 ms 33012 KB Output is correct
73 Correct 591 ms 43752 KB Output is correct
74 Correct 598 ms 43916 KB Output is correct
75 Correct 604 ms 43876 KB Output is correct
76 Correct 595 ms 43704 KB Output is correct
77 Correct 605 ms 43776 KB Output is correct
78 Correct 600 ms 43896 KB Output is correct
79 Correct 603 ms 43732 KB Output is correct
80 Correct 588 ms 43744 KB Output is correct
81 Correct 605 ms 43688 KB Output is correct
82 Correct 598 ms 43824 KB Output is correct
83 Correct 594 ms 43876 KB Output is correct
84 Correct 591 ms 43652 KB Output is correct
85 Correct 605 ms 43748 KB Output is correct
86 Correct 598 ms 43756 KB Output is correct
87 Correct 590 ms 43748 KB Output is correct
88 Correct 596 ms 43824 KB Output is correct
89 Correct 271 ms 33568 KB Output is correct
90 Correct 605 ms 43764 KB Output is correct
91 Correct 593 ms 43220 KB Output is correct
92 Correct 168 ms 30312 KB Output is correct
93 Correct 235 ms 30176 KB Output is correct
94 Correct 173 ms 30184 KB Output is correct
95 Correct 171 ms 30320 KB Output is correct
96 Correct 243 ms 29816 KB Output is correct
97 Correct 281 ms 32252 KB Output is correct
98 Correct 173 ms 30204 KB Output is correct
99 Correct 266 ms 33784 KB Output is correct
100 Correct 171 ms 30308 KB Output is correct