답안 #91011 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
91011	2018-12-25T15:15:01 Z	Scayre	Evacuation plan (IZhO18_plan)	C++14	100 / 100	1122 ms	80428 KB

plan

//#include <bits/stdc++.h>

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <complex>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>

#define ll long long
#define ld long double
#define ull unsigned ll
#define ioi exit(0);

#define f first
#define s second

#define inf (int)1e9 + 7

#define NFS ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define mp(x,y) make_pair(x,y)

#define lb(x) lower_bound(x)
#define ub(x) upper_bound(x)

#define pb push_back
#define ppb pop_back

#define bitcoin __builtin_popcount

#define endl "\n"

#define in(x) insert(x)

#define sz(x) (int)x.size()

#define all(x) x.begin(),x.end()

#define pw2(x) (1<<x) //2^x

#define forit(it,v) for (typeof(v.begin()) it = v.begin(); it != v.end(); ++it)

#define sqr(x) ((x) * 1ll * (x))

using namespace std;

const int N = (int)5e5 + 7, MOD = (int)1e9 + 7;

int n,m;

bool used[N];

int d[N];

vector<pair<int,int> > v[N],new_v[N];

int up[N][24],mn[N][24];

set<pair<int,int> > s;

vector<pair<int,pair<int,int> > > mx;

void dfs1(int x){
	used[x]=1;
	for(int i=0;i<sz(v[x]);i++){
		int to=v[x][i].f;
		v[x][i].s=min(d[x],d[to]);
		if(!used[to]){
			dfs1(to);
		}
	}
}

int nw;

int tin[N],tout[N];

void dfs2(int x){
	used[x]=1;
	for(int i=0;i<sz(v[x]);i++){
		int to=v[x][i].f;
		mx.pb({v[x][i].s,{x,to}});
		if(!used[to]){
			dfs2(to);
		}
	}
}

void dfs3(int x,int p=0){
	nw++;
	tin[x]=nw;
	used[x]=1;
	for(int i=0;i<sz(new_v[x]);i++){
		int to=new_v[x][i].f;
		if(!used[to]){
			dfs3(to,x);
			up[to][0]=x;
			mn[to][0]=new_v[x][i].s;
		}
	}
	tout[x]=nw;
}

int col[N],p[N],rnk[N];

int get(int v){
	if(p[v] == v) return v;
	return p[v] = get(p[v]);
}

void Merge(int u,int v){
	v = get(v);
	u = get(u);
	if(rnk[u] < rnk[v]){
		rnk[v] += rnk[u];
		p[u] = v;
	}
	else{
		rnk[u] += rnk[v];
		p[v] = u;
	}
}

bool ok(int x,int y){
	return tin[x]<=tin[y] and tout[x]>=tout[y];
}

int lca(int x,int y){
	if(ok(x,y))return x;
	if(ok(y,x))return y;
	for(int i=20;i>=0;i--){
		if(up[x][i]!=0 and !ok(up[x][i],y)){
			x=up[x][i];
		}
	}
	return up[x][0];
}

int getm(int x,int y){
	int ct=inf;
	if(x==y)return ct;
	for(int i=20;i>=0;i--){
		if(up[x][i]!=0 and !ok(up[x][i],y)){
			ct=min(ct,mn[x][i]);
			//cout << "NWE" << ' ' << x << ' ' << i << ' ' << mn[x][i] << endl;
			x=up[x][i];
		}
	}
	//cout << x << ' ' << mn[x][0] << endl;
	return min(ct,mn[x][0]);
}

int getmin(int x,int y){
	int z = lca(x,y);
	//cout << z << endl;
	//cout << getm(x,z) << ' ' << getm(y,z) << endl;
	return min(getm(x,z), getm(y,z));
}

int main(){

	#ifdef IOI2019
		freopen ("in.txt", "r", stdin);
	#endif

	NFS

	cin >> n >> m;

	for(int i = 1; i <= n; i++) d[i] = inf;

	for(int i=1;i<=m;i++){
		int x,y,z;
		cin >> x >> y >> z;
		v[x].pb({y,z});
		v[y].pb({x,z});
	}

	cin >> m;

	for(int i=1;i<=m;i++){
		int x;
		cin >> x;
		s.insert({0,x});
		d[x]=0;
	}

	while(!s.empty()){
		int x=(*s.begin()).s;
		s.erase(s.begin());
		for(int i=0;i<sz(v[x]);i++){
			int to=v[x][i].f,w=v[x][i].s;
			if(d[to]>d[x]+w){
				s.erase({d[to],to});
				d[to]=d[x]+w;
				s.insert({d[to],to});
			}
		}
	}

	dfs1(1);

	memset(used,0,sizeof(used));

	dfs2(1);

	sort(all(mx));

	reverse(all(mx));

	for(int i=1;i<=n;i++){
		p[i]=i;
		rnk[i]=1;
	}

	for(int i=0;i<sz(mx);i++){
		int x=mx[i].s.f,y=mx[i].s.s,z=mx[i].f;
		if(get(x)!=get(y)){
			Merge(x,y);
			//cout << x << ' ' << y << ' ' << z << endl;
			//cout << get(x) << ' ' << get(y) << endl;
			//if(x == 5) return 0;
			new_v[x].pb({y,z});
			new_v[y].pb({x,z});
		}
	}

	memset(used,0,sizeof(used));

	dfs3(1);

	for(int j=1;j<=20;j++){
		for(int i=1;i<=n;i++){
			up[i][j]=up[up[i][j-1]][j-1];
			mn[i][j]=min(mn[i][j-1],mn[up[i][j-1]][j-1]);
		}
	}

	cin >> m;

	for(int i=1;i<=m;i++){
		int x,y;
		cin >> x >> y;
		cout << getmin(x,y) << endl;
	}

	#ifdef IOI2019
		cout << "\nTime Elapsed : " << clock () * 1.0 / CLOCKS_PER_SEC << endl;
	#endif

	ioi
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	23 ms	24312 KB	Output is correct
2	Correct	25 ms	24696 KB	Output is correct
3	Correct	26 ms	24696 KB	Output is correct
4	Correct	24 ms	24312 KB	Output is correct
5	Correct	26 ms	24696 KB	Output is correct
6	Correct	26 ms	24696 KB	Output is correct
7	Correct	24 ms	24360 KB	Output is correct
8	Correct	25 ms	24440 KB	Output is correct
9	Correct	26 ms	24700 KB	Output is correct
10	Correct	25 ms	24700 KB	Output is correct
11	Correct	26 ms	24696 KB	Output is correct
12	Correct	25 ms	24696 KB	Output is correct
13	Correct	25 ms	24652 KB	Output is correct
14	Correct	25 ms	24744 KB	Output is correct
15	Correct	26 ms	24696 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	23 ms	24312 KB	Output is correct
2	Correct	25 ms	24696 KB	Output is correct
3	Correct	26 ms	24696 KB	Output is correct
4	Correct	24 ms	24312 KB	Output is correct
5	Correct	26 ms	24696 KB	Output is correct
6	Correct	26 ms	24696 KB	Output is correct
7	Correct	24 ms	24360 KB	Output is correct
8	Correct	25 ms	24440 KB	Output is correct
9	Correct	26 ms	24700 KB	Output is correct
10	Correct	25 ms	24700 KB	Output is correct
11	Correct	26 ms	24696 KB	Output is correct
12	Correct	25 ms	24696 KB	Output is correct
13	Correct	25 ms	24652 KB	Output is correct
14	Correct	25 ms	24744 KB	Output is correct
15	Correct	26 ms	24696 KB	Output is correct
16	Correct	312 ms	51248 KB	Output is correct
17	Correct	994 ms	80120 KB	Output is correct
18	Correct	85 ms	30236 KB	Output is correct
19	Correct	285 ms	55700 KB	Output is correct
20	Correct	1012 ms	80108 KB	Output is correct
21	Correct	511 ms	63988 KB	Output is correct
22	Correct	286 ms	62372 KB	Output is correct
23	Correct	974 ms	80180 KB	Output is correct
24	Correct	965 ms	80164 KB	Output is correct
25	Correct	967 ms	80020 KB	Output is correct
26	Correct	274 ms	55476 KB	Output is correct
27	Correct	269 ms	55568 KB	Output is correct
28	Correct	276 ms	55580 KB	Output is correct
29	Correct	281 ms	55564 KB	Output is correct
30	Correct	282 ms	55868 KB	Output is correct

Subtask #3
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	25 ms	24440 KB	Output is correct
2	Correct	24 ms	24328 KB	Output is correct
3	Correct	24 ms	24444 KB	Output is correct
4	Correct	24 ms	24312 KB	Output is correct
5	Correct	24 ms	24312 KB	Output is correct
6	Correct	24 ms	24440 KB	Output is correct
7	Correct	24 ms	24312 KB	Output is correct
8	Correct	24 ms	24312 KB	Output is correct
9	Correct	28 ms	24440 KB	Output is correct
10	Correct	24 ms	24312 KB	Output is correct

Subtask #4
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	443 ms	63648 KB	Output is correct
2	Correct	898 ms	79888 KB	Output is correct
3	Correct	958 ms	79884 KB	Output is correct
4	Correct	233 ms	58520 KB	Output is correct
5	Correct	909 ms	79708 KB	Output is correct
6	Correct	926 ms	79880 KB	Output is correct
7	Correct	872 ms	79828 KB	Output is correct
8	Correct	847 ms	79624 KB	Output is correct
9	Correct	911 ms	79764 KB	Output is correct
10	Correct	882 ms	79752 KB	Output is correct
11	Correct	894 ms	79728 KB	Output is correct
12	Correct	896 ms	79864 KB	Output is correct
13	Correct	891 ms	79920 KB	Output is correct
14	Correct	895 ms	79740 KB	Output is correct
15	Correct	900 ms	79808 KB	Output is correct
16	Correct	909 ms	79784 KB	Output is correct
17	Correct	883 ms	79736 KB	Output is correct
18	Correct	912 ms	79848 KB	Output is correct
19	Correct	240 ms	61156 KB	Output is correct
20	Correct	913 ms	79956 KB	Output is correct
21	Correct	784 ms	79772 KB	Output is correct
22	Correct	220 ms	55300 KB	Output is correct
23	Correct	225 ms	56296 KB	Output is correct
24	Correct	222 ms	55444 KB	Output is correct
25	Correct	229 ms	55396 KB	Output is correct
26	Correct	254 ms	56264 KB	Output is correct
27	Correct	243 ms	60896 KB	Output is correct
28	Correct	216 ms	55228 KB	Output is correct
29	Correct	234 ms	59692 KB	Output is correct
30	Correct	221 ms	55336 KB	Output is correct
31	Correct	252 ms	59792 KB	Output is correct

Subtask #5
46.0 / 46.0

#	결과	실행 시간	메모리	Grader output
1	Correct	23 ms	24312 KB	Output is correct
2	Correct	25 ms	24696 KB	Output is correct
3	Correct	26 ms	24696 KB	Output is correct
4	Correct	24 ms	24312 KB	Output is correct
5	Correct	26 ms	24696 KB	Output is correct
6	Correct	26 ms	24696 KB	Output is correct
7	Correct	24 ms	24360 KB	Output is correct
8	Correct	25 ms	24440 KB	Output is correct
9	Correct	26 ms	24700 KB	Output is correct
10	Correct	25 ms	24700 KB	Output is correct
11	Correct	26 ms	24696 KB	Output is correct
12	Correct	25 ms	24696 KB	Output is correct
13	Correct	25 ms	24652 KB	Output is correct
14	Correct	25 ms	24744 KB	Output is correct
15	Correct	26 ms	24696 KB	Output is correct
16	Correct	312 ms	51248 KB	Output is correct
17	Correct	994 ms	80120 KB	Output is correct
18	Correct	85 ms	30236 KB	Output is correct
19	Correct	285 ms	55700 KB	Output is correct
20	Correct	1012 ms	80108 KB	Output is correct
21	Correct	511 ms	63988 KB	Output is correct
22	Correct	286 ms	62372 KB	Output is correct
23	Correct	974 ms	80180 KB	Output is correct
24	Correct	965 ms	80164 KB	Output is correct
25	Correct	967 ms	80020 KB	Output is correct
26	Correct	274 ms	55476 KB	Output is correct
27	Correct	269 ms	55568 KB	Output is correct
28	Correct	276 ms	55580 KB	Output is correct
29	Correct	281 ms	55564 KB	Output is correct
30	Correct	282 ms	55868 KB	Output is correct
31	Correct	25 ms	24440 KB	Output is correct
32	Correct	24 ms	24328 KB	Output is correct
33	Correct	24 ms	24444 KB	Output is correct
34	Correct	24 ms	24312 KB	Output is correct
35	Correct	24 ms	24312 KB	Output is correct
36	Correct	24 ms	24440 KB	Output is correct
37	Correct	24 ms	24312 KB	Output is correct
38	Correct	24 ms	24312 KB	Output is correct
39	Correct	28 ms	24440 KB	Output is correct
40	Correct	24 ms	24312 KB	Output is correct
41	Correct	443 ms	63648 KB	Output is correct
42	Correct	898 ms	79888 KB	Output is correct
43	Correct	958 ms	79884 KB	Output is correct
44	Correct	233 ms	58520 KB	Output is correct
45	Correct	909 ms	79708 KB	Output is correct
46	Correct	926 ms	79880 KB	Output is correct
47	Correct	872 ms	79828 KB	Output is correct
48	Correct	847 ms	79624 KB	Output is correct
49	Correct	911 ms	79764 KB	Output is correct
50	Correct	882 ms	79752 KB	Output is correct
51	Correct	894 ms	79728 KB	Output is correct
52	Correct	896 ms	79864 KB	Output is correct
53	Correct	891 ms	79920 KB	Output is correct
54	Correct	895 ms	79740 KB	Output is correct
55	Correct	900 ms	79808 KB	Output is correct
56	Correct	909 ms	79784 KB	Output is correct
57	Correct	883 ms	79736 KB	Output is correct
58	Correct	912 ms	79848 KB	Output is correct
59	Correct	240 ms	61156 KB	Output is correct
60	Correct	913 ms	79956 KB	Output is correct
61	Correct	784 ms	79772 KB	Output is correct
62	Correct	220 ms	55300 KB	Output is correct
63	Correct	225 ms	56296 KB	Output is correct
64	Correct	222 ms	55444 KB	Output is correct
65	Correct	229 ms	55396 KB	Output is correct
66	Correct	254 ms	56264 KB	Output is correct
67	Correct	243 ms	60896 KB	Output is correct
68	Correct	216 ms	55228 KB	Output is correct
69	Correct	234 ms	59692 KB	Output is correct
70	Correct	221 ms	55336 KB	Output is correct
71	Correct	252 ms	59792 KB	Output is correct
72	Correct	505 ms	64408 KB	Output is correct
73	Correct	997 ms	80196 KB	Output is correct
74	Correct	978 ms	80152 KB	Output is correct
75	Correct	986 ms	80428 KB	Output is correct
76	Correct	972 ms	80228 KB	Output is correct
77	Correct	990 ms	80128 KB	Output is correct
78	Correct	1014 ms	80216 KB	Output is correct
79	Correct	973 ms	80216 KB	Output is correct
80	Correct	971 ms	80300 KB	Output is correct
81	Correct	1018 ms	80152 KB	Output is correct
82	Correct	965 ms	80248 KB	Output is correct
83	Correct	999 ms	80176 KB	Output is correct
84	Correct	995 ms	80092 KB	Output is correct
85	Correct	1006 ms	80048 KB	Output is correct
86	Correct	1122 ms	80144 KB	Output is correct
87	Correct	987 ms	80148 KB	Output is correct
88	Correct	946 ms	80104 KB	Output is correct
89	Correct	358 ms	60672 KB	Output is correct
90	Correct	1024 ms	80124 KB	Output is correct
91	Correct	871 ms	80192 KB	Output is correct
92	Correct	290 ms	55556 KB	Output is correct
93	Correct	381 ms	57188 KB	Output is correct
94	Correct	298 ms	55548 KB	Output is correct
95	Correct	312 ms	55820 KB	Output is correct
96	Correct	368 ms	56572 KB	Output is correct
97	Correct	369 ms	59344 KB	Output is correct
98	Correct	293 ms	55480 KB	Output is correct
99	Correct	358 ms	61356 KB	Output is correct
100	Correct	302 ms	55572 KB	Output is correct

답안 #91011

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 46.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
46.0 / 46.0