oj.uz

Submission #77083

# Submission time Handle Problem Language Result Execution time Memory
77083 2018-09-20T17:21:04 Z zetapi Evacuation plan (IZhO18_plan) C++14
100 / 100
 1144 ms 89400 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define pb  push_back
#define mp  make_pair
#define int long long
#define itr iterator
 
typedef pair<int,int> pii;
 
const int MAX=2e5;
const int INF=1e12;
 
vector<pair<int,pii>> edge;
 
vector<pii> adj[MAX];
vector<int> vec[MAX];
 
int N,M,K,Q,X,Y,Z,arr[MAX],wei[MAX],hei[MAX],Value[MAX][20],Parent[MAX][20];
int par[MAX],rank_[MAX];
 
void init()
{
	for(int A=1;A<=N;A++)
	{
		par[A]=A;
		rank_[A]=0;
	}
	return ;
}
 
int root(int X)
{
	if(par[X]==X)
		return X;
	return par[X]=root(par[X]);
}
 
void unions(int X,int Y)
{
	int u=root(X),v=root(Y);
	if(u==v)
		return ;
	vec[X].pb(Y);
	vec[Y].pb(X);
	if(rank_[u]<rank_[v])
		par[u]=v;
	else if(rank_[v]<rank_[u])
		par[v]=u;
	else
	{
		par[u]=v;
		rank_[v]++;
	}
	return ;
}
 
void dfs(int node,int par)
{
	assert(Parent[node][0]==0);
	Parent[node][0]=par;
	Value[node][0]=min(wei[node],wei[par]);
	assert(Value[node][0]!=INF);
	for(auto A:vec[node])
	{
		if(A==par)
			continue;
		hei[A]=hei[node]+1;
		dfs(A,node);
	}
	return ;
}
 
void dijkstra()
{
	int vis[MAX];
	priority_queue<pii,vector<pii>,greater<pii>> pq;
	for(int A=0;A<=N;A++)
	{
		vis[A]=0;
		wei[A]=INF;
	}
	for(int A=1;A<=K;A++)
	{
		wei[arr[A]]=0;
		pq.push(mp(0,arr[A]));
	}
	while(!pq.empty())
	{
		pii cur=pq.top();
		pq.pop();
		if(vis[cur.second])
			continue;
		vis[cur.second]=1;
		for(auto A:adj[cur.second])
		{
			if(A.second+cur.first<wei[A.first])
			{
				wei[A.first]=A.second+cur.first;
				pq.push(mp(wei[A.first],A.first));
			}
		}
	}
	return ;
}
 
int lca(int X,int Y)
{
	if(hei[X]>hei[Y])
		swap(X,Y);
	int dis=hei[Y]-hei[X];
	for(int A=19;A>=0;A--)
		if(dis&(1<<A))
			dis-=(1<<A),
			Y=Parent[Y][A];
	assert(dis==0);
	assert(hei[X]==hei[Y]);
	if(X==Y)
		return X;
	for(int A=19;A>=0;A--)
	{
		if(Parent[X][A]!=Parent[Y][A])
		{
			X=Parent[X][A];
			Y=Parent[Y][A];
		}
	}
	assert(Parent[X][0]==Parent[Y][0]);
	return Parent[X][0];
}
 
int query(int X,int Y)
{
	int res=INF;
	for(int A=19;A>=0;A--)
	{
		if(hei[Parent[X][A]]>=hei[Y])
		{
			res=min(res,Value[X][A]);
			X=Parent[X][A];
		}
	}
	return res;
}
 
signed main()
{
	ios_base::sync_with_stdio(false);
 
	cin>>N>>M;
	for(int A=1;A<=M;A++)
	{
		cin>>X>>Y>>Z;
		adj[X].pb(mp(Y,Z));
		adj[Y].pb(mp(X,Z));
		edge.pb(mp(Z,mp(X,Y)));
	}
	cin>>K;
	for(int A=1;A<=K;A++)
		cin>>arr[A];
	dijkstra();
	/*for(int A=1;A<=N;A++)
		cout<<"shortest distance for node "<<A<<" is "<<wei[A]<<"\n";*/
	for(int A=0;A<edge.size();A++)
		edge[A].first=min(wei[edge[A].second.first],wei[edge[A].second.second]);
	sort(edge.begin(),edge.end());
	reverse(edge.begin(),edge.end());
	init();
	for(auto A:edge)
		unions(A.second.first,A.second.second);
	dfs(1,0);
	for(int A=2;A<=N;A++)
		assert(Parent[A][0]!=0);
	for(int A=0;A<20;A++)
		Value[0][A]=INF;
	for(int A=1;A<20;A++)
	{
		for(int B=1;B<=N;B++)
		{
			Parent[B][A]=Parent[Parent[B][A-1]][A-1];
			Value[B][A]=min(Value[B][A-1],Value[Parent[B][A-1]][A-1]);
		}
	}
	cin>>Q;
	while(Q--)
	{
		cin>>X>>Y;
		int cur=lca(X,Y);
		cout<<min(query(X,cur),query(Y,cur))<<"\n";
	}
	return 0;
}

Compilation message

plan.cpp: In function 'int main()':
plan.cpp:164:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int A=0;A<edge.size();A++)
              ~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 14 ms 10232 KB Output is correct
3 Correct 14 ms 10232 KB Output is correct
4 Correct 10 ms 9848 KB Output is correct
5 Correct 14 ms 10232 KB Output is correct
6 Correct 15 ms 10232 KB Output is correct
7 Correct 10 ms 9848 KB Output is correct
8 Correct 10 ms 9852 KB Output is correct
9 Correct 14 ms 10228 KB Output is correct
10 Correct 15 ms 10232 KB Output is correct
11 Correct 15 ms 10336 KB Output is correct
12 Correct 14 ms 10216 KB Output is correct
13 Correct 15 ms 10232 KB Output is correct
14 Correct 15 ms 10232 KB Output is correct
15 Correct 15 ms 10232 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 14 ms 10232 KB Output is correct
3 Correct 14 ms 10232 KB Output is correct
4 Correct 10 ms 9848 KB Output is correct
5 Correct 14 ms 10232 KB Output is correct
6 Correct 15 ms 10232 KB Output is correct
7 Correct 10 ms 9848 KB Output is correct
8 Correct 10 ms 9852 KB Output is correct
9 Correct 14 ms 10228 KB Output is correct
10 Correct 15 ms 10232 KB Output is correct
11 Correct 15 ms 10336 KB Output is correct
12 Correct 14 ms 10216 KB Output is correct
13 Correct 15 ms 10232 KB Output is correct
14 Correct 15 ms 10232 KB Output is correct
15 Correct 15 ms 10232 KB Output is correct
16 Correct 577 ms 47832 KB Output is correct
17 Correct 1083 ms 86836 KB Output is correct
18 Correct 89 ms 17836 KB Output is correct
19 Correct 531 ms 56524 KB Output is correct
20 Correct 1091 ms 86812 KB Output is correct
21 Correct 776 ms 64464 KB Output is correct
22 Correct 581 ms 60072 KB Output is correct
23 Correct 1144 ms 86780 KB Output is correct
24 Correct 1111 ms 86820 KB Output is correct
25 Correct 1074 ms 86852 KB Output is correct
26 Correct 529 ms 56240 KB Output is correct
27 Correct 523 ms 56460 KB Output is correct
28 Correct 533 ms 56196 KB Output is correct
29 Correct 527 ms 56380 KB Output is correct
30 Correct 541 ms 56448 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 9848 KB Output is correct
2 Correct 10 ms 9820 KB Output is correct
3 Correct 10 ms 9780 KB Output is correct
4 Correct 10 ms 9744 KB Output is correct
5 Correct 10 ms 9816 KB Output is correct
6 Correct 13 ms 9792 KB Output is correct
7 Correct 11 ms 9720 KB Output is correct
8 Correct 10 ms 9720 KB Output is correct
9 Correct 10 ms 9720 KB Output is correct
10 Correct 11 ms 9720 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 363 ms 63088 KB Output is correct
2 Correct 714 ms 86384 KB Output is correct
3 Correct 724 ms 86568 KB Output is correct
4 Correct 246 ms 57356 KB Output is correct
5 Correct 693 ms 86400 KB Output is correct
6 Correct 685 ms 86460 KB Output is correct
7 Correct 699 ms 86456 KB Output is correct
8 Correct 695 ms 86388 KB Output is correct
9 Correct 710 ms 86448 KB Output is correct
10 Correct 704 ms 86496 KB Output is correct
11 Correct 694 ms 86500 KB Output is correct
12 Correct 714 ms 86556 KB Output is correct
13 Correct 717 ms 86344 KB Output is correct
14 Correct 713 ms 86536 KB Output is correct
15 Correct 742 ms 88576 KB Output is correct
16 Correct 707 ms 86416 KB Output is correct
17 Correct 701 ms 86324 KB Output is correct
18 Correct 694 ms 86492 KB Output is correct
19 Correct 238 ms 58800 KB Output is correct
20 Correct 712 ms 86432 KB Output is correct
21 Correct 720 ms 86544 KB Output is correct
22 Correct 192 ms 56004 KB Output is correct
23 Correct 233 ms 56476 KB Output is correct
24 Correct 195 ms 56012 KB Output is correct
25 Correct 199 ms 56136 KB Output is correct
26 Correct 254 ms 56856 KB Output is correct
27 Correct 249 ms 58660 KB Output is correct
28 Correct 196 ms 56040 KB Output is correct
29 Correct 242 ms 57968 KB Output is correct
30 Correct 190 ms 55996 KB Output is correct
31 Correct 265 ms 57960 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 14 ms 10232 KB Output is correct
3 Correct 14 ms 10232 KB Output is correct
4 Correct 10 ms 9848 KB Output is correct
5 Correct 14 ms 10232 KB Output is correct
6 Correct 15 ms 10232 KB Output is correct
7 Correct 10 ms 9848 KB Output is correct
8 Correct 10 ms 9852 KB Output is correct
9 Correct 14 ms 10228 KB Output is correct
10 Correct 15 ms 10232 KB Output is correct
11 Correct 15 ms 10336 KB Output is correct
12 Correct 14 ms 10216 KB Output is correct
13 Correct 15 ms 10232 KB Output is correct
14 Correct 15 ms 10232 KB Output is correct
15 Correct 15 ms 10232 KB Output is correct
16 Correct 577 ms 47832 KB Output is correct
17 Correct 1083 ms 86836 KB Output is correct
18 Correct 89 ms 17836 KB Output is correct
19 Correct 531 ms 56524 KB Output is correct
20 Correct 1091 ms 86812 KB Output is correct
21 Correct 776 ms 64464 KB Output is correct
22 Correct 581 ms 60072 KB Output is correct
23 Correct 1144 ms 86780 KB Output is correct
24 Correct 1111 ms 86820 KB Output is correct
25 Correct 1074 ms 86852 KB Output is correct
26 Correct 529 ms 56240 KB Output is correct
27 Correct 523 ms 56460 KB Output is correct
28 Correct 533 ms 56196 KB Output is correct
29 Correct 527 ms 56380 KB Output is correct
30 Correct 541 ms 56448 KB Output is correct
31 Correct 12 ms 9848 KB Output is correct
32 Correct 10 ms 9820 KB Output is correct
33 Correct 10 ms 9780 KB Output is correct
34 Correct 10 ms 9744 KB Output is correct
35 Correct 10 ms 9816 KB Output is correct
36 Correct 13 ms 9792 KB Output is correct
37 Correct 11 ms 9720 KB Output is correct
38 Correct 10 ms 9720 KB Output is correct
39 Correct 10 ms 9720 KB Output is correct
40 Correct 11 ms 9720 KB Output is correct
41 Correct 363 ms 63088 KB Output is correct
42 Correct 714 ms 86384 KB Output is correct
43 Correct 724 ms 86568 KB Output is correct
44 Correct 246 ms 57356 KB Output is correct
45 Correct 693 ms 86400 KB Output is correct
46 Correct 685 ms 86460 KB Output is correct
47 Correct 699 ms 86456 KB Output is correct
48 Correct 695 ms 86388 KB Output is correct
49 Correct 710 ms 86448 KB Output is correct
50 Correct 704 ms 86496 KB Output is correct
51 Correct 694 ms 86500 KB Output is correct
52 Correct 714 ms 86556 KB Output is correct
53 Correct 717 ms 86344 KB Output is correct
54 Correct 713 ms 86536 KB Output is correct
55 Correct 742 ms 88576 KB Output is correct
56 Correct 707 ms 86416 KB Output is correct
57 Correct 701 ms 86324 KB Output is correct
58 Correct 694 ms 86492 KB Output is correct
59 Correct 238 ms 58800 KB Output is correct
60 Correct 712 ms 86432 KB Output is correct
61 Correct 720 ms 86544 KB Output is correct
62 Correct 192 ms 56004 KB Output is correct
63 Correct 233 ms 56476 KB Output is correct
64 Correct 195 ms 56012 KB Output is correct
65 Correct 199 ms 56136 KB Output is correct
66 Correct 254 ms 56856 KB Output is correct
67 Correct 249 ms 58660 KB Output is correct
68 Correct 196 ms 56040 KB Output is correct
69 Correct 242 ms 57968 KB Output is correct
70 Correct 190 ms 55996 KB Output is correct
71 Correct 265 ms 57960 KB Output is correct
72 Correct 775 ms 63556 KB Output is correct
73 Correct 1122 ms 86812 KB Output is correct
74 Correct 1089 ms 86900 KB Output is correct
75 Correct 1104 ms 86832 KB Output is correct
76 Correct 1082 ms 86940 KB Output is correct
77 Correct 1078 ms 86760 KB Output is correct
78 Correct 1098 ms 86792 KB Output is correct
79 Correct 1124 ms 86808 KB Output is correct
80 Correct 1097 ms 86848 KB Output is correct
81 Correct 1093 ms 86852 KB Output is correct
82 Correct 1140 ms 86952 KB Output is correct
83 Correct 1078 ms 86804 KB Output is correct
84 Correct 1116 ms 86948 KB Output is correct
85 Correct 1099 ms 89076 KB Output is correct
86 Correct 1092 ms 86932 KB Output is correct
87 Correct 1094 ms 86812 KB Output is correct
88 Correct 1076 ms 86936 KB Output is correct
89 Correct 687 ms 59876 KB Output is correct
90 Correct 1097 ms 89400 KB Output is correct
91 Correct 1063 ms 89272 KB Output is correct
92 Correct 564 ms 57144 KB Output is correct
93 Correct 657 ms 58148 KB Output is correct
94 Correct 562 ms 57356 KB Output is correct
95 Correct 569 ms 57316 KB Output is correct
96 Correct 677 ms 58064 KB Output is correct
97 Correct 709 ms 59228 KB Output is correct
98 Correct 569 ms 57284 KB Output is correct
99 Correct 685 ms 60216 KB Output is correct
100 Correct 558 ms 57788 KB Output is correct