답안 #90568 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
90568	2018-12-22T12:22:31 Z	davitmarg	Evacuation plan (IZhO18_plan)	C++17	100 / 100	1711 ms	52320 KB

plan

//DavitMarg//
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iterator>
#include <ctype.h>
#include <stdlib.h>  
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
using namespace std;

struct street
{
	int to;
	int d;
};

bool operator<(street a, street b)
{
	return a.d > b.d;
}

int n, m, k, used[100005], d[100005];
vector<street> gr[100005];
priority_queue<street> q;


int p[100005],timer,tin[100005],tout[100005],up[100005][21],mn[100005][21];
vector<pair<int, int>> st;
vector<pair<int, pair<int, int>>> s;
vector<int> g[100005];
int getParent(int k)
{
	if (p[k] == k)
		return k;
	return p[k] = getParent(p[k]);
}

void setFriend(int a,int b)
{
	int pa = getParent(a);
	int pb = getParent(b);
	if (pa == pb)
		return;
	p[pa] = pb;
}

void dfs(int v,int p)
{
	used[v] = 1;
	tin[v] = ++timer;
	int l = 1;
	while ((1 << l) <= n)
		l++;
	up[v][0] = p;
	mn[v][0] = min(d[v],d[p]);
	for (int i = 1; i <= l; i++)
	{
		up[v][i] = up[up[v][i - 1]][i - 1];
		mn[v][i] = min(mn[v][i - 1], mn[up[v][i - 1]][i - 1]);

	}
	for (int i = 0; i < g[v].size(); i++)
	{
		int to = g[v][i];
		if (used[to])
			continue;
		dfs(to,v);
	}
	tout[v] = ++timer;
}

bool upper(int a,int b)
{
	return (tin[a] <= tin[b] && tout[a] >= tout[b]);
}

int lcaAns(int a, int b)
{
	int l = 1;
	while ((1 << l) <= n)
		l++;
	int ans = min(d[a], d[b]);
	if (upper(a, b) && upper(b, a))
		return ans;

	int aa=a, bb=b;
	if (!upper(a, b))
	{
		for (int i = l; i >= 0; i--)
			if (!upper(up[a][i], b))
			{
				ans = min(ans, mn[a][i]);
				a = up[a][i];
				ans = min(d[a], ans);
			}
		ans = min(ans, mn[a][0]);
	}
	a = bb;
	b = aa;

	if (!upper(a, b))
	{
		for (int i = l; i >= 0; i--)
			if (!upper(up[a][i], b))
			{
				ans = min(ans, mn[a][i]);
				a = up[a][i];
				ans = min(d[a],ans);
			}
		ans = min(ans, mn[a][0]);
	}
	return ans;
}

int main()
{
	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		int a, b, D;
		street s;
		cin >> a >> b >> D;
		s.d = D;
		s.to = b;
		gr[a].PB(s);
		s.to = a;
		gr[b].PB(s);
		st.PB(MP(a, b));
	}

	for (int i = 0; i <= n; i++)
	{
		d[i] = mod;
		p[i] = i;
	}
	cin >> k;
	for (int i = 0; i < k; i++)
	{
		int a;
		cin >> a;
		d[a] = 0;
		street s;
		s.to = a;
		s.d = d[a];
		q.push(s);
	}


	for (int j = 1; j <= n; j++)
	{
		street v;
		v.to = -1;
		v.d = -1;
		do
		{
			v = q.top();
			q.pop();
		} while (used[v.to]);

		if (v.to == -1)
			continue;
		used[v.to] = 1;
		for (int i = 0; i < (int)gr[v.to].size(); i++)
		{
			street to = gr[v.to][i];
			if (d[to.to] > v.d + to.d)
			{
				d[to.to] = v.d + to.d;
				street s;
				s.d = d[to.to];
				s.to = to.to;
				q.push(s);
			}
		}
	}

	for (int i = 0; i < st.size(); i++)
		s.PB(MP(-min(d[st[i].first], d[st[i].second]), MP(st[i].first, st[i].second)));

	sort(s.begin(), s.end());
	for (int i = 0; i < s.size(); i++)
		if (getParent(s[i].second.first) != getParent(s[i].second.second))
		{
			setFriend(s[i].second.first, s[i].second.second);
			g[s[i].second.first].PB(s[i].second.second);
			g[s[i].second.second].PB(s[i].second.first);
		}

	memset(used, 0, 100005 * sizeof(int));
	tout[0] = mod;
	dfs(1,0);

	cin >> k;
	for (int i = 0; i < k; i++)
	{
		int a, b;
		cin >> a >> b;
		cout << lcaAns(a, b) << endl;
	}
	return 0;
}

/*

4 3
1 2 10
2 3 10
3 4 10
1
1
2

*/

Compilation message

plan.cpp: In function 'void dfs(int, int)':
plan.cpp:74:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < g[v].size(); i++)
                  ~~^~~~~~~~~~~~~
plan.cpp: In function 'int main()':
plan.cpp:189:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < st.size(); i++)
                  ~~^~~~~~~~~~~
plan.cpp:193:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < s.size(); i++)
                  ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	5372 KB	Output is correct
2	Correct	11 ms	5752 KB	Output is correct
3	Correct	12 ms	5752 KB	Output is correct
4	Correct	6 ms	5368 KB	Output is correct
5	Correct	11 ms	5724 KB	Output is correct
6	Correct	12 ms	5724 KB	Output is correct
7	Correct	7 ms	5496 KB	Output is correct
8	Correct	6 ms	5496 KB	Output is correct
9	Correct	12 ms	5752 KB	Output is correct
10	Correct	12 ms	5756 KB	Output is correct
11	Correct	11 ms	5752 KB	Output is correct
12	Correct	11 ms	5752 KB	Output is correct
13	Correct	11 ms	5752 KB	Output is correct
14	Correct	11 ms	5752 KB	Output is correct
15	Correct	12 ms	5712 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	5372 KB	Output is correct
2	Correct	11 ms	5752 KB	Output is correct
3	Correct	12 ms	5752 KB	Output is correct
4	Correct	6 ms	5368 KB	Output is correct
5	Correct	11 ms	5724 KB	Output is correct
6	Correct	12 ms	5724 KB	Output is correct
7	Correct	7 ms	5496 KB	Output is correct
8	Correct	6 ms	5496 KB	Output is correct
9	Correct	12 ms	5752 KB	Output is correct
10	Correct	12 ms	5756 KB	Output is correct
11	Correct	11 ms	5752 KB	Output is correct
12	Correct	11 ms	5752 KB	Output is correct
13	Correct	11 ms	5752 KB	Output is correct
14	Correct	11 ms	5752 KB	Output is correct
15	Correct	12 ms	5712 KB	Output is correct
16	Correct	706 ms	27920 KB	Output is correct
17	Correct	1676 ms	51968 KB	Output is correct
18	Correct	124 ms	10212 KB	Output is correct
19	Correct	647 ms	34120 KB	Output is correct
20	Correct	1646 ms	52088 KB	Output is correct
21	Correct	985 ms	37248 KB	Output is correct
22	Correct	699 ms	37252 KB	Output is correct
23	Correct	1620 ms	52096 KB	Output is correct
24	Correct	1638 ms	51968 KB	Output is correct
25	Correct	1635 ms	51912 KB	Output is correct
26	Correct	645 ms	33848 KB	Output is correct
27	Correct	645 ms	34028 KB	Output is correct
28	Correct	650 ms	33972 KB	Output is correct
29	Correct	646 ms	34144 KB	Output is correct
30	Correct	651 ms	34128 KB	Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	537 ms	36692 KB	Output is correct
2	Correct	1188 ms	51632 KB	Output is correct
3	Correct	1192 ms	51480 KB	Output is correct
4	Correct	291 ms	34568 KB	Output is correct
5	Correct	1179 ms	51512 KB	Output is correct
6	Correct	1198 ms	51548 KB	Output is correct
7	Correct	1180 ms	51600 KB	Output is correct
8	Correct	1177 ms	51500 KB	Output is correct
9	Correct	1208 ms	51640 KB	Output is correct
10	Correct	1194 ms	51552 KB	Output is correct
11	Correct	1258 ms	51604 KB	Output is correct
12	Correct	1180 ms	51552 KB	Output is correct
13	Correct	1190 ms	51576 KB	Output is correct
14	Correct	1169 ms	51640 KB	Output is correct
15	Correct	1175 ms	51804 KB	Output is correct
16	Correct	1184 ms	51552 KB	Output is correct
17	Correct	1190 ms	51636 KB	Output is correct
18	Correct	1200 ms	51516 KB	Output is correct
19	Correct	287 ms	36144 KB	Output is correct
20	Correct	1171 ms	51608 KB	Output is correct
21	Correct	1187 ms	51232 KB	Output is correct
22	Correct	246 ms	33636 KB	Output is correct
23	Correct	276 ms	32744 KB	Output is correct
24	Correct	243 ms	33616 KB	Output is correct
25	Correct	243 ms	33744 KB	Output is correct
26	Correct	290 ms	32872 KB	Output is correct
27	Correct	298 ms	35848 KB	Output is correct
28	Correct	242 ms	33628 KB	Output is correct
29	Correct	292 ms	35276 KB	Output is correct
30	Correct	249 ms	33680 KB	Output is correct
31	Correct	360 ms	35220 KB	Output is correct

Subtask #5
46.0 / 46.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	5372 KB	Output is correct
2	Correct	11 ms	5752 KB	Output is correct
3	Correct	12 ms	5752 KB	Output is correct
4	Correct	6 ms	5368 KB	Output is correct
5	Correct	11 ms	5724 KB	Output is correct
6	Correct	12 ms	5724 KB	Output is correct
7	Correct	7 ms	5496 KB	Output is correct
8	Correct	6 ms	5496 KB	Output is correct
9	Correct	12 ms	5752 KB	Output is correct
10	Correct	12 ms	5756 KB	Output is correct
11	Correct	11 ms	5752 KB	Output is correct
12	Correct	11 ms	5752 KB	Output is correct
13	Correct	11 ms	5752 KB	Output is correct
14	Correct	11 ms	5752 KB	Output is correct
15	Correct	12 ms	5712 KB	Output is correct
16	Correct	706 ms	27920 KB	Output is correct
17	Correct	1676 ms	51968 KB	Output is correct
18	Correct	124 ms	10212 KB	Output is correct
19	Correct	647 ms	34120 KB	Output is correct
20	Correct	1646 ms	52088 KB	Output is correct
21	Correct	985 ms	37248 KB	Output is correct
22	Correct	699 ms	37252 KB	Output is correct
23	Correct	1620 ms	52096 KB	Output is correct
24	Correct	1638 ms	51968 KB	Output is correct
25	Correct	1635 ms	51912 KB	Output is correct
26	Correct	645 ms	33848 KB	Output is correct
27	Correct	645 ms	34028 KB	Output is correct
28	Correct	650 ms	33972 KB	Output is correct
29	Correct	646 ms	34144 KB	Output is correct
30	Correct	651 ms	34128 KB	Output is correct
31	Correct	7 ms	5496 KB	Output is correct
32	Correct	7 ms	5496 KB	Output is correct
33	Correct	7 ms	5400 KB	Output is correct
34	Correct	6 ms	5496 KB	Output is correct
35	Correct	7 ms	5496 KB	Output is correct
36	Correct	6 ms	5496 KB	Output is correct
37	Correct	7 ms	5496 KB	Output is correct
38	Correct	6 ms	5496 KB	Output is correct
39	Correct	6 ms	5368 KB	Output is correct
40	Correct	7 ms	5496 KB	Output is correct
41	Correct	537 ms	36692 KB	Output is correct
42	Correct	1188 ms	51632 KB	Output is correct
43	Correct	1192 ms	51480 KB	Output is correct
44	Correct	291 ms	34568 KB	Output is correct
45	Correct	1179 ms	51512 KB	Output is correct
46	Correct	1198 ms	51548 KB	Output is correct
47	Correct	1180 ms	51600 KB	Output is correct
48	Correct	1177 ms	51500 KB	Output is correct
49	Correct	1208 ms	51640 KB	Output is correct
50	Correct	1194 ms	51552 KB	Output is correct
51	Correct	1258 ms	51604 KB	Output is correct
52	Correct	1180 ms	51552 KB	Output is correct
53	Correct	1190 ms	51576 KB	Output is correct
54	Correct	1169 ms	51640 KB	Output is correct
55	Correct	1175 ms	51804 KB	Output is correct
56	Correct	1184 ms	51552 KB	Output is correct
57	Correct	1190 ms	51636 KB	Output is correct
58	Correct	1200 ms	51516 KB	Output is correct
59	Correct	287 ms	36144 KB	Output is correct
60	Correct	1171 ms	51608 KB	Output is correct
61	Correct	1187 ms	51232 KB	Output is correct
62	Correct	246 ms	33636 KB	Output is correct
63	Correct	276 ms	32744 KB	Output is correct
64	Correct	243 ms	33616 KB	Output is correct
65	Correct	243 ms	33744 KB	Output is correct
66	Correct	290 ms	32872 KB	Output is correct
67	Correct	298 ms	35848 KB	Output is correct
68	Correct	242 ms	33628 KB	Output is correct
69	Correct	292 ms	35276 KB	Output is correct
70	Correct	249 ms	33680 KB	Output is correct
71	Correct	360 ms	35220 KB	Output is correct
72	Correct	995 ms	37308 KB	Output is correct
73	Correct	1672 ms	51980 KB	Output is correct
74	Correct	1640 ms	52020 KB	Output is correct
75	Correct	1660 ms	52104 KB	Output is correct
76	Correct	1637 ms	51936 KB	Output is correct
77	Correct	1711 ms	51980 KB	Output is correct
78	Correct	1686 ms	51936 KB	Output is correct
79	Correct	1642 ms	52128 KB	Output is correct
80	Correct	1675 ms	52200 KB	Output is correct
81	Correct	1634 ms	52140 KB	Output is correct
82	Correct	1649 ms	52048 KB	Output is correct
83	Correct	1657 ms	52028 KB	Output is correct
84	Correct	1644 ms	51912 KB	Output is correct
85	Correct	1660 ms	52320 KB	Output is correct
86	Correct	1668 ms	51976 KB	Output is correct
87	Correct	1661 ms	52124 KB	Output is correct
88	Correct	1654 ms	52200 KB	Output is correct
89	Correct	807 ms	36192 KB	Output is correct
90	Correct	1658 ms	51940 KB	Output is correct
91	Correct	1644 ms	51524 KB	Output is correct
92	Correct	669 ms	34140 KB	Output is correct
93	Correct	751 ms	33724 KB	Output is correct
94	Correct	666 ms	33948 KB	Output is correct
95	Correct	685 ms	34112 KB	Output is correct
96	Correct	762 ms	33580 KB	Output is correct
97	Correct	807 ms	35304 KB	Output is correct
98	Correct	664 ms	33764 KB	Output is correct
99	Correct	833 ms	36404 KB	Output is correct
100	Correct	665 ms	33988 KB	Output is correct

답안 #90568

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