답안 #47723 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
47723	2018-05-06T18:26:50 Z	dqhungdl	Evacuation plan (IZhO18_plan)	C++17	54 / 100	4000 ms	43732 KB

plan

#include <bits/stdc++.h>
using namespace std;
 
const int MAX=17;
typedef pair<int,int> ii;
int n,m,k,T,d[100005],R[100005],S[100005],h[100005],P[100005][20],mind[100005][20];
vector<ii> Edge,g[100005],gg[100005];
set<ii> s;
 
bool cmp(ii x1,ii x2)
{
	return min(d[x1.first],d[x1.second])>min(d[x2.first],d[x2.second]);
}
 
int Find(int u)
{
	if(u==R[u])
		return u;
	return R[u]=Find(R[u]);
}
 
void Union(int u,int v)
{
	if(S[u]>S[v])
	{
		S[u]+=S[v];
		R[v]=u;
	}
	else
	{
		S[v]+=S[u];
		R[u]=v;
	}
}
 
void Enter()
{
	cin>>n>>m;
	int u,v,w;
	while(m--)
	{
		cin>>u>>v>>w;
		Edge.push_back(ii(u,v));
		g[u].push_back(ii(v,w));
		g[v].push_back(ii(u,w));
	}
	for(int i=1;i<=n;i++)
	{
		d[i]=1e9;
		R[i]=i;
	}
	cin>>k;
	while(k--)
	{
		cin>>u;
		s.insert(ii(0,u));
		d[u]=0;
	}
}
 
void BFS()
{
	while(s.size()>0)
	{
		int u=(*s.begin()).second;
		s.erase(s.begin());
		for(int i=0;i<g[u].size();i++)
		{
			int v=g[u][i].first;
			int w=g[u][i].second;
			if(d[v]>d[u]+w)
			{
				if(d[v]!=1e9)
					s.erase(s.find(ii(d[v],v)));
				d[v]=d[u]+w;
				s.insert(ii(d[v],v));
			}
		}
	}
}
 
void DFS(int u,int high)
{
	h[u]=high;
	for(int i=0;i<gg[u].size();i++)
	{
		int v=gg[u][i].first;
		int w=gg[u][i].second;
		if(h[v]==0)
		{
			P[v][0]=u;
			mind[v][0]=w;
			DFS(v,high+1);					
		}
	}
}
 
int LCA(int u,int v)
{
	int rs=1e9;
    for(int k=MAX;k>=0;k--)
        if(h[P[u][k]]>=h[v])
        {
        	rs=min(rs,mind[u][k]);
            u=P[u][k];         
        }
        else
        if(h[P[v][k]]>=h[u])
        {
        	rs=min(rs,mind[v][k]);
            v=P[v][k];
        }
    for(int k=10;k>=0;k--)
        if(P[u][k]!=P[v][k])
        {
        	rs=min(rs,mind[u][k]);
        	rs=min(rs,mind[v][k]);
            u=P[u][k];
            v=P[v][k];
        }
    while(u!=v)
    {
    	rs=min(rs,mind[u][0]);
        rs=min(rs,mind[v][0]);
        u=P[u][0];
        v=P[v][0];
    }
    return rs;
}
 
void InitTree()
{
	sort(Edge.begin(),Edge.end(),cmp);
	for(int i=0;i<Edge.size();i++)
	{
		int u=Edge[i].first;
		int v=Edge[i].second;
		int w=min(d[u],d[v]);
		if(Find(u)!=Find(v))
		{
			Union(Find(u),Find(v));
			gg[u].push_back(ii(v,w));
			gg[v].push_back(ii(u,w));
		}
	}
	DFS(1,1);
	for(int k=1;k<=MAX;k++)
    	for(int i=1;i<=n;i++)
    	{
			P[i][k]=P[P[i][k-1]][k-1];
			mind[i][k]=min(mind[i][k-1],mind[P[i][k-1]][k-1]);
    	}
}
 
void Query()
{
	cin>>T;
	int u,v;
	while(T--)
	{
		cin>>u>>v;
		cout<<LCA(u,v)<<"\n";
	}
}
 
int main()
{
	ios_base::sync_with_stdio(false);
	//freopen("TEST.INP","r",stdin);
	//freopen("TEST.OUT","w",stdout);
	Enter();
	BFS();
	InitTree();
	Query();
}

Compilation message

plan.cpp: In function 'void BFS()':
plan.cpp:67:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<g[u].size();i++)
               ~^~~~~~~~~~~~
plan.cpp: In function 'void DFS(int, int)':
plan.cpp:85:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<gg[u].size();i++)
              ~^~~~~~~~~~~~~
plan.cpp: In function 'void InitTree()':
plan.cpp:134:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<Edge.size();i++)
              ~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4984 KB	Output is correct
2	Correct	10 ms	5368 KB	Output is correct
3	Correct	10 ms	5340 KB	Output is correct
4	Correct	6 ms	4984 KB	Output is correct
5	Correct	10 ms	5368 KB	Output is correct
6	Correct	10 ms	5368 KB	Output is correct
7	Correct	6 ms	5112 KB	Output is correct
8	Correct	6 ms	5112 KB	Output is correct
9	Correct	10 ms	5368 KB	Output is correct
10	Correct	10 ms	5368 KB	Output is correct
11	Correct	10 ms	5368 KB	Output is correct
12	Correct	10 ms	5368 KB	Output is correct
13	Correct	10 ms	5368 KB	Output is correct
14	Correct	10 ms	5368 KB	Output is correct
15	Correct	10 ms	5368 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4984 KB	Output is correct
2	Correct	10 ms	5368 KB	Output is correct
3	Correct	10 ms	5340 KB	Output is correct
4	Correct	6 ms	4984 KB	Output is correct
5	Correct	10 ms	5368 KB	Output is correct
6	Correct	10 ms	5368 KB	Output is correct
7	Correct	6 ms	5112 KB	Output is correct
8	Correct	6 ms	5112 KB	Output is correct
9	Correct	10 ms	5368 KB	Output is correct
10	Correct	10 ms	5368 KB	Output is correct
11	Correct	10 ms	5368 KB	Output is correct
12	Correct	10 ms	5368 KB	Output is correct
13	Correct	10 ms	5368 KB	Output is correct
14	Correct	10 ms	5368 KB	Output is correct
15	Correct	10 ms	5368 KB	Output is correct
16	Correct	525 ms	25964 KB	Output is correct
17	Correct	1144 ms	43068 KB	Output is correct
18	Correct	84 ms	9408 KB	Output is correct
19	Correct	515 ms	32372 KB	Output is correct
20	Correct	1130 ms	42996 KB	Output is correct
21	Correct	782 ms	33700 KB	Output is correct
22	Correct	524 ms	34800 KB	Output is correct
23	Correct	1090 ms	43064 KB	Output is correct
24	Correct	1165 ms	42712 KB	Output is correct
25	Correct	1159 ms	42740 KB	Output is correct
26	Correct	510 ms	31852 KB	Output is correct
27	Correct	509 ms	32116 KB	Output is correct
28	Correct	522 ms	31916 KB	Output is correct
29	Correct	515 ms	32132 KB	Output is correct
30	Correct	503 ms	32052 KB	Output is correct

Subtask #3
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	5112 KB	Output is correct
2	Correct	6 ms	5112 KB	Output is correct
3	Correct	6 ms	5116 KB	Output is correct
4	Correct	7 ms	5112 KB	Output is correct
5	Correct	6 ms	5112 KB	Output is correct
6	Correct	6 ms	5112 KB	Output is correct
7	Correct	6 ms	5112 KB	Output is correct
8	Correct	6 ms	5112 KB	Output is correct
9	Correct	6 ms	5112 KB	Output is correct
10	Correct	6 ms	5112 KB	Output is correct

Subtask #4
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	384 ms	33368 KB	Output is correct
2	Correct	776 ms	42388 KB	Output is correct
3	Correct	801 ms	42304 KB	Output is correct
4	Correct	203 ms	32296 KB	Output is correct
5	Correct	796 ms	42556 KB	Output is correct
6	Correct	797 ms	42432 KB	Output is correct
7	Correct	768 ms	42432 KB	Output is correct
8	Correct	792 ms	42324 KB	Output is correct
9	Correct	776 ms	42340 KB	Output is correct
10	Correct	781 ms	42440 KB	Output is correct
11	Correct	781 ms	42388 KB	Output is correct
12	Correct	753 ms	42424 KB	Output is correct
13	Correct	784 ms	42456 KB	Output is correct
14	Correct	802 ms	42352 KB	Output is correct
15	Correct	826 ms	42344 KB	Output is correct
16	Correct	781 ms	42360 KB	Output is correct
17	Correct	804 ms	42272 KB	Output is correct
18	Correct	773 ms	42436 KB	Output is correct
19	Correct	192 ms	33728 KB	Output is correct
20	Correct	783 ms	42312 KB	Output is correct
21	Correct	694 ms	42968 KB	Output is correct
22	Correct	188 ms	31668 KB	Output is correct
23	Correct	178 ms	30760 KB	Output is correct
24	Correct	186 ms	31584 KB	Output is correct
25	Correct	185 ms	31680 KB	Output is correct
26	Correct	202 ms	30952 KB	Output is correct
27	Correct	208 ms	33600 KB	Output is correct
28	Correct	187 ms	31664 KB	Output is correct
29	Correct	217 ms	32920 KB	Output is correct
30	Correct	214 ms	31712 KB	Output is correct
31	Correct	216 ms	32872 KB	Output is correct

Subtask #5
0 / 46.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4984 KB	Output is correct
2	Correct	10 ms	5368 KB	Output is correct
3	Correct	10 ms	5340 KB	Output is correct
4	Correct	6 ms	4984 KB	Output is correct
5	Correct	10 ms	5368 KB	Output is correct
6	Correct	10 ms	5368 KB	Output is correct
7	Correct	6 ms	5112 KB	Output is correct
8	Correct	6 ms	5112 KB	Output is correct
9	Correct	10 ms	5368 KB	Output is correct
10	Correct	10 ms	5368 KB	Output is correct
11	Correct	10 ms	5368 KB	Output is correct
12	Correct	10 ms	5368 KB	Output is correct
13	Correct	10 ms	5368 KB	Output is correct
14	Correct	10 ms	5368 KB	Output is correct
15	Correct	10 ms	5368 KB	Output is correct
16	Correct	525 ms	25964 KB	Output is correct
17	Correct	1144 ms	43068 KB	Output is correct
18	Correct	84 ms	9408 KB	Output is correct
19	Correct	515 ms	32372 KB	Output is correct
20	Correct	1130 ms	42996 KB	Output is correct
21	Correct	782 ms	33700 KB	Output is correct
22	Correct	524 ms	34800 KB	Output is correct
23	Correct	1090 ms	43064 KB	Output is correct
24	Correct	1165 ms	42712 KB	Output is correct
25	Correct	1159 ms	42740 KB	Output is correct
26	Correct	510 ms	31852 KB	Output is correct
27	Correct	509 ms	32116 KB	Output is correct
28	Correct	522 ms	31916 KB	Output is correct
29	Correct	515 ms	32132 KB	Output is correct
30	Correct	503 ms	32052 KB	Output is correct
31	Correct	6 ms	5112 KB	Output is correct
32	Correct	6 ms	5112 KB	Output is correct
33	Correct	6 ms	5116 KB	Output is correct
34	Correct	7 ms	5112 KB	Output is correct
35	Correct	6 ms	5112 KB	Output is correct
36	Correct	6 ms	5112 KB	Output is correct
37	Correct	6 ms	5112 KB	Output is correct
38	Correct	6 ms	5112 KB	Output is correct
39	Correct	6 ms	5112 KB	Output is correct
40	Correct	6 ms	5112 KB	Output is correct
41	Correct	384 ms	33368 KB	Output is correct
42	Correct	776 ms	42388 KB	Output is correct
43	Correct	801 ms	42304 KB	Output is correct
44	Correct	203 ms	32296 KB	Output is correct
45	Correct	796 ms	42556 KB	Output is correct
46	Correct	797 ms	42432 KB	Output is correct
47	Correct	768 ms	42432 KB	Output is correct
48	Correct	792 ms	42324 KB	Output is correct
49	Correct	776 ms	42340 KB	Output is correct
50	Correct	781 ms	42440 KB	Output is correct
51	Correct	781 ms	42388 KB	Output is correct
52	Correct	753 ms	42424 KB	Output is correct
53	Correct	784 ms	42456 KB	Output is correct
54	Correct	802 ms	42352 KB	Output is correct
55	Correct	826 ms	42344 KB	Output is correct
56	Correct	781 ms	42360 KB	Output is correct
57	Correct	804 ms	42272 KB	Output is correct
58	Correct	773 ms	42436 KB	Output is correct
59	Correct	192 ms	33728 KB	Output is correct
60	Correct	783 ms	42312 KB	Output is correct
61	Correct	694 ms	42968 KB	Output is correct
62	Correct	188 ms	31668 KB	Output is correct
63	Correct	178 ms	30760 KB	Output is correct
64	Correct	186 ms	31584 KB	Output is correct
65	Correct	185 ms	31680 KB	Output is correct
66	Correct	202 ms	30952 KB	Output is correct
67	Correct	208 ms	33600 KB	Output is correct
68	Correct	187 ms	31664 KB	Output is correct
69	Correct	217 ms	32920 KB	Output is correct
70	Correct	214 ms	31712 KB	Output is correct
71	Correct	216 ms	32872 KB	Output is correct
72	Correct	716 ms	33712 KB	Output is correct
73	Correct	1130 ms	42752 KB	Output is correct
74	Correct	1130 ms	42820 KB	Output is correct
75	Correct	1130 ms	42916 KB	Output is correct
76	Correct	1136 ms	42784 KB	Output is correct
77	Correct	1146 ms	42908 KB	Output is correct
78	Correct	1133 ms	42736 KB	Output is correct
79	Correct	1125 ms	43060 KB	Output is correct
80	Correct	1114 ms	43448 KB	Output is correct
81	Correct	1147 ms	43612 KB	Output is correct
82	Correct	1116 ms	43400 KB	Output is correct
83	Correct	1140 ms	43416 KB	Output is correct
84	Correct	1143 ms	43488 KB	Output is correct
85	Correct	1125 ms	43732 KB	Output is correct
86	Correct	1174 ms	43532 KB	Output is correct
87	Correct	1147 ms	43368 KB	Output is correct
88	Correct	1113 ms	43640 KB	Output is correct
89	Execution timed out	4064 ms	33900 KB	Time limit exceeded
90	Halted	0 ms	0 KB	-

답안 #47723

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 13.0 / 13.0

Subtask #3 12.0 / 12.0

Subtask #4 19.0 / 19.0

Subtask #5 0 / 46.0

Subtask #1
10.0 / 10.0

Subtask #2
13.0 / 13.0

Subtask #3
12.0 / 12.0

Subtask #4
19.0 / 19.0

Subtask #5
0 / 46.0