oj.uz

Submission #377144

# Submission time Handle Problem Language Result Execution time Memory
377144 2021-03-13T04:05:56 Z Gurban Evacuation plan (IZhO18_plan) C++17
100 / 100
 2458 ms 42748 KB 
/*
ID: gurban1
LANG: C++
TASK: 
*/
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int maxn=1e5+5;
int n,m,k,qr,p[maxn];
int dis[maxn],vis[maxn];
int l[maxn],r[maxn],ans[maxn];
vector<int>md[maxn];
vector<pair<int,int>>E[maxn],nd;
priority_queue<pair<int,int>>q;

int ata(int x){
	if(p[x] == x) return x;
	return p[x] = ata(p[x]);
}

void un(int a,int b){
	int x = ata(a),y=ata(b);
	if(x != y) p[y] = x; 
}

int main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);

	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> m;
	for(int i = 1;i <= m;i++){
		int x,y,w; cin >> x >> y >> w;
		E[x].push_back({y,w});
		E[y].push_back({x,w});
	}
	for(int i = 1;i <= n;i++) dis[i] = 1e9;
	cin >> k;
	for(int i = 1;i <= k;i++){
		int x; cin >> x;
		dis[x] = 0;
		q.push({0,x});
	}
	while(!q.empty()){
		int x = q.top().second;
		q.pop();
		if(vis[x]) continue;
		vis[x] = 1;
		for(auto i : E[x]){
			if(dis[i.first] > dis[x] + i.second){
				dis[i.first] = dis[x] + i.second;
				q.push({-dis[i.first],i.first});
			}
		}
	}

	for(int i = 1;i <= n;i++) nd.push_back({dis[i],i});
	sort(nd.begin(),nd.end());
	reverse(nd.begin(),nd.end());
	nd.insert(nd.begin(),{0,0});

	cin >> qr;
	vector<pair<int,int>>v(qr+1);
	for(int i = 1;i <= qr;i++){
		cin >> v[i].first >> v[i].second;
		l[i] = 1,r[i] = n;
	}
	// for(int i = 1;i <= n;i++) cout<<nd[i].first<<' '<<nd[i].second<<'\n';
	for(int tt = 0;tt <= 22;tt++){
		for(int i = 1;i <= n;i++) md[i].clear(),p[i] = i,vis[i]=0;
		for(int i = 1;i <= qr;i++){
			if(l[i] > r[i]) continue;
			md[(l[i]+r[i])/2].push_back(i);
		}
		for(int i = 1;i <= n;i++){
			vis[nd[i].second] = 1;
			for(auto j : E[nd[i].second]) if(vis[j.first]) un(nd[i].second,j.first);
			for(auto j : md[i]){
				if(ata(v[j].first) == ata(v[j].second)){
					ans[j] = nd[i].first;
					r[j] = i - 1;
				}
				else l[j] = i + 1;
			}
		}
	}
	for(int i = 1;i <= qr;i++) cout<<ans[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


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
1
5 3
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 5 ms 5228 KB Output is correct
3 Correct 5 ms 5228 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 6 ms 5228 KB Output is correct
6 Correct 7 ms 5228 KB Output is correct
7 Correct 5 ms 5100 KB Output is correct
8 Correct 5 ms 5100 KB Output is correct
9 Correct 6 ms 5228 KB Output is correct
10 Correct 6 ms 5228 KB Output is correct
11 Correct 6 ms 5228 KB Output is correct
12 Correct 6 ms 5228 KB Output is correct
13 Correct 6 ms 5228 KB Output is correct
14 Correct 7 ms 5228 KB Output is correct
15 Correct 6 ms 5228 KB Output is correct
16 Correct 725 ms 25048 KB Output is correct
17 Correct 2318 ms 42748 KB Output is correct
18 Correct 109 ms 8428 KB Output is correct
19 Correct 319 ms 24552 KB Output is correct
20 Correct 2275 ms 42596 KB Output is correct
21 Correct 1152 ms 30568 KB Output is correct
22 Correct 462 ms 26720 KB Output is correct
23 Correct 2292 ms 42704 KB Output is correct
24 Correct 2243 ms 42576 KB Output is correct
25 Correct 2247 ms 42412 KB Output is correct
26 Correct 327 ms 23912 KB Output is correct
27 Correct 320 ms 24424 KB Output is correct
28 Correct 316 ms 24424 KB Output is correct
29 Correct 321 ms 24168 KB Output is correct
30 Correct 326 ms 24168 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1054 ms 17260 KB Output is correct
2 Correct 1979 ms 30668 KB Output is correct
3 Correct 1972 ms 30564 KB Output is correct
4 Correct 280 ms 13536 KB Output is correct
5 Correct 2000 ms 30564 KB Output is correct
6 Correct 1954 ms 30568 KB Output is correct
7 Correct 1975 ms 30816 KB Output is correct
8 Correct 1969 ms 30564 KB Output is correct
9 Correct 1999 ms 30692 KB Output is correct
10 Correct 1982 ms 30712 KB Output is correct
11 Correct 1986 ms 30780 KB Output is correct
12 Correct 1936 ms 30564 KB Output is correct
13 Correct 1988 ms 30564 KB Output is correct
14 Correct 2009 ms 30696 KB Output is correct
15 Correct 2054 ms 31456 KB Output is correct
16 Correct 1941 ms 30492 KB Output is correct
17 Correct 2009 ms 30692 KB Output is correct
18 Correct 1951 ms 30564 KB Output is correct
19 Correct 186 ms 13536 KB Output is correct
20 Correct 1958 ms 30692 KB Output is correct
21 Correct 1657 ms 30676 KB Output is correct
22 Correct 266 ms 13796 KB Output is correct
23 Correct 262 ms 12644 KB Output is correct
24 Correct 273 ms 13800 KB Output is correct
25 Correct 258 ms 13668 KB Output is correct
26 Correct 397 ms 12512 KB Output is correct
27 Correct 255 ms 13536 KB Output is correct
28 Correct 266 ms 13668 KB Output is correct
29 Correct 270 ms 13536 KB Output is correct
30 Correct 246 ms 13800 KB Output is correct
31 Correct 260 ms 13536 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 5 ms 5228 KB Output is correct
3 Correct 5 ms 5228 KB Output is correct
4 Correct 4 ms 5100 KB Output is correct
5 Correct 6 ms 5228 KB Output is correct
6 Correct 7 ms 5228 KB Output is correct
7 Correct 5 ms 5100 KB Output is correct
8 Correct 5 ms 5100 KB Output is correct
9 Correct 6 ms 5228 KB Output is correct
10 Correct 6 ms 5228 KB Output is correct
11 Correct 6 ms 5228 KB Output is correct
12 Correct 6 ms 5228 KB Output is correct
13 Correct 6 ms 5228 KB Output is correct
14 Correct 7 ms 5228 KB Output is correct
15 Correct 6 ms 5228 KB Output is correct
16 Correct 725 ms 25048 KB Output is correct
17 Correct 2318 ms 42748 KB Output is correct
18 Correct 109 ms 8428 KB Output is correct
19 Correct 319 ms 24552 KB Output is correct
20 Correct 2275 ms 42596 KB Output is correct
21 Correct 1152 ms 30568 KB Output is correct
22 Correct 462 ms 26720 KB Output is correct
23 Correct 2292 ms 42704 KB Output is correct
24 Correct 2243 ms 42576 KB Output is correct
25 Correct 2247 ms 42412 KB Output is correct
26 Correct 327 ms 23912 KB Output is correct
27 Correct 320 ms 24424 KB Output is correct
28 Correct 316 ms 24424 KB Output is correct
29 Correct 321 ms 24168 KB Output is correct
30 Correct 326 ms 24168 KB Output is correct
31 Correct 4 ms 5100 KB Output is correct
32 Correct 4 ms 5100 KB Output is correct
33 Correct 4 ms 5100 KB Output is correct
34 Correct 4 ms 5100 KB Output is correct
35 Correct 4 ms 5100 KB Output is correct
36 Correct 4 ms 5100 KB Output is correct
37 Correct 4 ms 5100 KB Output is correct
38 Correct 4 ms 5100 KB Output is correct
39 Correct 4 ms 5100 KB Output is correct
40 Correct 4 ms 5100 KB Output is correct
41 Correct 1054 ms 17260 KB Output is correct
42 Correct 1979 ms 30668 KB Output is correct
43 Correct 1972 ms 30564 KB Output is correct
44 Correct 280 ms 13536 KB Output is correct
45 Correct 2000 ms 30564 KB Output is correct
46 Correct 1954 ms 30568 KB Output is correct
47 Correct 1975 ms 30816 KB Output is correct
48 Correct 1969 ms 30564 KB Output is correct
49 Correct 1999 ms 30692 KB Output is correct
50 Correct 1982 ms 30712 KB Output is correct
51 Correct 1986 ms 30780 KB Output is correct
52 Correct 1936 ms 30564 KB Output is correct
53 Correct 1988 ms 30564 KB Output is correct
54 Correct 2009 ms 30696 KB Output is correct
55 Correct 2054 ms 31456 KB Output is correct
56 Correct 1941 ms 30492 KB Output is correct
57 Correct 2009 ms 30692 KB Output is correct
58 Correct 1951 ms 30564 KB Output is correct
59 Correct 186 ms 13536 KB Output is correct
60 Correct 1958 ms 30692 KB Output is correct
61 Correct 1657 ms 30676 KB Output is correct
62 Correct 266 ms 13796 KB Output is correct
63 Correct 262 ms 12644 KB Output is correct
64 Correct 273 ms 13800 KB Output is correct
65 Correct 258 ms 13668 KB Output is correct
66 Correct 397 ms 12512 KB Output is correct
67 Correct 255 ms 13536 KB Output is correct
68 Correct 266 ms 13668 KB Output is correct
69 Correct 270 ms 13536 KB Output is correct
70 Correct 246 ms 13800 KB Output is correct
71 Correct 260 ms 13536 KB Output is correct
72 Correct 1476 ms 29924 KB Output is correct
73 Correct 2388 ms 42520 KB Output is correct
74 Correct 2369 ms 42632 KB Output is correct
75 Correct 2377 ms 42360 KB Output is correct
76 Correct 2338 ms 42356 KB Output is correct
77 Correct 2453 ms 42552 KB Output is correct
78 Correct 2380 ms 42412 KB Output is correct
79 Correct 2345 ms 42328 KB Output is correct
80 Correct 2458 ms 42272 KB Output is correct
81 Correct 2384 ms 42316 KB Output is correct
82 Correct 2334 ms 42388 KB Output is correct
83 Correct 2339 ms 42356 KB Output is correct
84 Correct 2317 ms 42328 KB Output is correct
85 Correct 2335 ms 42340 KB Output is correct
86 Correct 2322 ms 42544 KB Output is correct
87 Correct 2281 ms 42520 KB Output is correct
88 Correct 2289 ms 42428 KB Output is correct
89 Correct 523 ms 28000 KB Output is correct
90 Correct 2281 ms 42360 KB Output is correct
91 Correct 1927 ms 42256 KB Output is correct
92 Correct 318 ms 24424 KB Output is correct
93 Correct 479 ms 24928 KB Output is correct
94 Correct 327 ms 24168 KB Output is correct
95 Correct 324 ms 24192 KB Output is correct
96 Correct 443 ms 23392 KB Output is correct
97 Correct 510 ms 25568 KB Output is correct
98 Correct 336 ms 23784 KB Output is correct
99 Correct 524 ms 25564 KB Output is correct
100 Correct 326 ms 24424 KB Output is correct