oj.uz

Submission #391461

# Submission time Handle Problem Language Result Execution time Memory
391461 2021-04-18T19:26:03 Z saarang123 Evacuation plan (IZhO18_plan) C++17
100 / 100
 612 ms 44820 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 4 ms 5324 KB Output is correct
2 Correct 5 ms 5580 KB Output is correct
3 Correct 5 ms 5580 KB Output is correct
4 Correct 4 ms 5324 KB Output is correct
5 Correct 5 ms 5580 KB Output is correct
6 Correct 5 ms 5668 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 5580 KB Output is correct
11 Correct 5 ms 5592 KB Output is correct
12 Correct 5 ms 5580 KB Output is correct
13 Correct 6 ms 5584 KB Output is correct
14 Correct 5 ms 5580 KB Output is correct
15 Correct 6 ms 5708 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5324 KB Output is correct
2 Correct 5 ms 5580 KB Output is correct
3 Correct 5 ms 5580 KB Output is correct
4 Correct 4 ms 5324 KB Output is correct
5 Correct 5 ms 5580 KB Output is correct
6 Correct 5 ms 5668 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 5580 KB Output is correct
11 Correct 5 ms 5592 KB Output is correct
12 Correct 5 ms 5580 KB Output is correct
13 Correct 6 ms 5584 KB Output is correct
14 Correct 5 ms 5580 KB Output is correct
15 Correct 6 ms 5708 KB Output is correct
16 Correct 192 ms 25564 KB Output is correct
17 Correct 612 ms 44504 KB Output is correct
18 Correct 41 ms 9596 KB Output is correct
19 Correct 161 ms 31036 KB Output is correct
20 Correct 588 ms 44340 KB Output is correct
21 Correct 325 ms 33388 KB Output is correct
22 Correct 206 ms 35164 KB Output is correct
23 Correct 588 ms 44804 KB Output is correct
24 Correct 605 ms 44820 KB Output is correct
25 Correct 589 ms 44820 KB Output is correct
26 Correct 157 ms 30900 KB Output is correct
27 Correct 160 ms 31004 KB Output is correct
28 Correct 160 ms 30888 KB Output is correct
29 Correct 162 ms 30960 KB Output is correct
30 Correct 162 ms 31116 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5400 KB Output is correct
2 Correct 4 ms 5324 KB Output is correct
3 Correct 4 ms 5324 KB Output is correct
4 Correct 4 ms 5404 KB Output is correct
5 Correct 4 ms 5324 KB Output is correct
6 Correct 4 ms 5324 KB Output is correct
7 Correct 4 ms 5324 KB Output is correct
8 Correct 4 ms 5324 KB Output is correct
9 Correct 4 ms 5324 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 260 ms 32772 KB Output is correct
2 Correct 528 ms 44000 KB Output is correct
3 Correct 522 ms 43876 KB Output is correct
4 Correct 151 ms 31888 KB Output is correct
5 Correct 513 ms 44368 KB Output is correct
6 Correct 519 ms 44388 KB Output is correct
7 Correct 522 ms 44516 KB Output is correct
8 Correct 533 ms 44384 KB Output is correct
9 Correct 524 ms 44432 KB Output is correct
10 Correct 523 ms 44396 KB Output is correct
11 Correct 515 ms 44388 KB Output is correct
12 Correct 520 ms 44548 KB Output is correct
13 Correct 532 ms 44388 KB Output is correct
14 Correct 521 ms 44404 KB Output is correct
15 Correct 533 ms 44532 KB Output is correct
16 Correct 527 ms 44328 KB Output is correct
17 Correct 514 ms 44460 KB Output is correct
18 Correct 526 ms 44528 KB Output is correct
19 Correct 147 ms 33912 KB Output is correct
20 Correct 523 ms 44400 KB Output is correct
21 Correct 496 ms 44136 KB Output is correct
22 Correct 115 ms 30312 KB Output is correct
23 Correct 142 ms 29568 KB Output is correct
24 Correct 114 ms 30272 KB Output is correct
25 Correct 116 ms 30308 KB Output is correct
26 Correct 165 ms 30252 KB Output is correct
27 Correct 156 ms 33568 KB Output is correct
28 Correct 122 ms 30364 KB Output is correct
29 Correct 154 ms 32672 KB Output is correct
30 Correct 119 ms 30352 KB Output is correct
31 Correct 155 ms 32804 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5324 KB Output is correct
2 Correct 5 ms 5580 KB Output is correct
3 Correct 5 ms 5580 KB Output is correct
4 Correct 4 ms 5324 KB Output is correct
5 Correct 5 ms 5580 KB Output is correct
6 Correct 5 ms 5668 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 5580 KB Output is correct
11 Correct 5 ms 5592 KB Output is correct
12 Correct 5 ms 5580 KB Output is correct
13 Correct 6 ms 5584 KB Output is correct
14 Correct 5 ms 5580 KB Output is correct
15 Correct 6 ms 5708 KB Output is correct
16 Correct 192 ms 25564 KB Output is correct
17 Correct 612 ms 44504 KB Output is correct
18 Correct 41 ms 9596 KB Output is correct
19 Correct 161 ms 31036 KB Output is correct
20 Correct 588 ms 44340 KB Output is correct
21 Correct 325 ms 33388 KB Output is correct
22 Correct 206 ms 35164 KB Output is correct
23 Correct 588 ms 44804 KB Output is correct
24 Correct 605 ms 44820 KB Output is correct
25 Correct 589 ms 44820 KB Output is correct
26 Correct 157 ms 30900 KB Output is correct
27 Correct 160 ms 31004 KB Output is correct
28 Correct 160 ms 30888 KB Output is correct
29 Correct 162 ms 30960 KB Output is correct
30 Correct 162 ms 31116 KB Output is correct
31 Correct 4 ms 5400 KB Output is correct
32 Correct 4 ms 5324 KB Output is correct
33 Correct 4 ms 5324 KB Output is correct
34 Correct 4 ms 5404 KB Output is correct
35 Correct 4 ms 5324 KB Output is correct
36 Correct 4 ms 5324 KB Output is correct
37 Correct 4 ms 5324 KB Output is correct
38 Correct 4 ms 5324 KB Output is correct
39 Correct 4 ms 5324 KB Output is correct
40 Correct 4 ms 5324 KB Output is correct
41 Correct 260 ms 32772 KB Output is correct
42 Correct 528 ms 44000 KB Output is correct
43 Correct 522 ms 43876 KB Output is correct
44 Correct 151 ms 31888 KB Output is correct
45 Correct 513 ms 44368 KB Output is correct
46 Correct 519 ms 44388 KB Output is correct
47 Correct 522 ms 44516 KB Output is correct
48 Correct 533 ms 44384 KB Output is correct
49 Correct 524 ms 44432 KB Output is correct
50 Correct 523 ms 44396 KB Output is correct
51 Correct 515 ms 44388 KB Output is correct
52 Correct 520 ms 44548 KB Output is correct
53 Correct 532 ms 44388 KB Output is correct
54 Correct 521 ms 44404 KB Output is correct
55 Correct 533 ms 44532 KB Output is correct
56 Correct 527 ms 44328 KB Output is correct
57 Correct 514 ms 44460 KB Output is correct
58 Correct 526 ms 44528 KB Output is correct
59 Correct 147 ms 33912 KB Output is correct
60 Correct 523 ms 44400 KB Output is correct
61 Correct 496 ms 44136 KB Output is correct
62 Correct 115 ms 30312 KB Output is correct
63 Correct 142 ms 29568 KB Output is correct
64 Correct 114 ms 30272 KB Output is correct
65 Correct 116 ms 30308 KB Output is correct
66 Correct 165 ms 30252 KB Output is correct
67 Correct 156 ms 33568 KB Output is correct
68 Correct 122 ms 30364 KB Output is correct
69 Correct 154 ms 32672 KB Output is correct
70 Correct 119 ms 30352 KB Output is correct
71 Correct 155 ms 32804 KB Output is correct
72 Correct 334 ms 33608 KB Output is correct
73 Correct 597 ms 44736 KB Output is correct
74 Correct 593 ms 44620 KB Output is correct
75 Correct 591 ms 44644 KB Output is correct
76 Correct 595 ms 44564 KB Output is correct
77 Correct 604 ms 44516 KB Output is correct
78 Correct 608 ms 44736 KB Output is correct
79 Correct 604 ms 44604 KB Output is correct
80 Correct 611 ms 44532 KB Output is correct
81 Correct 602 ms 44536 KB Output is correct
82 Correct 603 ms 44592 KB Output is correct
83 Correct 589 ms 44516 KB Output is correct
84 Correct 601 ms 44508 KB Output is correct
85 Correct 599 ms 44540 KB Output is correct
86 Correct 595 ms 44460 KB Output is correct
87 Correct 593 ms 44496 KB Output is correct
88 Correct 591 ms 44512 KB Output is correct
89 Correct 284 ms 33836 KB Output is correct
90 Correct 593 ms 44460 KB Output is correct
91 Correct 570 ms 44004 KB Output is correct
92 Correct 169 ms 30668 KB Output is correct
93 Correct 237 ms 30556 KB Output is correct
94 Correct 172 ms 30568 KB Output is correct
95 Correct 172 ms 30640 KB Output is correct
96 Correct 244 ms 29944 KB Output is correct
97 Correct 279 ms 32500 KB Output is correct
98 Correct 171 ms 30652 KB Output is correct
99 Correct 269 ms 34164 KB Output is correct
100 Correct 172 ms 30696 KB Output is correct