oj.uz

Submission #237223

# Submission time Handle Problem Language Result Execution time Memory
237223 2020-06-05T09:44:26 Z kshitij_sodani Evacuation plan (IZhO18_plan) C++17
100 / 100
 2008 ms 36704 KB 
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
int n,m;
int aa,bb,cc;
vector<pair<int,int>> adj[100001];
int dist[100001];
bool cmp(pair<int,int> xx,pair<int,int> yy){
	return min(dist[xx.a],dist[xx.b])<min(dist[yy.a],dist[yy.b]);
}
pair<int,int> pp[100001];
int lo[100001];
int hi[100001];
int st[100001];
int par[100001];
int ans[100001];

int find(int no){
	if(par[no]==no){
		return no;
	}
	par[no]=find(par[no]);
	return par[no];
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>m;
	vector<pair<int,int>> ed;
	for(int i=0;i<m;i++){
		cin>>aa>>bb>>cc;
		ed.pb({aa-1,bb-1});
		adj[aa-1].pb({bb-1,cc});
		adj[bb-1].pb({aa-1,cc});
	}
	for(int i=0;i<n;i++){
		dist[i]=-1;
	}
	vector<int> kk;
	int k;
	cin>>k;
	priority_queue<pair<int,int>> x;
	for(int i=0;i<k;i++){
		cin>>aa;
		dist[aa-1]=0;
		x.push({0,aa-1});
	}
	while(x.size()){
		pair<int,int> no=x.top();
		x.pop();
		no.a=-no.a;
		for(auto j:adj[no.b]){
			if(dist[j.a]==-1 or dist[j.a]>j.b+dist[no.b]){
				dist[j.a]=j.b+dist[no.b];
				x.push({-dist[j.a],j.a});
			}
		}
	}
	sort(ed.begin(),ed.end(),cmp);
	int q;
	int ma=0;
	for(int i=0;i<n;i++){
		ma=max(ma,dist[i]);
	}
/*	for(int i=0;i<n;i++){
		cout<<dist[i]<<",";
	}
	cout<<endl;*/
	cin>>q;
	for(int i=0;i<q;i++){
		cin>>aa>>bb;
		aa-=1;
		bb-=1;
		pp[i]={aa,bb};
		lo[i]=0;
		hi[i]=ma;
	}
	reverse(ed.begin(),ed.end());
	for(int i=0;i<30;i++){
		vector<pair<int,int>> cur;
		for(int j=0;j<q;j++){
			st[j]=0;
			cur.pb({(lo[j]+hi[j])/2,j});
		}
		sort(cur.begin(),cur.end());
		reverse(cur.begin(),cur.end());
		for(int i=0;i<n;i++){
			par[i]=i;
		}
		int ind=0;
		for(auto i:ed){
			while(ind<q){
				if(cur[ind].a>min(dist[i.a],dist[i.b])){
					int x=find(pp[cur[ind].b].b);
					int y=find(pp[cur[ind].b].a);
					if(x==y){
						st[cur[ind].b]=1;
					}
					ind+=1;
				}
				else{
					break;
				}
			}
			int x=find(i.a);
			int y=find(i.b);
			par[x]=y;
		}
		while(ind<q){
			int x=find(pp[cur[ind].b].b);
			int y=find(pp[cur[ind].b].a);
			if(x==y){
				st[cur[ind].b]=1;
			}
			ind+=1;
		}

		for(int i=0;i<q;i++){
			if(st[i]==1){
				lo[i]=(lo[i]+hi[i])/2;
			}
			else{
				hi[i]=(lo[i]+hi[i])/2;
			}
		}
	}
	for(int i=0;i<q;i++){
	//	cout<<lo[i]<<":"<<hi[i]<<endl;
		ans[i]=lo[i];
	}
	for(int i=0;i<1;i++){
		vector<pair<int,int>> cur;
		for(int j=0;j<q;j++){
			st[j]=0;
			cur.pb({hi[j],j});
		}
		sort(cur.begin(),cur.end());
		reverse(cur.begin(),cur.end());
		for(int i=0;i<n;i++){
			par[i]=i;
		}
		int ind=0;
		for(auto i:ed){
			while(ind<q){
				if(cur[ind].a>min(dist[i.a],dist[i.b])){
					int x=find(pp[cur[ind].b].b);
					int y=find(pp[cur[ind].b].a);
					if(x==y){
						st[cur[ind].b]=1;
					}
					ind+=1;
				}
				else{
					break;
				}
			}
			int x=find(i.a);
			int y=find(i.b);
			par[x]=y;
		}
		while(ind<q){
			int x=find(pp[cur[ind].b].b);
			int y=find(pp[cur[ind].b].a);
			if(x==y){
				st[cur[ind].b]=1;
			}
			ind+=1;
		}

		for(int i=0;i<q;i++){
			if(st[i]==1){
				ans[i]=max(ans[i],hi[i]);
			}
		}
	}
	for(int i=0;i<q;i++){
		cout<<ans[i]<<'\n';
	}




	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 9 ms 2816 KB Output is correct
3 Correct 9 ms 2816 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct
5 Correct 9 ms 2816 KB Output is correct
6 Correct 9 ms 2816 KB Output is correct
7 Correct 6 ms 2816 KB Output is correct
8 Correct 6 ms 2816 KB Output is correct
9 Correct 10 ms 2944 KB Output is correct
10 Correct 10 ms 2816 KB Output is correct
11 Correct 11 ms 2944 KB Output is correct
12 Correct 9 ms 2944 KB Output is correct
13 Correct 11 ms 2944 KB Output is correct
14 Correct 10 ms 2816 KB Output is correct
15 Correct 10 ms 2816 KB Output is correct
16 Correct 810 ms 15404 KB Output is correct
17 Correct 1910 ms 36428 KB Output is correct
18 Correct 133 ms 5744 KB Output is correct
19 Correct 392 ms 16800 KB Output is correct
20 Correct 1915 ms 36400 KB Output is correct
21 Correct 996 ms 21368 KB Output is correct
22 Correct 578 ms 15140 KB Output is correct
23 Correct 1943 ms 36380 KB Output is correct
24 Correct 2008 ms 36396 KB Output is correct
25 Correct 1903 ms 36340 KB Output is correct
26 Correct 474 ms 16912 KB Output is correct
27 Correct 428 ms 17044 KB Output is correct
28 Correct 458 ms 17560 KB Output is correct
29 Correct 407 ms 16664 KB Output is correct
30 Correct 408 ms 16792 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 591 ms 15844 KB Output is correct
2 Correct 1346 ms 31588 KB Output is correct
3 Correct 1337 ms 31556 KB Output is correct
4 Correct 147 ms 9836 KB Output is correct
5 Correct 1326 ms 31580 KB Output is correct
6 Correct 1265 ms 31588 KB Output is correct
7 Correct 1240 ms 31836 KB Output is correct
8 Correct 1236 ms 31580 KB Output is correct
9 Correct 1282 ms 31580 KB Output is correct
10 Correct 1239 ms 31580 KB Output is correct
11 Correct 1311 ms 31580 KB Output is correct
12 Correct 1275 ms 31708 KB Output is correct
13 Correct 1293 ms 31580 KB Output is correct
14 Correct 1247 ms 31716 KB Output is correct
15 Correct 1293 ms 32864 KB Output is correct
16 Correct 1306 ms 31712 KB Output is correct
17 Correct 1255 ms 31580 KB Output is correct
18 Correct 1244 ms 31660 KB Output is correct
19 Correct 100 ms 9836 KB Output is correct
20 Correct 1266 ms 31680 KB Output is correct
21 Correct 1131 ms 31708 KB Output is correct
22 Correct 142 ms 11360 KB Output is correct
23 Correct 157 ms 9580 KB Output is correct
24 Correct 150 ms 11484 KB Output is correct
25 Correct 154 ms 11612 KB Output is correct
26 Correct 180 ms 9704 KB Output is correct
27 Correct 148 ms 9832 KB Output is correct
28 Correct 153 ms 12128 KB Output is correct
29 Correct 145 ms 9836 KB Output is correct
30 Correct 129 ms 10976 KB Output is correct
31 Correct 146 ms 9864 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 9 ms 2816 KB Output is correct
3 Correct 9 ms 2816 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct
5 Correct 9 ms 2816 KB Output is correct
6 Correct 9 ms 2816 KB Output is correct
7 Correct 6 ms 2816 KB Output is correct
8 Correct 6 ms 2816 KB Output is correct
9 Correct 10 ms 2944 KB Output is correct
10 Correct 10 ms 2816 KB Output is correct
11 Correct 11 ms 2944 KB Output is correct
12 Correct 9 ms 2944 KB Output is correct
13 Correct 11 ms 2944 KB Output is correct
14 Correct 10 ms 2816 KB Output is correct
15 Correct 10 ms 2816 KB Output is correct
16 Correct 810 ms 15404 KB Output is correct
17 Correct 1910 ms 36428 KB Output is correct
18 Correct 133 ms 5744 KB Output is correct
19 Correct 392 ms 16800 KB Output is correct
20 Correct 1915 ms 36400 KB Output is correct
21 Correct 996 ms 21368 KB Output is correct
22 Correct 578 ms 15140 KB Output is correct
23 Correct 1943 ms 36380 KB Output is correct
24 Correct 2008 ms 36396 KB Output is correct
25 Correct 1903 ms 36340 KB Output is correct
26 Correct 474 ms 16912 KB Output is correct
27 Correct 428 ms 17044 KB Output is correct
28 Correct 458 ms 17560 KB Output is correct
29 Correct 407 ms 16664 KB Output is correct
30 Correct 408 ms 16792 KB Output is correct
31 Correct 6 ms 2688 KB Output is correct
32 Correct 6 ms 2688 KB Output is correct
33 Correct 6 ms 2688 KB Output is correct
34 Correct 6 ms 2688 KB Output is correct
35 Correct 6 ms 2688 KB Output is correct
36 Correct 6 ms 2688 KB Output is correct
37 Correct 7 ms 2688 KB Output is correct
38 Correct 6 ms 2688 KB Output is correct
39 Correct 7 ms 2688 KB Output is correct
40 Correct 6 ms 2688 KB Output is correct
41 Correct 591 ms 15844 KB Output is correct
42 Correct 1346 ms 31588 KB Output is correct
43 Correct 1337 ms 31556 KB Output is correct
44 Correct 147 ms 9836 KB Output is correct
45 Correct 1326 ms 31580 KB Output is correct
46 Correct 1265 ms 31588 KB Output is correct
47 Correct 1240 ms 31836 KB Output is correct
48 Correct 1236 ms 31580 KB Output is correct
49 Correct 1282 ms 31580 KB Output is correct
50 Correct 1239 ms 31580 KB Output is correct
51 Correct 1311 ms 31580 KB Output is correct
52 Correct 1275 ms 31708 KB Output is correct
53 Correct 1293 ms 31580 KB Output is correct
54 Correct 1247 ms 31716 KB Output is correct
55 Correct 1293 ms 32864 KB Output is correct
56 Correct 1306 ms 31712 KB Output is correct
57 Correct 1255 ms 31580 KB Output is correct
58 Correct 1244 ms 31660 KB Output is correct
59 Correct 100 ms 9836 KB Output is correct
60 Correct 1266 ms 31680 KB Output is correct
61 Correct 1131 ms 31708 KB Output is correct
62 Correct 142 ms 11360 KB Output is correct
63 Correct 157 ms 9580 KB Output is correct
64 Correct 150 ms 11484 KB Output is correct
65 Correct 154 ms 11612 KB Output is correct
66 Correct 180 ms 9704 KB Output is correct
67 Correct 148 ms 9832 KB Output is correct
68 Correct 153 ms 12128 KB Output is correct
69 Correct 145 ms 9836 KB Output is correct
70 Correct 129 ms 10976 KB Output is correct
71 Correct 146 ms 9864 KB Output is correct
72 Correct 1255 ms 21128 KB Output is correct
73 Correct 1910 ms 36448 KB Output is correct
74 Correct 1903 ms 36576 KB Output is correct
75 Correct 1913 ms 36492 KB Output is correct
76 Correct 1976 ms 36412 KB Output is correct
77 Correct 1969 ms 36444 KB Output is correct
78 Correct 1933 ms 36444 KB Output is correct
79 Correct 1974 ms 36572 KB Output is correct
80 Correct 1952 ms 36316 KB Output is correct
81 Correct 1944 ms 36496 KB Output is correct
82 Correct 1898 ms 36572 KB Output is correct
83 Correct 1967 ms 36440 KB Output is correct
84 Correct 1891 ms 36424 KB Output is correct
85 Correct 1884 ms 36704 KB Output is correct
86 Correct 1887 ms 36448 KB Output is correct
87 Correct 1933 ms 36432 KB Output is correct
88 Correct 1948 ms 36376 KB Output is correct
89 Correct 836 ms 15008 KB Output is correct
90 Correct 1969 ms 36480 KB Output is correct
91 Correct 1423 ms 36316 KB Output is correct
92 Correct 423 ms 16952 KB Output is correct
93 Correct 765 ms 15300 KB Output is correct
94 Correct 459 ms 17308 KB Output is correct
95 Correct 416 ms 16920 KB Output is correct
96 Correct 620 ms 15316 KB Output is correct
97 Correct 672 ms 14864 KB Output is correct
98 Correct 461 ms 16920 KB Output is correct
99 Correct 678 ms 15000 KB Output is correct
100 Correct 453 ms 16964 KB Output is correct