oj.uz

Submission #743563

# Submission time Handle Problem Language Result Execution time Memory
743563 2023-05-17T13:49:34 Z LeonaRaging Evacuation plan (IZhO18_plan) C++14
100 / 100
 1095 ms 33552 KB 
#include <bits/stdc++.h>
using namespace std;

#define T pair<int,int>
#define pb emplace_back
#define db(val) "[" #val " = " << (val) << "] "

const int maxn = 1e5 + 4;

struct DisjointSet {
	vector<int> par, Rank;
	DisjointSet(int n) {
		par.resize(n + 4); Rank.resize(n + 4);
		for (int i = 1; i <= n; i++)
			par[i] = i, Rank[i] = 1;
	}
	int find(int x) {
		if (x != par[x]) par[x] = find(par[x]);
		return par[x];
	}
	bool join(int u, int v) {
		u = find(u); v = find(v);
		if (u == v) return 0;
		if (Rank[u] < Rank[v]) swap(u, v);
		Rank[u] += Rank[v];
		par[v] = u;
		return 1;
	}
};

int n, m, dis[maxn], s[maxn], t[maxn], L[maxn], R[maxn], res[maxn];
vector<T> adj[maxn];
T node[maxn];
vector<int> vals, myVec[maxn];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for (int i = 1, u, v, w; i <= m; i++) {
    	cin >> u >> v >> w;
    	adj[u].pb(v, w);
    	adj[v].pb(u, w);
    }
    priority_queue<T, vector<T>, greater<T>> pq;
    int q; cin >> q;
    memset(dis, 63, sizeof dis);
    while (q--) {
    	int u; cin >> u;
    	pq.push({0, u});
    	dis[u] = 0;
    }
    while (!pq.empty()) {
    	int d, u; tie(d, u) = pq.top(); pq.pop();
    	node[u] = {dis[u], u};
    	if (dis[u] != d) continue;
    	for (auto it : adj[u]) {
    		int v, w; tie(v, w) = it;
    		if (dis[u] + w < dis[v])
    			dis[v] = dis[u] + w,
    			pq.push({dis[v], v});
    	}
    }
    sort(node + 1, node + 1 + n);
    sort(vals.begin(), vals.end());
    cin >> q;
    for (int i = 1; i <= q; i++)
    	cin >> s[i] >> t[i],
    	L[i] = 1, R[i] = n;
    for (int time = 1; time <= 17; time++) {
    	for (int i = 1; i <= q; i++)
    		myVec[(L[i] + R[i]) / 2].pb(i);
    	DisjointSet Dsu(n);
    	for (int i = n; i >= 1; i--) {
    		int u = node[i].second;
    		for (auto it : adj[u]) {
    			int v, w; tie(v, w) = it;
    			if (dis[v] >= dis[u])
    				Dsu.join(u, v);
    		}
    		while (!myVec[i].empty()) {
    			int id = myVec[i].back(); myVec[i].pop_back();
    			if (Dsu.find(s[id]) == Dsu.find(t[id]))
    				res[id] = dis[u],
    				L[id] = i + 1;
    			else R[id] = i - 1;
    		}
    	}
    }
    for (int i = 1; i <= q; i++)
    	cout << res[i] << '\n';
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5332 KB Output is correct
2 Correct 4 ms 5460 KB Output is correct
3 Correct 4 ms 5460 KB Output is correct
4 Correct 4 ms 5332 KB Output is correct
5 Correct 5 ms 5460 KB Output is correct
6 Correct 6 ms 5572 KB Output is correct
7 Correct 5 ms 5332 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 5 ms 5472 KB Output is correct
10 Correct 5 ms 5460 KB Output is correct
11 Correct 5 ms 5588 KB Output is correct
12 Correct 5 ms 5460 KB Output is correct
13 Correct 5 ms 5588 KB Output is correct
14 Correct 5 ms 5588 KB Output is correct
15 Correct 5 ms 5588 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5332 KB Output is correct
2 Correct 4 ms 5460 KB Output is correct
3 Correct 4 ms 5460 KB Output is correct
4 Correct 4 ms 5332 KB Output is correct
5 Correct 5 ms 5460 KB Output is correct
6 Correct 6 ms 5572 KB Output is correct
7 Correct 5 ms 5332 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 5 ms 5472 KB Output is correct
10 Correct 5 ms 5460 KB Output is correct
11 Correct 5 ms 5588 KB Output is correct
12 Correct 5 ms 5460 KB Output is correct
13 Correct 5 ms 5588 KB Output is correct
14 Correct 5 ms 5588 KB Output is correct
15 Correct 5 ms 5588 KB Output is correct
16 Correct 534 ms 21776 KB Output is correct
17 Correct 1095 ms 33532 KB Output is correct
18 Correct 58 ms 7940 KB Output is correct
19 Correct 218 ms 21144 KB Output is correct
20 Correct 985 ms 33484 KB Output is correct
21 Correct 525 ms 25624 KB Output is correct
22 Correct 289 ms 22456 KB Output is correct
23 Correct 914 ms 33544 KB Output is correct
24 Correct 885 ms 33392 KB Output is correct
25 Correct 886 ms 33448 KB Output is correct
26 Correct 202 ms 22092 KB Output is correct
27 Correct 206 ms 21012 KB Output is correct
28 Correct 208 ms 21340 KB Output is correct
29 Correct 207 ms 20556 KB Output is correct
30 Correct 195 ms 20800 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 431 ms 14040 KB Output is correct
2 Correct 709 ms 22016 KB Output is correct
3 Correct 713 ms 22032 KB Output is correct
4 Correct 139 ms 10172 KB Output is correct
5 Correct 713 ms 21928 KB Output is correct
6 Correct 712 ms 21920 KB Output is correct
7 Correct 710 ms 22024 KB Output is correct
8 Correct 785 ms 21984 KB Output is correct
9 Correct 776 ms 22072 KB Output is correct
10 Correct 802 ms 21976 KB Output is correct
11 Correct 798 ms 21956 KB Output is correct
12 Correct 798 ms 21980 KB Output is correct
13 Correct 806 ms 22012 KB Output is correct
14 Correct 754 ms 21956 KB Output is correct
15 Correct 783 ms 22396 KB Output is correct
16 Correct 746 ms 21968 KB Output is correct
17 Correct 764 ms 21968 KB Output is correct
18 Correct 767 ms 21984 KB Output is correct
19 Correct 128 ms 10196 KB Output is correct
20 Correct 758 ms 22020 KB Output is correct
21 Correct 588 ms 21820 KB Output is correct
22 Correct 146 ms 11668 KB Output is correct
23 Correct 209 ms 10648 KB Output is correct
24 Correct 142 ms 11664 KB Output is correct
25 Correct 156 ms 11664 KB Output is correct
26 Correct 215 ms 10752 KB Output is correct
27 Correct 147 ms 10124 KB Output is correct
28 Correct 146 ms 11660 KB Output is correct
29 Correct 161 ms 10120 KB Output is correct
30 Correct 149 ms 11572 KB Output is correct
31 Correct 143 ms 10096 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5332 KB Output is correct
2 Correct 4 ms 5460 KB Output is correct
3 Correct 4 ms 5460 KB Output is correct
4 Correct 4 ms 5332 KB Output is correct
5 Correct 5 ms 5460 KB Output is correct
6 Correct 6 ms 5572 KB Output is correct
7 Correct 5 ms 5332 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 5 ms 5472 KB Output is correct
10 Correct 5 ms 5460 KB Output is correct
11 Correct 5 ms 5588 KB Output is correct
12 Correct 5 ms 5460 KB Output is correct
13 Correct 5 ms 5588 KB Output is correct
14 Correct 5 ms 5588 KB Output is correct
15 Correct 5 ms 5588 KB Output is correct
16 Correct 534 ms 21776 KB Output is correct
17 Correct 1095 ms 33532 KB Output is correct
18 Correct 58 ms 7940 KB Output is correct
19 Correct 218 ms 21144 KB Output is correct
20 Correct 985 ms 33484 KB Output is correct
21 Correct 525 ms 25624 KB Output is correct
22 Correct 289 ms 22456 KB Output is correct
23 Correct 914 ms 33544 KB Output is correct
24 Correct 885 ms 33392 KB Output is correct
25 Correct 886 ms 33448 KB Output is correct
26 Correct 202 ms 22092 KB Output is correct
27 Correct 206 ms 21012 KB Output is correct
28 Correct 208 ms 21340 KB Output is correct
29 Correct 207 ms 20556 KB Output is correct
30 Correct 195 ms 20800 KB Output is correct
31 Correct 3 ms 5332 KB Output is correct
32 Correct 3 ms 5332 KB Output is correct
33 Correct 3 ms 5332 KB Output is correct
34 Correct 4 ms 5332 KB Output is correct
35 Correct 4 ms 5332 KB Output is correct
36 Correct 3 ms 5332 KB Output is correct
37 Correct 3 ms 5448 KB Output is correct
38 Correct 3 ms 5332 KB Output is correct
39 Correct 3 ms 5332 KB Output is correct
40 Correct 3 ms 5332 KB Output is correct
41 Correct 431 ms 14040 KB Output is correct
42 Correct 709 ms 22016 KB Output is correct
43 Correct 713 ms 22032 KB Output is correct
44 Correct 139 ms 10172 KB Output is correct
45 Correct 713 ms 21928 KB Output is correct
46 Correct 712 ms 21920 KB Output is correct
47 Correct 710 ms 22024 KB Output is correct
48 Correct 785 ms 21984 KB Output is correct
49 Correct 776 ms 22072 KB Output is correct
50 Correct 802 ms 21976 KB Output is correct
51 Correct 798 ms 21956 KB Output is correct
52 Correct 798 ms 21980 KB Output is correct
53 Correct 806 ms 22012 KB Output is correct
54 Correct 754 ms 21956 KB Output is correct
55 Correct 783 ms 22396 KB Output is correct
56 Correct 746 ms 21968 KB Output is correct
57 Correct 764 ms 21968 KB Output is correct
58 Correct 767 ms 21984 KB Output is correct
59 Correct 128 ms 10196 KB Output is correct
60 Correct 758 ms 22020 KB Output is correct
61 Correct 588 ms 21820 KB Output is correct
62 Correct 146 ms 11668 KB Output is correct
63 Correct 209 ms 10648 KB Output is correct
64 Correct 142 ms 11664 KB Output is correct
65 Correct 156 ms 11664 KB Output is correct
66 Correct 215 ms 10752 KB Output is correct
67 Correct 147 ms 10124 KB Output is correct
68 Correct 146 ms 11660 KB Output is correct
69 Correct 161 ms 10120 KB Output is correct
70 Correct 149 ms 11572 KB Output is correct
71 Correct 143 ms 10096 KB Output is correct
72 Correct 578 ms 24952 KB Output is correct
73 Correct 897 ms 33408 KB Output is correct
74 Correct 894 ms 33452 KB Output is correct
75 Correct 881 ms 33280 KB Output is correct
76 Correct 953 ms 33272 KB Output is correct
77 Correct 955 ms 33464 KB Output is correct
78 Correct 927 ms 33416 KB Output is correct
79 Correct 905 ms 33380 KB Output is correct
80 Correct 926 ms 33364 KB Output is correct
81 Correct 912 ms 33296 KB Output is correct
82 Correct 985 ms 33324 KB Output is correct
83 Correct 890 ms 33552 KB Output is correct
84 Correct 869 ms 33276 KB Output is correct
85 Correct 939 ms 33380 KB Output is correct
86 Correct 935 ms 33308 KB Output is correct
87 Correct 963 ms 33368 KB Output is correct
88 Correct 912 ms 33420 KB Output is correct
89 Correct 328 ms 22396 KB Output is correct
90 Correct 962 ms 33276 KB Output is correct
91 Correct 743 ms 31684 KB Output is correct
92 Correct 218 ms 21000 KB Output is correct
93 Correct 319 ms 21172 KB Output is correct
94 Correct 203 ms 22208 KB Output is correct
95 Correct 214 ms 20628 KB Output is correct
96 Correct 351 ms 20004 KB Output is correct
97 Correct 324 ms 21196 KB Output is correct
98 Correct 209 ms 21552 KB Output is correct
99 Correct 297 ms 21176 KB Output is correct
100 Correct 210 ms 21760 KB Output is correct