oj.uz

답안 #287374

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
287374 2020-08-31T16:32:34 Z Berted Evacuation plan (IZhO18_plan) C++14
100 / 100
 766 ms 46956 KB 
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <assert.h>
#define pii pair<int, int>
#define vi vector<int>
#define vpi vector<pii>
#define fst first
#define snd second
using namespace std;

const int INF = 1e9, LG = 17;

int n, m, k, q;
vpi adj[100001];
vi tree[100001];
int dist[100001], par[100001], h[100001], sps[100001][LG][2];
vpi ord;
priority_queue<pii, vector<pii>, greater<pii>> pq;

void runDijkstra()
{
	while (pq.size())
	{
		int u = pq.top().snd, d = pq.top().fst; pq.pop();
		//cout << "DIST : " << u << " " << dist[u] << "\n";
		if (dist[u] == d)
		{
			for (auto v : adj[u])
			{
				if (dist[u] + v.snd < dist[v.fst])
				{
					dist[v.fst] = dist[u] + v.snd;
					pq.push({dist[v.fst], v.fst});
				}
			}
		}
	}
}

int fn(int x) {return par[x] = (par[x] == x) ? x : fn(par[x]);}
void jn(int a, int b)
{
	int oa = fn(a), ob = fn(b);
	if (oa != ob)
	{
		par[ob] = oa;
		tree[a].push_back(b);
		tree[b].push_back(a);
	}
}

void DFS(int u, int p, int val)
{
	sps[u][0][0] = p; sps[u][0][1] = val; h[u] = (p == -1) ? 0 : (h[p] + 1);
	for (int i = 1; i < LG; i++)
	{
		if (sps[u][i - 1][0] != -1)
		{
			sps[u][i][0] = sps[sps[u][i - 1][0]][i - 1][0];
			sps[u][i][1] = min(sps[u][i - 1][1], sps[sps[u][i - 1][0]][i - 1][1]);
		}
		else {sps[u][i][0] = -1; sps[u][i][1] = INF;}
	}
	for (auto v : tree[u])
	{
		if (v != p) {DFS(v, u, dist[u]);}
	}
}

int getAnswer(int u, int v)
{
	int res = min(dist[u], dist[v]);
	if (h[u] > h[v]) {swap(v, u);}
	for (int i = 0; h[v] - h[u]; i++)
	{
		if ((h[v] - h[u]) & (1 << i)) 
		{
			res = min(sps[v][i][1], res);
			v = sps[v][i][0];
		}
	}
	for (int i = LG - 1; i >= 0; i--)
	{
		if (sps[u][i][0] != sps[v][i][0])
		{
			res = min(res, min(sps[u][i][1], sps[v][i][1]));
			u = sps[u][i][0]; v = sps[v][i][0];
		}
	}
	if (u != v)
	{
		res = min(res, min(sps[u][0][1], sps[v][0][1]));
		u = sps[u][0][0];
		v = sps[v][0][0];
	}
	//assert(u == v);
	return res;
}

int main()
{
	ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for (int i = 0; i < n; i++) {dist[i] = INF; par[i] = -1;}
	for (int i = 0; i < m; i++)
	{
		int u, v, w; cin >> u >> v >> w;
		adj[u - 1].push_back({v - 1, w});
		adj[v - 1].push_back({u - 1, w});
	}
	cin >> k;
	for (int i = 0; i < k; i++)
	{
		int x; cin >> x; x--;
		dist[x] = 0; pq.push({0, x});
	}
	runDijkstra();
	for (int i = 0; i < n; i++) {ord.push_back({-dist[i], i});}
	sort(ord.begin(), ord.end());
	
	for (int i = 0; i < n; i++)
	{
		int u = ord[i].snd;
		par[u] = u;
		for (auto v : adj[u])
		{
			if (par[v.fst] != -1) {jn(v.fst, u);}
		}
	}
	DFS(0, -1, INF);
	cin >> q;
	for (int i = 0; i < q; i++)
	{
		int u, v; cin >> u >> v;
		cout << getAnswer(u - 1, v - 1) << "\n";
	}
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5096 KB Output is correct
2 Correct 6 ms 5248 KB Output is correct
3 Correct 5 ms 5248 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 5 ms 5376 KB Output is correct
6 Correct 5 ms 5248 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 6 ms 5376 KB Output is correct
10 Correct 5 ms 5248 KB Output is correct
11 Correct 5 ms 5376 KB Output is correct
12 Correct 5 ms 5352 KB Output is correct
13 Correct 7 ms 5248 KB Output is correct
14 Correct 5 ms 5376 KB Output is correct
15 Correct 6 ms 5376 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5096 KB Output is correct
2 Correct 6 ms 5248 KB Output is correct
3 Correct 5 ms 5248 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 5 ms 5376 KB Output is correct
6 Correct 5 ms 5248 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 6 ms 5376 KB Output is correct
10 Correct 5 ms 5248 KB Output is correct
11 Correct 5 ms 5376 KB Output is correct
12 Correct 5 ms 5352 KB Output is correct
13 Correct 7 ms 5248 KB Output is correct
14 Correct 5 ms 5376 KB Output is correct
15 Correct 6 ms 5376 KB Output is correct
16 Correct 245 ms 26240 KB Output is correct
17 Correct 653 ms 46916 KB Output is correct
18 Correct 48 ms 9336 KB Output is correct
19 Correct 184 ms 31904 KB Output is correct
20 Correct 635 ms 46828 KB Output is correct
21 Correct 350 ms 34868 KB Output is correct
22 Correct 213 ms 35052 KB Output is correct
23 Correct 671 ms 46828 KB Output is correct
24 Correct 661 ms 46888 KB Output is correct
25 Correct 685 ms 46860 KB Output is correct
26 Correct 205 ms 31584 KB Output is correct
27 Correct 201 ms 31868 KB Output is correct
28 Correct 197 ms 31588 KB Output is correct
29 Correct 198 ms 31716 KB Output is correct
30 Correct 186 ms 31848 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 5120 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 5 ms 4992 KB Output is correct
9 Correct 5 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 32960 KB Output is correct
2 Correct 544 ms 45160 KB Output is correct
3 Correct 583 ms 45164 KB Output is correct
4 Correct 168 ms 31084 KB Output is correct
5 Correct 610 ms 45176 KB Output is correct
6 Correct 561 ms 45376 KB Output is correct
7 Correct 568 ms 45164 KB Output is correct
8 Correct 595 ms 45132 KB Output is correct
9 Correct 559 ms 45268 KB Output is correct
10 Correct 592 ms 45212 KB Output is correct
11 Correct 570 ms 45168 KB Output is correct
12 Correct 558 ms 45168 KB Output is correct
13 Correct 566 ms 45204 KB Output is correct
14 Correct 570 ms 45244 KB Output is correct
15 Correct 584 ms 45376 KB Output is correct
16 Correct 530 ms 45160 KB Output is correct
17 Correct 525 ms 45164 KB Output is correct
18 Correct 529 ms 45292 KB Output is correct
19 Correct 153 ms 32616 KB Output is correct
20 Correct 585 ms 45380 KB Output is correct
21 Correct 493 ms 45304 KB Output is correct
22 Correct 135 ms 30188 KB Output is correct
23 Correct 153 ms 29292 KB Output is correct
24 Correct 144 ms 30188 KB Output is correct
25 Correct 136 ms 30136 KB Output is correct
26 Correct 169 ms 29548 KB Output is correct
27 Correct 168 ms 32488 KB Output is correct
28 Correct 136 ms 30304 KB Output is correct
29 Correct 158 ms 31848 KB Output is correct
30 Correct 131 ms 30188 KB Output is correct
31 Correct 182 ms 31856 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5096 KB Output is correct
2 Correct 6 ms 5248 KB Output is correct
3 Correct 5 ms 5248 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 5 ms 5376 KB Output is correct
6 Correct 5 ms 5248 KB Output is correct
7 Correct 4 ms 5120 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 6 ms 5376 KB Output is correct
10 Correct 5 ms 5248 KB Output is correct
11 Correct 5 ms 5376 KB Output is correct
12 Correct 5 ms 5352 KB Output is correct
13 Correct 7 ms 5248 KB Output is correct
14 Correct 5 ms 5376 KB Output is correct
15 Correct 6 ms 5376 KB Output is correct
16 Correct 245 ms 26240 KB Output is correct
17 Correct 653 ms 46916 KB Output is correct
18 Correct 48 ms 9336 KB Output is correct
19 Correct 184 ms 31904 KB Output is correct
20 Correct 635 ms 46828 KB Output is correct
21 Correct 350 ms 34868 KB Output is correct
22 Correct 213 ms 35052 KB Output is correct
23 Correct 671 ms 46828 KB Output is correct
24 Correct 661 ms 46888 KB Output is correct
25 Correct 685 ms 46860 KB Output is correct
26 Correct 205 ms 31584 KB Output is correct
27 Correct 201 ms 31868 KB Output is correct
28 Correct 197 ms 31588 KB Output is correct
29 Correct 198 ms 31716 KB Output is correct
30 Correct 186 ms 31848 KB Output is correct
31 Correct 4 ms 4992 KB Output is correct
32 Correct 4 ms 4992 KB Output is correct
33 Correct 4 ms 4992 KB Output is correct
34 Correct 4 ms 4992 KB Output is correct
35 Correct 4 ms 5120 KB Output is correct
36 Correct 4 ms 5120 KB Output is correct
37 Correct 4 ms 5120 KB Output is correct
38 Correct 5 ms 4992 KB Output is correct
39 Correct 5 ms 4992 KB Output is correct
40 Correct 4 ms 4992 KB Output is correct
41 Correct 303 ms 32960 KB Output is correct
42 Correct 544 ms 45160 KB Output is correct
43 Correct 583 ms 45164 KB Output is correct
44 Correct 168 ms 31084 KB Output is correct
45 Correct 610 ms 45176 KB Output is correct
46 Correct 561 ms 45376 KB Output is correct
47 Correct 568 ms 45164 KB Output is correct
48 Correct 595 ms 45132 KB Output is correct
49 Correct 559 ms 45268 KB Output is correct
50 Correct 592 ms 45212 KB Output is correct
51 Correct 570 ms 45168 KB Output is correct
52 Correct 558 ms 45168 KB Output is correct
53 Correct 566 ms 45204 KB Output is correct
54 Correct 570 ms 45244 KB Output is correct
55 Correct 584 ms 45376 KB Output is correct
56 Correct 530 ms 45160 KB Output is correct
57 Correct 525 ms 45164 KB Output is correct
58 Correct 529 ms 45292 KB Output is correct
59 Correct 153 ms 32616 KB Output is correct
60 Correct 585 ms 45380 KB Output is correct
61 Correct 493 ms 45304 KB Output is correct
62 Correct 135 ms 30188 KB Output is correct
63 Correct 153 ms 29292 KB Output is correct
64 Correct 144 ms 30188 KB Output is correct
65 Correct 136 ms 30136 KB Output is correct
66 Correct 169 ms 29548 KB Output is correct
67 Correct 168 ms 32488 KB Output is correct
68 Correct 136 ms 30304 KB Output is correct
69 Correct 158 ms 31848 KB Output is correct
70 Correct 131 ms 30188 KB Output is correct
71 Correct 182 ms 31856 KB Output is correct
72 Correct 400 ms 34740 KB Output is correct
73 Correct 766 ms 46956 KB Output is correct
74 Correct 648 ms 46844 KB Output is correct
75 Correct 627 ms 46828 KB Output is correct
76 Correct 651 ms 46832 KB Output is correct
77 Correct 644 ms 46832 KB Output is correct
78 Correct 607 ms 46828 KB Output is correct
79 Correct 666 ms 46828 KB Output is correct
80 Correct 619 ms 46832 KB Output is correct
81 Correct 600 ms 46828 KB Output is correct
82 Correct 603 ms 46800 KB Output is correct
83 Correct 607 ms 46888 KB Output is correct
84 Correct 606 ms 46832 KB Output is correct
85 Correct 628 ms 46864 KB Output is correct
86 Correct 639 ms 46836 KB Output is correct
87 Correct 633 ms 46816 KB Output is correct
88 Correct 624 ms 46876 KB Output is correct
89 Correct 289 ms 34152 KB Output is correct
90 Correct 616 ms 46832 KB Output is correct
91 Correct 572 ms 46780 KB Output is correct
92 Correct 179 ms 31720 KB Output is correct
93 Correct 246 ms 31344 KB Output is correct
94 Correct 179 ms 31588 KB Output is correct
95 Correct 182 ms 31720 KB Output is correct
96 Correct 261 ms 31212 KB Output is correct
97 Correct 296 ms 33016 KB Output is correct
98 Correct 177 ms 31596 KB Output is correct
99 Correct 283 ms 34280 KB Output is correct
100 Correct 188 ms 31712 KB Output is correct