oj.uz

Submission #743561

# Submission time Handle Problem Language Result Execution time Memory
743561 2023-05-17T13:48:18 Z LeonaRaging Evacuation plan (IZhO18_plan) C++14
100 / 100
 1657 ms 42984 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 <= 30; 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 4 ms 5460 KB Output is correct
2 Correct 5 ms 5588 KB Output is correct
3 Correct 5 ms 5552 KB Output is correct
4 Correct 3 ms 5412 KB Output is correct
5 Correct 5 ms 5468 KB Output is correct
6 Correct 5 ms 5588 KB Output is correct
7 Correct 3 ms 5416 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 6 ms 5588 KB Output is correct
10 Correct 6 ms 5588 KB Output is correct
11 Correct 5 ms 5588 KB Output is correct
12 Correct 5 ms 5552 KB Output is correct
13 Correct 5 ms 5588 KB Output is correct
14 Correct 6 ms 5596 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 4 ms 5460 KB Output is correct
2 Correct 5 ms 5588 KB Output is correct
3 Correct 5 ms 5552 KB Output is correct
4 Correct 3 ms 5412 KB Output is correct
5 Correct 5 ms 5468 KB Output is correct
6 Correct 5 ms 5588 KB Output is correct
7 Correct 3 ms 5416 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 6 ms 5588 KB Output is correct
10 Correct 6 ms 5588 KB Output is correct
11 Correct 5 ms 5588 KB Output is correct
12 Correct 5 ms 5552 KB Output is correct
13 Correct 5 ms 5588 KB Output is correct
14 Correct 6 ms 5596 KB Output is correct
15 Correct 5 ms 5588 KB Output is correct
16 Correct 686 ms 24736 KB Output is correct
17 Correct 1461 ms 42984 KB Output is correct
18 Correct 74 ms 8748 KB Output is correct
19 Correct 292 ms 24064 KB Output is correct
20 Correct 1458 ms 42916 KB Output is correct
21 Correct 844 ms 30368 KB Output is correct
22 Correct 570 ms 25328 KB Output is correct
23 Correct 1442 ms 42904 KB Output is correct
24 Correct 1458 ms 42844 KB Output is correct
25 Correct 1435 ms 42872 KB Output is correct
26 Correct 328 ms 24984 KB Output is correct
27 Correct 293 ms 24124 KB Output is correct
28 Correct 297 ms 24284 KB Output is correct
29 Correct 315 ms 23532 KB Output is correct
30 Correct 292 ms 23872 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 5416 KB Output is correct
3 Correct 3 ms 5332 KB Output is correct
4 Correct 3 ms 5332 KB Output is correct
5 Correct 3 ms 5460 KB Output is correct
6 Correct 3 ms 5460 KB Output is correct
7 Correct 4 ms 5416 KB Output is correct
8 Correct 3 ms 5412 KB Output is correct
9 Correct 4 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 728 ms 17272 KB Output is correct
2 Correct 1088 ms 30076 KB Output is correct
3 Correct 1095 ms 30120 KB Output is correct
4 Correct 222 ms 11828 KB Output is correct
5 Correct 1082 ms 30148 KB Output is correct
6 Correct 1055 ms 30300 KB Output is correct
7 Correct 1137 ms 30168 KB Output is correct
8 Correct 1077 ms 30148 KB Output is correct
9 Correct 1042 ms 30032 KB Output is correct
10 Correct 1066 ms 30132 KB Output is correct
11 Correct 1070 ms 30216 KB Output is correct
12 Correct 1102 ms 30136 KB Output is correct
13 Correct 1044 ms 30016 KB Output is correct
14 Correct 1077 ms 30092 KB Output is correct
15 Correct 1079 ms 30492 KB Output is correct
16 Correct 1081 ms 30144 KB Output is correct
17 Correct 1196 ms 30076 KB Output is correct
18 Correct 1197 ms 30164 KB Output is correct
19 Correct 198 ms 11772 KB Output is correct
20 Correct 1147 ms 30076 KB Output is correct
21 Correct 962 ms 30204 KB Output is correct
22 Correct 304 ms 13340 KB Output is correct
23 Correct 312 ms 12288 KB Output is correct
24 Correct 245 ms 13340 KB Output is correct
25 Correct 275 ms 13336 KB Output is correct
26 Correct 361 ms 12420 KB Output is correct
27 Correct 251 ms 11860 KB Output is correct
28 Correct 247 ms 13336 KB Output is correct
29 Correct 247 ms 11776 KB Output is correct
30 Correct 234 ms 13300 KB Output is correct
31 Correct 248 ms 11768 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5460 KB Output is correct
2 Correct 5 ms 5588 KB Output is correct
3 Correct 5 ms 5552 KB Output is correct
4 Correct 3 ms 5412 KB Output is correct
5 Correct 5 ms 5468 KB Output is correct
6 Correct 5 ms 5588 KB Output is correct
7 Correct 3 ms 5416 KB Output is correct
8 Correct 3 ms 5332 KB Output is correct
9 Correct 6 ms 5588 KB Output is correct
10 Correct 6 ms 5588 KB Output is correct
11 Correct 5 ms 5588 KB Output is correct
12 Correct 5 ms 5552 KB Output is correct
13 Correct 5 ms 5588 KB Output is correct
14 Correct 6 ms 5596 KB Output is correct
15 Correct 5 ms 5588 KB Output is correct
16 Correct 686 ms 24736 KB Output is correct
17 Correct 1461 ms 42984 KB Output is correct
18 Correct 74 ms 8748 KB Output is correct
19 Correct 292 ms 24064 KB Output is correct
20 Correct 1458 ms 42916 KB Output is correct
21 Correct 844 ms 30368 KB Output is correct
22 Correct 570 ms 25328 KB Output is correct
23 Correct 1442 ms 42904 KB Output is correct
24 Correct 1458 ms 42844 KB Output is correct
25 Correct 1435 ms 42872 KB Output is correct
26 Correct 328 ms 24984 KB Output is correct
27 Correct 293 ms 24124 KB Output is correct
28 Correct 297 ms 24284 KB Output is correct
29 Correct 315 ms 23532 KB Output is correct
30 Correct 292 ms 23872 KB Output is correct
31 Correct 3 ms 5332 KB Output is correct
32 Correct 3 ms 5416 KB Output is correct
33 Correct 3 ms 5332 KB Output is correct
34 Correct 3 ms 5332 KB Output is correct
35 Correct 3 ms 5460 KB Output is correct
36 Correct 3 ms 5460 KB Output is correct
37 Correct 4 ms 5416 KB Output is correct
38 Correct 3 ms 5412 KB Output is correct
39 Correct 4 ms 5332 KB Output is correct
40 Correct 3 ms 5332 KB Output is correct
41 Correct 728 ms 17272 KB Output is correct
42 Correct 1088 ms 30076 KB Output is correct
43 Correct 1095 ms 30120 KB Output is correct
44 Correct 222 ms 11828 KB Output is correct
45 Correct 1082 ms 30148 KB Output is correct
46 Correct 1055 ms 30300 KB Output is correct
47 Correct 1137 ms 30168 KB Output is correct
48 Correct 1077 ms 30148 KB Output is correct
49 Correct 1042 ms 30032 KB Output is correct
50 Correct 1066 ms 30132 KB Output is correct
51 Correct 1070 ms 30216 KB Output is correct
52 Correct 1102 ms 30136 KB Output is correct
53 Correct 1044 ms 30016 KB Output is correct
54 Correct 1077 ms 30092 KB Output is correct
55 Correct 1079 ms 30492 KB Output is correct
56 Correct 1081 ms 30144 KB Output is correct
57 Correct 1196 ms 30076 KB Output is correct
58 Correct 1197 ms 30164 KB Output is correct
59 Correct 198 ms 11772 KB Output is correct
60 Correct 1147 ms 30076 KB Output is correct
61 Correct 962 ms 30204 KB Output is correct
62 Correct 304 ms 13340 KB Output is correct
63 Correct 312 ms 12288 KB Output is correct
64 Correct 245 ms 13340 KB Output is correct
65 Correct 275 ms 13336 KB Output is correct
66 Correct 361 ms 12420 KB Output is correct
67 Correct 251 ms 11860 KB Output is correct
68 Correct 247 ms 13336 KB Output is correct
69 Correct 247 ms 11776 KB Output is correct
70 Correct 234 ms 13300 KB Output is correct
71 Correct 248 ms 11768 KB Output is correct
72 Correct 1108 ms 29440 KB Output is correct
73 Correct 1647 ms 42832 KB Output is correct
74 Correct 1657 ms 42784 KB Output is correct
75 Correct 1538 ms 42588 KB Output is correct
76 Correct 1564 ms 42704 KB Output is correct
77 Correct 1561 ms 42792 KB Output is correct
78 Correct 1529 ms 42764 KB Output is correct
79 Correct 1486 ms 42704 KB Output is correct
80 Correct 1543 ms 42756 KB Output is correct
81 Correct 1501 ms 42740 KB Output is correct
82 Correct 1600 ms 42628 KB Output is correct
83 Correct 1608 ms 42736 KB Output is correct
84 Correct 1551 ms 42700 KB Output is correct
85 Correct 1635 ms 42832 KB Output is correct
86 Correct 1547 ms 42716 KB Output is correct
87 Correct 1489 ms 42824 KB Output is correct
88 Correct 1594 ms 42764 KB Output is correct
89 Correct 585 ms 25348 KB Output is correct
90 Correct 1623 ms 42724 KB Output is correct
91 Correct 1253 ms 41508 KB Output is correct
92 Correct 340 ms 23868 KB Output is correct
93 Correct 627 ms 24000 KB Output is correct
94 Correct 369 ms 24976 KB Output is correct
95 Correct 383 ms 23508 KB Output is correct
96 Correct 559 ms 22944 KB Output is correct
97 Correct 585 ms 24416 KB Output is correct
98 Correct 323 ms 24456 KB Output is correct
99 Correct 555 ms 24128 KB Output is correct
100 Correct 330 ms 24648 KB Output is correct