oj.uz

Submission #77078

# Submission time Handle Problem Language Result Execution time Memory
77078 2018-09-20T16:49:24 Z zetapi Evacuation plan (IZhO18_plan) C++14
54 / 100
 4000 ms 91444 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)
{
	while(X!=Y)
	{
		if(hei[X]<hei[Y])
			Y=Parent[Y][0];
		else if(hei[Y]<hei[X])
			X=Parent[X][0];
		else
			X=Parent[X][0];
	}
	return X;
	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]);
	for(int A=19;A>=0;A--)
		if(Parent[X][A]!=Parent[Y][A])
			X=Parent[X][A],
			Y=Parent[Y][A];
	return Parent[X][0];
}
 
int query(int X,int Y)
{
	int res=wei[X];
	while(X!=Y)
	{
		X=Parent[X][0];
		res=min(res,wei[X]);
	}
	return res;
	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:171: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 10264 KB Output is correct
3 Correct 14 ms 10232 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 15 ms 10340 KB Output is correct
6 Correct 14 ms 10232 KB Output is correct
7 Correct 10 ms 9852 KB Output is correct
8 Correct 11 ms 9824 KB Output is correct
9 Correct 14 ms 10232 KB Output is correct
10 Correct 14 ms 10232 KB Output is correct
11 Correct 14 ms 10232 KB Output is correct
12 Correct 14 ms 10232 KB Output is correct
13 Correct 14 ms 10232 KB Output is correct
14 Correct 14 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 10264 KB Output is correct
3 Correct 14 ms 10232 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 15 ms 10340 KB Output is correct
6 Correct 14 ms 10232 KB Output is correct
7 Correct 10 ms 9852 KB Output is correct
8 Correct 11 ms 9824 KB Output is correct
9 Correct 14 ms 10232 KB Output is correct
10 Correct 14 ms 10232 KB Output is correct
11 Correct 14 ms 10232 KB Output is correct
12 Correct 14 ms 10232 KB Output is correct
13 Correct 14 ms 10232 KB Output is correct
14 Correct 14 ms 10232 KB Output is correct
15 Correct 15 ms 10232 KB Output is correct
16 Correct 603 ms 49228 KB Output is correct
17 Correct 1229 ms 89848 KB Output is correct
18 Correct 92 ms 18224 KB Output is correct
19 Correct 504 ms 57340 KB Output is correct
20 Correct 1165 ms 90972 KB Output is correct
21 Correct 841 ms 66320 KB Output is correct
22 Correct 551 ms 61184 KB Output is correct
23 Correct 1178 ms 90108 KB Output is correct
24 Correct 1190 ms 89768 KB Output is correct
25 Correct 1192 ms 89900 KB Output is correct
26 Correct 496 ms 57460 KB Output is correct
27 Correct 497 ms 57772 KB Output is correct
28 Correct 532 ms 57760 KB Output is correct
29 Correct 508 ms 57864 KB Output is correct
30 Correct 501 ms 58036 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 11 ms 9976 KB Output is correct
3 Correct 11 ms 9848 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 11 ms 9848 KB Output is correct
6 Correct 11 ms 9848 KB Output is correct
7 Correct 11 ms 9720 KB Output is correct
8 Correct 11 ms 9720 KB Output is correct
9 Correct 9 ms 9816 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 392 ms 62916 KB Output is correct
2 Correct 711 ms 86380 KB Output is correct
3 Correct 727 ms 86496 KB Output is correct
4 Correct 262 ms 57340 KB Output is correct
5 Correct 709 ms 86480 KB Output is correct
6 Correct 731 ms 86432 KB Output is correct
7 Correct 718 ms 86480 KB Output is correct
8 Correct 705 ms 86416 KB Output is correct
9 Correct 735 ms 86544 KB Output is correct
10 Correct 734 ms 86512 KB Output is correct
11 Correct 719 ms 86524 KB Output is correct
12 Correct 697 ms 86596 KB Output is correct
13 Correct 760 ms 86400 KB Output is correct
14 Correct 729 ms 86456 KB Output is correct
15 Correct 700 ms 88680 KB Output is correct
16 Correct 719 ms 86544 KB Output is correct
17 Correct 689 ms 86408 KB Output is correct
18 Correct 713 ms 86452 KB Output is correct
19 Correct 235 ms 58872 KB Output is correct
20 Correct 708 ms 88928 KB Output is correct
21 Correct 704 ms 88696 KB Output is correct
22 Correct 199 ms 57148 KB Output is correct
23 Correct 219 ms 57636 KB Output is correct
24 Correct 184 ms 57184 KB Output is correct
25 Correct 230 ms 56912 KB Output is correct
26 Correct 238 ms 57768 KB Output is correct
27 Correct 261 ms 59396 KB Output is correct
28 Correct 192 ms 56664 KB Output is correct
29 Correct 253 ms 58980 KB Output is correct
30 Correct 195 ms 56892 KB Output is correct
31 Correct 252 ms 59044 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 9720 KB Output is correct
2 Correct 14 ms 10264 KB Output is correct
3 Correct 14 ms 10232 KB Output is correct
4 Correct 10 ms 9720 KB Output is correct
5 Correct 15 ms 10340 KB Output is correct
6 Correct 14 ms 10232 KB Output is correct
7 Correct 10 ms 9852 KB Output is correct
8 Correct 11 ms 9824 KB Output is correct
9 Correct 14 ms 10232 KB Output is correct
10 Correct 14 ms 10232 KB Output is correct
11 Correct 14 ms 10232 KB Output is correct
12 Correct 14 ms 10232 KB Output is correct
13 Correct 14 ms 10232 KB Output is correct
14 Correct 14 ms 10232 KB Output is correct
15 Correct 15 ms 10232 KB Output is correct
16 Correct 603 ms 49228 KB Output is correct
17 Correct 1229 ms 89848 KB Output is correct
18 Correct 92 ms 18224 KB Output is correct
19 Correct 504 ms 57340 KB Output is correct
20 Correct 1165 ms 90972 KB Output is correct
21 Correct 841 ms 66320 KB Output is correct
22 Correct 551 ms 61184 KB Output is correct
23 Correct 1178 ms 90108 KB Output is correct
24 Correct 1190 ms 89768 KB Output is correct
25 Correct 1192 ms 89900 KB Output is correct
26 Correct 496 ms 57460 KB Output is correct
27 Correct 497 ms 57772 KB Output is correct
28 Correct 532 ms 57760 KB Output is correct
29 Correct 508 ms 57864 KB Output is correct
30 Correct 501 ms 58036 KB Output is correct
31 Correct 10 ms 9720 KB Output is correct
32 Correct 11 ms 9976 KB Output is correct
33 Correct 11 ms 9848 KB Output is correct
34 Correct 10 ms 9720 KB Output is correct
35 Correct 11 ms 9848 KB Output is correct
36 Correct 11 ms 9848 KB Output is correct
37 Correct 11 ms 9720 KB Output is correct
38 Correct 11 ms 9720 KB Output is correct
39 Correct 9 ms 9816 KB Output is correct
40 Correct 11 ms 9720 KB Output is correct
41 Correct 392 ms 62916 KB Output is correct
42 Correct 711 ms 86380 KB Output is correct
43 Correct 727 ms 86496 KB Output is correct
44 Correct 262 ms 57340 KB Output is correct
45 Correct 709 ms 86480 KB Output is correct
46 Correct 731 ms 86432 KB Output is correct
47 Correct 718 ms 86480 KB Output is correct
48 Correct 705 ms 86416 KB Output is correct
49 Correct 735 ms 86544 KB Output is correct
50 Correct 734 ms 86512 KB Output is correct
51 Correct 719 ms 86524 KB Output is correct
52 Correct 697 ms 86596 KB Output is correct
53 Correct 760 ms 86400 KB Output is correct
54 Correct 729 ms 86456 KB Output is correct
55 Correct 700 ms 88680 KB Output is correct
56 Correct 719 ms 86544 KB Output is correct
57 Correct 689 ms 86408 KB Output is correct
58 Correct 713 ms 86452 KB Output is correct
59 Correct 235 ms 58872 KB Output is correct
60 Correct 708 ms 88928 KB Output is correct
61 Correct 704 ms 88696 KB Output is correct
62 Correct 199 ms 57148 KB Output is correct
63 Correct 219 ms 57636 KB Output is correct
64 Correct 184 ms 57184 KB Output is correct
65 Correct 230 ms 56912 KB Output is correct
66 Correct 238 ms 57768 KB Output is correct
67 Correct 261 ms 59396 KB Output is correct
68 Correct 192 ms 56664 KB Output is correct
69 Correct 253 ms 58980 KB Output is correct
70 Correct 195 ms 56892 KB Output is correct
71 Correct 252 ms 59044 KB Output is correct
72 Correct 1010 ms 65204 KB Output is correct
73 Correct 1219 ms 89440 KB Output is correct
74 Correct 1214 ms 89592 KB Output is correct
75 Correct 1275 ms 89276 KB Output is correct
76 Correct 1318 ms 89176 KB Output is correct
77 Correct 1238 ms 88940 KB Output is correct
78 Correct 1249 ms 88704 KB Output is correct
79 Correct 1203 ms 89336 KB Output is correct
80 Correct 1226 ms 88340 KB Output is correct
81 Correct 1265 ms 89188 KB Output is correct
82 Correct 1270 ms 88708 KB Output is correct
83 Correct 1227 ms 88788 KB Output is correct
84 Correct 1207 ms 89004 KB Output is correct
85 Correct 1245 ms 91444 KB Output is correct
86 Correct 1251 ms 89724 KB Output is correct
87 Correct 1240 ms 88616 KB Output is correct
88 Correct 1224 ms 89284 KB Output is correct
89 Execution timed out 4098 ms 58460 KB Time limit exceeded
90 Halted 0 ms 0 KB -