oj.uz

Submission #159373

# Submission time Handle Problem Language Result Execution time Memory
159373 2019-10-22T13:24:18 Z sofhiasouza Evacuation plan (IZhO18_plan) C++14
100 / 100
 1057 ms 21880 KB 
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair < int, int > ii;

const int maxn = 1e5+10, inf = 0x3f3f3f3f;

int n, m, k, q, pai[maxn], peso[maxn], resp[maxn], vist[maxn], cont, nivel[maxn];
ii dist[maxn];

bool npp[maxn];

vector < ii > grafo[maxn];

void dijkstra()
{
	priority_queue < int, vector < int >, greater < int > > fila;

	for(int i = 1 ; i <= n ; i++)
	{
		if(npp[i])
		{
			fila.push(i);
			dist[i] = {0, i};
		}
		else dist[i] = {inf, i};
	}	

	while(fila.size())
	{
		int u = fila.top();
		fila.pop();

		for(ii k : grafo[u])
		{
			int v = k.F;
			int cst = k.S;

			if(dist[v].F > dist[u].F + cst)
			{
				fila.push(v);
				dist[v].F = dist[u].F + cst; 
			}
		}
	}
}

bool cmp(ii a, ii b)
{
	return a.F > b.F;
}

int find(int x)
{
	if(pai[x] == x) return x;
	return find(pai[x]);
}

void join(int u, int v)
{
	u = find(u);
	v = find(v);

	if(u == v) return;

	if(peso[u] < peso[v]) swap(u, v);

	pai[v] = u, peso[u] += peso[v], resp[v] = cont;
}

void dfs(int x)
{
	vist[x] = 1;
	if(pai[x] == x)
	{
		nivel[x] = 0;
		return;
	}
	if(!vist[pai[x]]) dfs(pai[x]);
	nivel[x] = nivel[pai[x]] + 1;
}

int get(int u, int v)
{
	int ans = 0;

	while(u != v)
	{
		if(nivel[u] > nivel[v]) ans = max(ans, resp[u]), u = pai[u];
		else ans = max(ans, resp[v]), v = pai[v];
	}

	return ans;
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); 

	cin >> n >> m;

	for(int i = 1 ; i <= m ; i++)
	{
		int a, b, c;
		cin >> a >> b >> c;

		grafo[a].pb({b, c});
		grafo[b].pb({a, c});
	}

	memset(npp, false, sizeof npp);

	cin >> k;

	for(int i = 1 ; i <= k ; i++)
	{
		int a;
		cin >> a;

		npp[a] = true;
	}

	dijkstra();

	sort(dist+1, dist+1+n, cmp);

	for(int i = 1 ; i <= n ; i++)
	{
		pai[i] = i;
		peso[i] = 1;
		resp[i] = 1;
	}

	for(int i = 1 ; i <= n ; i++)
	{
		int u = dist[i].S;
	
		cont++;

		for(ii k : grafo[u])
		{
			int v = k.F;
			if(vist[v]) join(u, v);
		}

		vist[u] = 1;
	}	

	memset(vist, 0, sizeof vist);

	for(int i = 1 ; i <= n ; i++)
	{
		if(!vist[i]) dfs(i);
	}

	cin >> q;

	for(int i = 1 ; i <= q ; i++)
	{
		int a, b;
		cin >> a >> b;
	
		cout << dist[get(a, b)].F << "\n";
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3192 KB Output is correct
2 Correct 5 ms 3320 KB Output is correct
3 Correct 5 ms 3192 KB Output is correct
4 Correct 4 ms 3192 KB Output is correct
5 Correct 5 ms 3292 KB Output is correct
6 Correct 5 ms 3192 KB Output is correct
7 Correct 4 ms 3192 KB Output is correct
8 Correct 4 ms 3192 KB Output is correct
9 Correct 5 ms 3272 KB Output is correct
10 Correct 5 ms 3320 KB Output is correct
11 Correct 5 ms 3296 KB Output is correct
12 Correct 5 ms 3320 KB Output is correct
13 Correct 5 ms 3320 KB Output is correct
14 Correct 5 ms 3320 KB Output is correct
15 Correct 5 ms 3320 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3192 KB Output is correct
2 Correct 5 ms 3320 KB Output is correct
3 Correct 5 ms 3192 KB Output is correct
4 Correct 4 ms 3192 KB Output is correct
5 Correct 5 ms 3292 KB Output is correct
6 Correct 5 ms 3192 KB Output is correct
7 Correct 4 ms 3192 KB Output is correct
8 Correct 4 ms 3192 KB Output is correct
9 Correct 5 ms 3272 KB Output is correct
10 Correct 5 ms 3320 KB Output is correct
11 Correct 5 ms 3296 KB Output is correct
12 Correct 5 ms 3320 KB Output is correct
13 Correct 5 ms 3320 KB Output is correct
14 Correct 5 ms 3320 KB Output is correct
15 Correct 5 ms 3320 KB Output is correct
16 Correct 196 ms 9200 KB Output is correct
17 Correct 1036 ms 21836 KB Output is correct
18 Correct 57 ms 4904 KB Output is correct
19 Correct 176 ms 9988 KB Output is correct
20 Correct 1057 ms 21824 KB Output is correct
21 Correct 245 ms 12444 KB Output is correct
22 Correct 128 ms 9508 KB Output is correct
23 Correct 931 ms 21880 KB Output is correct
24 Correct 793 ms 20004 KB Output is correct
25 Correct 556 ms 20008 KB Output is correct
26 Correct 121 ms 9732 KB Output is correct
27 Correct 121 ms 9916 KB Output is correct
28 Correct 142 ms 9848 KB Output is correct
29 Correct 139 ms 9960 KB Output is correct
30 Correct 121 ms 9952 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 422 ms 12248 KB Output is correct
2 Correct 913 ms 21744 KB Output is correct
3 Correct 913 ms 21840 KB Output is correct
4 Correct 92 ms 8668 KB Output is correct
5 Correct 880 ms 19840 KB Output is correct
6 Correct 850 ms 19788 KB Output is correct
7 Correct 718 ms 19720 KB Output is correct
8 Correct 820 ms 21804 KB Output is correct
9 Correct 913 ms 21796 KB Output is correct
10 Correct 880 ms 21796 KB Output is correct
11 Correct 919 ms 21864 KB Output is correct
12 Correct 678 ms 19808 KB Output is correct
13 Correct 639 ms 19732 KB Output is correct
14 Correct 538 ms 19772 KB Output is correct
15 Correct 498 ms 19616 KB Output is correct
16 Correct 628 ms 19716 KB Output is correct
17 Correct 708 ms 19808 KB Output is correct
18 Correct 906 ms 21876 KB Output is correct
19 Correct 90 ms 8676 KB Output is correct
20 Correct 804 ms 19736 KB Output is correct
21 Correct 421 ms 19716 KB Output is correct
22 Correct 103 ms 9560 KB Output is correct
23 Correct 104 ms 9172 KB Output is correct
24 Correct 88 ms 9568 KB Output is correct
25 Correct 104 ms 9732 KB Output is correct
26 Correct 108 ms 9208 KB Output is correct
27 Correct 91 ms 8700 KB Output is correct
28 Correct 89 ms 9592 KB Output is correct
29 Correct 90 ms 8692 KB Output is correct
30 Correct 90 ms 9564 KB Output is correct
31 Correct 96 ms 8668 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3192 KB Output is correct
2 Correct 5 ms 3320 KB Output is correct
3 Correct 5 ms 3192 KB Output is correct
4 Correct 4 ms 3192 KB Output is correct
5 Correct 5 ms 3292 KB Output is correct
6 Correct 5 ms 3192 KB Output is correct
7 Correct 4 ms 3192 KB Output is correct
8 Correct 4 ms 3192 KB Output is correct
9 Correct 5 ms 3272 KB Output is correct
10 Correct 5 ms 3320 KB Output is correct
11 Correct 5 ms 3296 KB Output is correct
12 Correct 5 ms 3320 KB Output is correct
13 Correct 5 ms 3320 KB Output is correct
14 Correct 5 ms 3320 KB Output is correct
15 Correct 5 ms 3320 KB Output is correct
16 Correct 196 ms 9200 KB Output is correct
17 Correct 1036 ms 21836 KB Output is correct
18 Correct 57 ms 4904 KB Output is correct
19 Correct 176 ms 9988 KB Output is correct
20 Correct 1057 ms 21824 KB Output is correct
21 Correct 245 ms 12444 KB Output is correct
22 Correct 128 ms 9508 KB Output is correct
23 Correct 931 ms 21880 KB Output is correct
24 Correct 793 ms 20004 KB Output is correct
25 Correct 556 ms 20008 KB Output is correct
26 Correct 121 ms 9732 KB Output is correct
27 Correct 121 ms 9916 KB Output is correct
28 Correct 142 ms 9848 KB Output is correct
29 Correct 139 ms 9960 KB Output is correct
30 Correct 121 ms 9952 KB Output is correct
31 Correct 4 ms 3192 KB Output is correct
32 Correct 4 ms 3192 KB Output is correct
33 Correct 4 ms 3192 KB Output is correct
34 Correct 4 ms 3192 KB Output is correct
35 Correct 4 ms 3192 KB Output is correct
36 Correct 4 ms 3192 KB Output is correct
37 Correct 4 ms 3192 KB Output is correct
38 Correct 4 ms 3192 KB Output is correct
39 Correct 4 ms 3192 KB Output is correct
40 Correct 4 ms 3192 KB Output is correct
41 Correct 422 ms 12248 KB Output is correct
42 Correct 913 ms 21744 KB Output is correct
43 Correct 913 ms 21840 KB Output is correct
44 Correct 92 ms 8668 KB Output is correct
45 Correct 880 ms 19840 KB Output is correct
46 Correct 850 ms 19788 KB Output is correct
47 Correct 718 ms 19720 KB Output is correct
48 Correct 820 ms 21804 KB Output is correct
49 Correct 913 ms 21796 KB Output is correct
50 Correct 880 ms 21796 KB Output is correct
51 Correct 919 ms 21864 KB Output is correct
52 Correct 678 ms 19808 KB Output is correct
53 Correct 639 ms 19732 KB Output is correct
54 Correct 538 ms 19772 KB Output is correct
55 Correct 498 ms 19616 KB Output is correct
56 Correct 628 ms 19716 KB Output is correct
57 Correct 708 ms 19808 KB Output is correct
58 Correct 906 ms 21876 KB Output is correct
59 Correct 90 ms 8676 KB Output is correct
60 Correct 804 ms 19736 KB Output is correct
61 Correct 421 ms 19716 KB Output is correct
62 Correct 103 ms 9560 KB Output is correct
63 Correct 104 ms 9172 KB Output is correct
64 Correct 88 ms 9568 KB Output is correct
65 Correct 104 ms 9732 KB Output is correct
66 Correct 108 ms 9208 KB Output is correct
67 Correct 91 ms 8700 KB Output is correct
68 Correct 89 ms 9592 KB Output is correct
69 Correct 90 ms 8692 KB Output is correct
70 Correct 90 ms 9564 KB Output is correct
71 Correct 96 ms 8668 KB Output is correct
72 Correct 426 ms 12688 KB Output is correct
73 Correct 895 ms 20068 KB Output is correct
74 Correct 812 ms 20124 KB Output is correct
75 Correct 1020 ms 21812 KB Output is correct
76 Correct 831 ms 20132 KB Output is correct
77 Correct 762 ms 20060 KB Output is correct
78 Correct 878 ms 21772 KB Output is correct
79 Correct 909 ms 21816 KB Output is correct
80 Correct 857 ms 21768 KB Output is correct
81 Correct 892 ms 21872 KB Output is correct
82 Correct 700 ms 20192 KB Output is correct
83 Correct 676 ms 20096 KB Output is correct
84 Correct 576 ms 20072 KB Output is correct
85 Correct 550 ms 20064 KB Output is correct
86 Correct 634 ms 20100 KB Output is correct
87 Correct 804 ms 20192 KB Output is correct
88 Correct 898 ms 21868 KB Output is correct
89 Correct 125 ms 9628 KB Output is correct
90 Correct 870 ms 21804 KB Output is correct
91 Correct 481 ms 19824 KB Output is correct
92 Correct 119 ms 9936 KB Output is correct
93 Correct 136 ms 9848 KB Output is correct
94 Correct 120 ms 9772 KB Output is correct
95 Correct 117 ms 9916 KB Output is correct
96 Correct 140 ms 9464 KB Output is correct
97 Correct 123 ms 9208 KB Output is correct
98 Correct 120 ms 9732 KB Output is correct
99 Correct 117 ms 9208 KB Output is correct
100 Correct 117 ms 10004 KB Output is correct