oj.uz

Submission #167784

# Submission time Handle Problem Language Result Execution time Memory
167784 2019-12-10T06:31:40 Z Trickster Evacuation plan (IZhO18_plan) C++14
100 / 100
 2888 ms 24692 KB 
//Suleyman Atayew

#include <algorithm>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <set>

#define N 100010
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define inf 1000000007
#define pii pair <int, int>

using namespace std;

pii T[N];
int dis[N];
int vis[N];
int a, b, c;
int n, m, k, q;
vector <pii> E[N];
int A[N], L[N], R[N], Pr[N];
priority_queue <pii, vector <pii>, greater <pii>> Q;

int ata(int x)
{
	if(Pr[x] == x) return x;
	
	return Pr[x] = ata(Pr[x]);
}
void uni(int a, int b)
{
	a = ata(a);
	b = ata(b);
	
	if(a == b) return;
	
	Pr[b] = a;
}

int main()
{
	cin >> n >> m;
	
	for(int i = 1; i <= m; i++) {
		cin >> a >> b >> c;
		
		E[a].pb({b, c});
		E[b].pb({a, c});
	}
	
	cin >> k;
	
	for(int i = 1; i <= n; i++) dis[i] = 1e9;
	
	for(int i = 1; i <= k; i++) {
		cin >> a;
		
		dis[a] = 0, Q.push({0, a});
	}
	
	while(!Q.empty()) {
		int nd = Q.top().ss;
		Q.pop();
		
		if(vis[nd] == 1) continue;
		
		vis[nd] = 1;
		for(auto i: E[nd]) {
			int to = i.ff;
			int yol = i.ss;
			
			if(dis[to] > dis[nd] + yol)
				dis[to] = dis[nd] + yol, Q.push({dis[to], to});
		}
	}
	
	pii arr[N];
	for(int i = 1; i <= n; i++) arr[i] = {dis[i], i};
	sort(arr + 1, arr + n + 1);
	
	cin >> q;
	
	for(int i = 1; i <= q; i++) {
		cin >> a >> b;
		
		T[i] = {a, b};
		L[i] = 1, R[i] = 1e9;
	}
	
	for(int i = 1; i <= 30; i++) {
		vector <pii> MD;
		
		for(int h = 1; h <= q; h++) {
			if(R[h] < L[h]) continue;
			
			MD.pb({(L[h] + R[h]) / 2, h});
		}
		
		sort(MD.begin(), MD.end());
		reverse(MD.begin(), MD.end());
		
		memset(vis, 0, sizeof(vis));
		
		for(int h = 1; h <= n; h++) Pr[h] = h;
		
		int x = 0;
		for(int h = n; h >= 0; h--) {
			while(x < MD.size() && MD[x].ff > arr[h].ff) {
				int j = MD[x].ss;
				int md = MD[x].ff;
				
				int a = ata(T[j].ff);
				int b = ata(T[j].ss);
				
				if(a == b) {
					L[j] = md+1;
					A[j] = md;
				}
				else R[j] = md-1;
				
				x++;
			}
			
			int nd = arr[h].ss;
			
			for(auto j: E[nd])
				if(vis[j.ff] == 1) uni(j.ff, nd);
			
			vis[nd] = 1;
		}
	}
	for(int i = 1; i <= q; i++) cout << A[i] << "\n";
}
/*
9 12
1 9 4
1 2 5
2 3 7
2 4 3
4 3 6
3 6 4
8 7 10
6 7 5
5 8 1
9 5 7
5 4 12
6 8 2
2
4 7
5
1 6
5 3
4 8
5 8
1 5
*/

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:116:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while(x < MD.size() && MD[x].ff > arr[h].ff) {
          ~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3832 KB Output is correct
2 Correct 9 ms 3960 KB Output is correct
3 Correct 9 ms 3960 KB Output is correct
4 Correct 5 ms 3832 KB Output is correct
5 Correct 9 ms 3984 KB Output is correct
6 Correct 9 ms 3960 KB Output is correct
7 Correct 6 ms 3832 KB Output is correct
8 Correct 6 ms 3832 KB Output is correct
9 Correct 10 ms 3944 KB Output is correct
10 Correct 10 ms 3960 KB Output is correct
11 Correct 10 ms 3960 KB Output is correct
12 Correct 9 ms 3960 KB Output is correct
13 Correct 11 ms 3960 KB Output is correct
14 Correct 11 ms 3960 KB Output is correct
15 Correct 11 ms 4032 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3832 KB Output is correct
2 Correct 9 ms 3960 KB Output is correct
3 Correct 9 ms 3960 KB Output is correct
4 Correct 5 ms 3832 KB Output is correct
5 Correct 9 ms 3984 KB Output is correct
6 Correct 9 ms 3960 KB Output is correct
7 Correct 6 ms 3832 KB Output is correct
8 Correct 6 ms 3832 KB Output is correct
9 Correct 10 ms 3944 KB Output is correct
10 Correct 10 ms 3960 KB Output is correct
11 Correct 10 ms 3960 KB Output is correct
12 Correct 9 ms 3960 KB Output is correct
13 Correct 11 ms 3960 KB Output is correct
14 Correct 11 ms 3960 KB Output is correct
15 Correct 11 ms 4032 KB Output is correct
16 Correct 1082 ms 12132 KB Output is correct
17 Correct 2741 ms 23660 KB Output is correct
18 Correct 170 ms 5784 KB Output is correct
19 Correct 607 ms 13980 KB Output is correct
20 Correct 2744 ms 23668 KB Output is correct
21 Correct 1553 ms 15624 KB Output is correct
22 Correct 1185 ms 11700 KB Output is correct
23 Correct 2761 ms 23696 KB Output is correct
24 Correct 2798 ms 23720 KB Output is correct
25 Correct 2783 ms 23720 KB Output is correct
26 Correct 612 ms 14252 KB Output is correct
27 Correct 611 ms 14764 KB Output is correct
28 Correct 622 ms 14444 KB Output is correct
29 Correct 582 ms 14236 KB Output is correct
30 Correct 615 ms 13716 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1349 ms 11764 KB Output is correct
2 Correct 2327 ms 19936 KB Output is correct
3 Correct 2381 ms 19948 KB Output is correct
4 Correct 331 ms 7800 KB Output is correct
5 Correct 2379 ms 19824 KB Output is correct
6 Correct 2330 ms 19872 KB Output is correct
7 Correct 2311 ms 19944 KB Output is correct
8 Correct 2288 ms 19820 KB Output is correct
9 Correct 2282 ms 19876 KB Output is correct
10 Correct 2384 ms 19848 KB Output is correct
11 Correct 2319 ms 19812 KB Output is correct
12 Correct 2326 ms 19840 KB Output is correct
13 Correct 2342 ms 19824 KB Output is correct
14 Correct 2359 ms 19872 KB Output is correct
15 Correct 2374 ms 19892 KB Output is correct
16 Correct 2383 ms 19968 KB Output is correct
17 Correct 2335 ms 19824 KB Output is correct
18 Correct 2331 ms 19844 KB Output is correct
19 Correct 408 ms 7784 KB Output is correct
20 Correct 2363 ms 19840 KB Output is correct
21 Correct 2141 ms 19532 KB Output is correct
22 Correct 300 ms 11096 KB Output is correct
23 Correct 399 ms 8332 KB Output is correct
24 Correct 295 ms 10160 KB Output is correct
25 Correct 290 ms 10744 KB Output is correct
26 Correct 405 ms 8412 KB Output is correct
27 Correct 353 ms 7808 KB Output is correct
28 Correct 288 ms 10144 KB Output is correct
29 Correct 398 ms 7696 KB Output is correct
30 Correct 288 ms 10160 KB Output is correct
31 Correct 442 ms 7808 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3832 KB Output is correct
2 Correct 9 ms 3960 KB Output is correct
3 Correct 9 ms 3960 KB Output is correct
4 Correct 5 ms 3832 KB Output is correct
5 Correct 9 ms 3984 KB Output is correct
6 Correct 9 ms 3960 KB Output is correct
7 Correct 6 ms 3832 KB Output is correct
8 Correct 6 ms 3832 KB Output is correct
9 Correct 10 ms 3944 KB Output is correct
10 Correct 10 ms 3960 KB Output is correct
11 Correct 10 ms 3960 KB Output is correct
12 Correct 9 ms 3960 KB Output is correct
13 Correct 11 ms 3960 KB Output is correct
14 Correct 11 ms 3960 KB Output is correct
15 Correct 11 ms 4032 KB Output is correct
16 Correct 1082 ms 12132 KB Output is correct
17 Correct 2741 ms 23660 KB Output is correct
18 Correct 170 ms 5784 KB Output is correct
19 Correct 607 ms 13980 KB Output is correct
20 Correct 2744 ms 23668 KB Output is correct
21 Correct 1553 ms 15624 KB Output is correct
22 Correct 1185 ms 11700 KB Output is correct
23 Correct 2761 ms 23696 KB Output is correct
24 Correct 2798 ms 23720 KB Output is correct
25 Correct 2783 ms 23720 KB Output is correct
26 Correct 612 ms 14252 KB Output is correct
27 Correct 611 ms 14764 KB Output is correct
28 Correct 622 ms 14444 KB Output is correct
29 Correct 582 ms 14236 KB Output is correct
30 Correct 615 ms 13716 KB Output is correct
31 Correct 6 ms 3832 KB Output is correct
32 Correct 6 ms 3832 KB Output is correct
33 Correct 6 ms 3944 KB Output is correct
34 Correct 6 ms 3832 KB Output is correct
35 Correct 6 ms 3832 KB Output is correct
36 Correct 6 ms 3832 KB Output is correct
37 Correct 6 ms 3836 KB Output is correct
38 Correct 6 ms 3832 KB Output is correct
39 Correct 6 ms 3832 KB Output is correct
40 Correct 6 ms 3832 KB Output is correct
41 Correct 1349 ms 11764 KB Output is correct
42 Correct 2327 ms 19936 KB Output is correct
43 Correct 2381 ms 19948 KB Output is correct
44 Correct 331 ms 7800 KB Output is correct
45 Correct 2379 ms 19824 KB Output is correct
46 Correct 2330 ms 19872 KB Output is correct
47 Correct 2311 ms 19944 KB Output is correct
48 Correct 2288 ms 19820 KB Output is correct
49 Correct 2282 ms 19876 KB Output is correct
50 Correct 2384 ms 19848 KB Output is correct
51 Correct 2319 ms 19812 KB Output is correct
52 Correct 2326 ms 19840 KB Output is correct
53 Correct 2342 ms 19824 KB Output is correct
54 Correct 2359 ms 19872 KB Output is correct
55 Correct 2374 ms 19892 KB Output is correct
56 Correct 2383 ms 19968 KB Output is correct
57 Correct 2335 ms 19824 KB Output is correct
58 Correct 2331 ms 19844 KB Output is correct
59 Correct 408 ms 7784 KB Output is correct
60 Correct 2363 ms 19840 KB Output is correct
61 Correct 2141 ms 19532 KB Output is correct
62 Correct 300 ms 11096 KB Output is correct
63 Correct 399 ms 8332 KB Output is correct
64 Correct 295 ms 10160 KB Output is correct
65 Correct 290 ms 10744 KB Output is correct
66 Correct 405 ms 8412 KB Output is correct
67 Correct 353 ms 7808 KB Output is correct
68 Correct 288 ms 10144 KB Output is correct
69 Correct 398 ms 7696 KB Output is correct
70 Correct 288 ms 10160 KB Output is correct
71 Correct 442 ms 7808 KB Output is correct
72 Correct 1800 ms 15404 KB Output is correct
73 Correct 2888 ms 23472 KB Output is correct
74 Correct 2830 ms 23524 KB Output is correct
75 Correct 2874 ms 23476 KB Output is correct
76 Correct 2878 ms 23536 KB Output is correct
77 Correct 2845 ms 23472 KB Output is correct
78 Correct 2818 ms 23456 KB Output is correct
79 Correct 2792 ms 23520 KB Output is correct
80 Correct 2836 ms 23488 KB Output is correct
81 Correct 2854 ms 23504 KB Output is correct
82 Correct 2855 ms 23524 KB Output is correct
83 Correct 2768 ms 23984 KB Output is correct
84 Correct 2787 ms 24656 KB Output is correct
85 Correct 2790 ms 24508 KB Output is correct
86 Correct 2767 ms 24692 KB Output is correct
87 Correct 2787 ms 24476 KB Output is correct
88 Correct 2772 ms 24420 KB Output is correct
89 Correct 1172 ms 12780 KB Output is correct
90 Correct 2842 ms 24336 KB Output is correct
91 Correct 2452 ms 23828 KB Output is correct
92 Correct 587 ms 14092 KB Output is correct
93 Correct 1056 ms 12592 KB Output is correct
94 Correct 653 ms 14772 KB Output is correct
95 Correct 590 ms 15132 KB Output is correct
96 Correct 956 ms 12496 KB Output is correct
97 Correct 990 ms 11872 KB Output is correct
98 Correct 600 ms 14324 KB Output is correct
99 Correct 1089 ms 12140 KB Output is correct
100 Correct 617 ms 14588 KB Output is correct