oj.uz

Submission #174669

# Submission time Handle Problem Language Result Execution time Memory
174669 2020-01-06T15:59:48 Z tselmegkh Evacuation plan (IZhO18_plan) C++14
100 / 100
 1853 ms 42136 KB 
#include<bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;

vector<pair<int, int>> g[N];
vector<int> newg[N];
int d[N], p[N], par[N], idx, h[N], e[2 * N], l[2 * N], tree[8 * N];
bool vis[N];

bool cmp(pair<int, int> a, pair<int, int> b){
	return (a.first > b.first);
}

int get(int u){
	if(u == p[u])return u;
	return p[u] = get(p[u]);
}
void unite(int u, int v){
	int pu = get(u), pv = get(v);
	if(pu != pv){
		p[pv] = pu;
		newg[u].push_back(v);
		newg[v].push_back(u);
	}
}
void dfs(int u, int depth){
	h[u] = idx;
	e[idx] = u;
	l[idx] = depth; idx++;
	for(int v : newg[u]){
		if(v == par[u])continue;
		dfs(v, depth + 1);
		e[idx] = u;
		l[idx] = depth; idx++;
	}
}

void build(int v, int L, int R){
	if(L == R){
		tree[v] = L;
		return;
	}
	int mid = (L + R) / 2;
	build(v * 2, L, mid);
	build(v * 2 + 1, mid + 1, R);
	if(l[tree[v * 2]] > l[tree[v * 2 + 1]])tree[v] = tree[v * 2 + 1];
	else tree[v] = tree[v * 2];
	return;
}
int query(int v, int L, int R, int ql, int qr){
	if(ql > R || qr < L)return -1;
	if(ql <= L && qr >= R)return tree[v];
	int mid = (L + R) / 2;
	int p1 = query(v * 2, L, mid, ql, qr), p2 = query(v * 2 + 1, mid + 1, R, ql, qr);
	if(p1 == -1)return p2;
	if(p2 == -1)return p1;
	if(l[p1] > l[p2])return p2;
	else return p1;
}
int main(){
	int n, m, k;
	cin >> n >> m;
	memset(d, 0x3f3f3f3f, sizeof d);
	for(int i = 1; i <= n; i++)p[i] = i;

	for(int i = 0; i < m; i++){
		int u, v, w;
		cin >> u >> v >> w;
		g[u].push_back({v, w});
		g[v].push_back({u, w});
	}
	cin >> k;

	set<pair<int, int>> s;
	for(int i = 0; i < k; i++){
		int loc;
		cin >> loc;
		d[loc] = 0;
		s.insert({0, loc});
	}
	while(!s.empty()){
		pair<int, int> x = *s.begin(); s.erase(s.begin());
		int u = x.second;
		for(auto vw : g[u]){
			int v = vw.first, w = vw.second;
			if(d[v] > d[u] + w){
				d[v] = d[u] + w;
				s.insert({d[v], v});
			}
		}
	}
	vector<pair<int, int>> v;
	for(int i = 1; i <= n; i++){
		v.push_back({d[i], i});
	}
	sort(v.begin(), v.end(), cmp);

	int root = -1;
	for(auto x : v){
		int u = x.second;
		vis[u] = 1;
		root = u;
		for(auto y : g[u]){
			int to = y.first;
			if(vis[to]){
				to = get(to);
				if(u != to){
					unite(u, to);
					par[to] = u;
				}
			}		
		}
	}
	dfs(root, 0);
	build(1, 0, idx - 1);

	int q;
	cin >> q;
	while(q--){
		int u, v;
		cin >> u >> v;
		int ql = h[u], qr = h[v];
		if(ql > qr)swap(ql, qr);
		cout << d[e[query(1, 0, idx - 1, ql, qr)]] << '\n';
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5496 KB Output is correct
2 Correct 12 ms 5624 KB Output is correct
3 Correct 12 ms 5624 KB Output is correct
4 Correct 6 ms 5496 KB Output is correct
5 Correct 12 ms 5624 KB Output is correct
6 Correct 12 ms 5624 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 7 ms 5496 KB Output is correct
9 Correct 12 ms 5624 KB Output is correct
10 Correct 13 ms 5628 KB Output is correct
11 Correct 12 ms 5624 KB Output is correct
12 Correct 12 ms 5624 KB Output is correct
13 Correct 12 ms 5624 KB Output is correct
14 Correct 12 ms 5624 KB Output is correct
15 Correct 13 ms 5624 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5496 KB Output is correct
2 Correct 12 ms 5624 KB Output is correct
3 Correct 12 ms 5624 KB Output is correct
4 Correct 6 ms 5496 KB Output is correct
5 Correct 12 ms 5624 KB Output is correct
6 Correct 12 ms 5624 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 7 ms 5496 KB Output is correct
9 Correct 12 ms 5624 KB Output is correct
10 Correct 13 ms 5628 KB Output is correct
11 Correct 12 ms 5624 KB Output is correct
12 Correct 12 ms 5624 KB Output is correct
13 Correct 12 ms 5624 KB Output is correct
14 Correct 12 ms 5624 KB Output is correct
15 Correct 13 ms 5624 KB Output is correct
16 Correct 750 ms 21136 KB Output is correct
17 Correct 1757 ms 37284 KB Output is correct
18 Correct 130 ms 8920 KB Output is correct
19 Correct 748 ms 22000 KB Output is correct
20 Correct 1783 ms 37196 KB Output is correct
21 Correct 1044 ms 28328 KB Output is correct
22 Correct 730 ms 27564 KB Output is correct
23 Correct 1794 ms 37264 KB Output is correct
24 Correct 1815 ms 37084 KB Output is correct
25 Correct 1819 ms 37216 KB Output is correct
26 Correct 732 ms 21728 KB Output is correct
27 Correct 725 ms 21736 KB Output is correct
28 Correct 746 ms 21856 KB Output is correct
29 Correct 727 ms 21752 KB Output is correct
30 Correct 732 ms 22116 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5496 KB Output is correct
2 Correct 7 ms 5496 KB Output is correct
3 Correct 7 ms 5412 KB Output is correct
4 Correct 5 ms 5488 KB Output is correct
5 Correct 7 ms 5496 KB Output is correct
6 Correct 14 ms 5496 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 7 ms 5460 KB Output is correct
9 Correct 7 ms 5496 KB Output is correct
10 Correct 7 ms 5368 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 581 ms 26960 KB Output is correct
2 Correct 1318 ms 36716 KB Output is correct
3 Correct 1327 ms 36780 KB Output is correct
4 Correct 273 ms 22116 KB Output is correct
5 Correct 1305 ms 36820 KB Output is correct
6 Correct 1310 ms 36800 KB Output is correct
7 Correct 1385 ms 36828 KB Output is correct
8 Correct 1444 ms 36780 KB Output is correct
9 Correct 1342 ms 36744 KB Output is correct
10 Correct 1298 ms 36768 KB Output is correct
11 Correct 1297 ms 37104 KB Output is correct
12 Correct 1310 ms 36948 KB Output is correct
13 Correct 1284 ms 36788 KB Output is correct
14 Correct 1279 ms 36788 KB Output is correct
15 Correct 1306 ms 36832 KB Output is correct
16 Correct 1298 ms 37040 KB Output is correct
17 Correct 1324 ms 36924 KB Output is correct
18 Correct 1329 ms 36740 KB Output is correct
19 Correct 279 ms 25328 KB Output is correct
20 Correct 1319 ms 36904 KB Output is correct
21 Correct 1203 ms 36872 KB Output is correct
22 Correct 282 ms 20244 KB Output is correct
23 Correct 276 ms 20876 KB Output is correct
24 Correct 306 ms 20400 KB Output is correct
25 Correct 288 ms 20244 KB Output is correct
26 Correct 293 ms 19996 KB Output is correct
27 Correct 264 ms 22256 KB Output is correct
28 Correct 314 ms 20296 KB Output is correct
29 Correct 265 ms 22128 KB Output is correct
30 Correct 276 ms 20240 KB Output is correct
31 Correct 262 ms 22184 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5496 KB Output is correct
2 Correct 12 ms 5624 KB Output is correct
3 Correct 12 ms 5624 KB Output is correct
4 Correct 6 ms 5496 KB Output is correct
5 Correct 12 ms 5624 KB Output is correct
6 Correct 12 ms 5624 KB Output is correct
7 Correct 7 ms 5496 KB Output is correct
8 Correct 7 ms 5496 KB Output is correct
9 Correct 12 ms 5624 KB Output is correct
10 Correct 13 ms 5628 KB Output is correct
11 Correct 12 ms 5624 KB Output is correct
12 Correct 12 ms 5624 KB Output is correct
13 Correct 12 ms 5624 KB Output is correct
14 Correct 12 ms 5624 KB Output is correct
15 Correct 13 ms 5624 KB Output is correct
16 Correct 750 ms 21136 KB Output is correct
17 Correct 1757 ms 37284 KB Output is correct
18 Correct 130 ms 8920 KB Output is correct
19 Correct 748 ms 22000 KB Output is correct
20 Correct 1783 ms 37196 KB Output is correct
21 Correct 1044 ms 28328 KB Output is correct
22 Correct 730 ms 27564 KB Output is correct
23 Correct 1794 ms 37264 KB Output is correct
24 Correct 1815 ms 37084 KB Output is correct
25 Correct 1819 ms 37216 KB Output is correct
26 Correct 732 ms 21728 KB Output is correct
27 Correct 725 ms 21736 KB Output is correct
28 Correct 746 ms 21856 KB Output is correct
29 Correct 727 ms 21752 KB Output is correct
30 Correct 732 ms 22116 KB Output is correct
31 Correct 7 ms 5496 KB Output is correct
32 Correct 7 ms 5496 KB Output is correct
33 Correct 7 ms 5412 KB Output is correct
34 Correct 5 ms 5488 KB Output is correct
35 Correct 7 ms 5496 KB Output is correct
36 Correct 14 ms 5496 KB Output is correct
37 Correct 7 ms 5496 KB Output is correct
38 Correct 7 ms 5460 KB Output is correct
39 Correct 7 ms 5496 KB Output is correct
40 Correct 7 ms 5368 KB Output is correct
41 Correct 581 ms 26960 KB Output is correct
42 Correct 1318 ms 36716 KB Output is correct
43 Correct 1327 ms 36780 KB Output is correct
44 Correct 273 ms 22116 KB Output is correct
45 Correct 1305 ms 36820 KB Output is correct
46 Correct 1310 ms 36800 KB Output is correct
47 Correct 1385 ms 36828 KB Output is correct
48 Correct 1444 ms 36780 KB Output is correct
49 Correct 1342 ms 36744 KB Output is correct
50 Correct 1298 ms 36768 KB Output is correct
51 Correct 1297 ms 37104 KB Output is correct
52 Correct 1310 ms 36948 KB Output is correct
53 Correct 1284 ms 36788 KB Output is correct
54 Correct 1279 ms 36788 KB Output is correct
55 Correct 1306 ms 36832 KB Output is correct
56 Correct 1298 ms 37040 KB Output is correct
57 Correct 1324 ms 36924 KB Output is correct
58 Correct 1329 ms 36740 KB Output is correct
59 Correct 279 ms 25328 KB Output is correct
60 Correct 1319 ms 36904 KB Output is correct
61 Correct 1203 ms 36872 KB Output is correct
62 Correct 282 ms 20244 KB Output is correct
63 Correct 276 ms 20876 KB Output is correct
64 Correct 306 ms 20400 KB Output is correct
65 Correct 288 ms 20244 KB Output is correct
66 Correct 293 ms 19996 KB Output is correct
67 Correct 264 ms 22256 KB Output is correct
68 Correct 314 ms 20296 KB Output is correct
69 Correct 265 ms 22128 KB Output is correct
70 Correct 276 ms 20240 KB Output is correct
71 Correct 262 ms 22184 KB Output is correct
72 Correct 1053 ms 28860 KB Output is correct
73 Correct 1766 ms 41980 KB Output is correct
74 Correct 1783 ms 42136 KB Output is correct
75 Correct 1753 ms 41984 KB Output is correct
76 Correct 1781 ms 42112 KB Output is correct
77 Correct 1792 ms 42080 KB Output is correct
78 Correct 1794 ms 42064 KB Output is correct
79 Correct 1818 ms 41948 KB Output is correct
80 Correct 1807 ms 42012 KB Output is correct
81 Correct 1817 ms 42076 KB Output is correct
82 Correct 1811 ms 41816 KB Output is correct
83 Correct 1769 ms 42092 KB Output is correct
84 Correct 1853 ms 41992 KB Output is correct
85 Correct 1788 ms 41880 KB Output is correct
86 Correct 1809 ms 41964 KB Output is correct
87 Correct 1799 ms 41916 KB Output is correct
88 Correct 1788 ms 41964 KB Output is correct
89 Correct 712 ms 27376 KB Output is correct
90 Correct 1789 ms 41920 KB Output is correct
91 Correct 1696 ms 42084 KB Output is correct
92 Correct 755 ms 21784 KB Output is correct
93 Correct 756 ms 22948 KB Output is correct
94 Correct 755 ms 21692 KB Output is correct
95 Correct 745 ms 21796 KB Output is correct
96 Correct 753 ms 21360 KB Output is correct
97 Correct 730 ms 23920 KB Output is correct
98 Correct 753 ms 21888 KB Output is correct
99 Correct 715 ms 23952 KB Output is correct
100 Correct 739 ms 21900 KB Output is correct