Codeforces Round #279 (Div. 2)B. Queue

最新推荐文章于 2016-07-10 17:39:00 发布

原创最新推荐文章于 2016-07-10 17:39:00 发布 · 845 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#codeforces

针对学生午餐排队场景，设计了一种算法来恢复基于前后同学ID记录的排队序列。该算法适用于2到20万学生规模的队伍，通过两组序列处理，确保了即使在学生离开并返回后也能准确重建原始队列。

During the lunch break all n Berland State University students lined up in the food court. However, it turned out that the food court, too, has a lunch break and it temporarily stopped working.

Standing in a queue that isn't being served is so boring! So, each of the students wrote down the number of the student ID of the student that stands in line directly in front of him, and the student that stands in line directly behind him. If no one stands before or after a student (that is, he is the first one or the last one), then he writes down number 0 instead (in Berland State University student IDs are numerated from 1).

After that, all the students went about their business. When they returned, they found out that restoring the queue is not such an easy task.

Help the students to restore the state of the queue by the numbers of the student ID's of their neighbors in the queue.

Input

The first line contains integer n (2 ≤ n ≤ 2·10⁵) — the number of students in the queue.

Then n lines follow, i-th line contains the pair of integers a_i, b_i (0 ≤ a_i, b_i ≤ 10⁶), where a_i is the ID number of a person in front of a student and b_i is the ID number of a person behind a student. The lines are given in the arbitrary order. Value 0 is given instead of a neighbor's ID number if the neighbor doesn't exist.

The ID numbers of all students are distinct. It is guaranteed that the records correspond too the queue where all the students stand in some order.

Output

Print a sequence of n integers x₁, x₂, ..., x_n — the sequence of ID numbers of all the students in the order they go in the queue from the first student to the last one.

Sample test(s)

Input

Output

92 7 31 141

Note

The picture illustrates the queue for the first sample. $\text{[math]}$

胡搞题，分2个序列搞定

#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int N = 200010;
queue<int>qu;
map<int, int>last;
map<int, int>next;
map<int, bool>vis;
struct node
{
	int a, b;
}p[N];

int odd[N], eve[N];

int main()
{
	int n;
	while (~scanf("%d", &n))
	{
		int l, r;
		while (!qu.empty())
		{
			qu.pop();
		}
		vis.clear();
		last.clear();
		next.clear();
		for (int i = 1; i <= n; ++i)
		{
			scanf("%d%d", &p[i].a, &p[i].b);
			last[p[i].b] = p[i].a;
			next[p[i].a] = p[i].b;
			if (p[i].a == 0)
			{
				l = p[i].b;
			}
			if (p[i].b == 0)
			{
				r = p[i].a;
			}
		}
		// printf("%d %d\n", l, r);
		if (n == 2)
		{
			printf("%d %d\n", r, l);
			continue;
		}
		odd[1] = l;
		int cnt1 = 1, cnt2 = 1;
		vis[odd[cnt1]] = 1;
		while (next[odd[cnt1]] != 0)
		{
			odd[cnt1 + 1] = next[odd[cnt1]];
			cnt1++;
			vis[odd[cnt1]] = 1;
		}
		int tmp;
		for (int i = 1; i <= n; ++i)
		{
			if (!vis[p[i].a] && p[i].a)
			{
				tmp = p[i].a;
				// printf("%d\n", tmp);
				break;
			}
		}
		while (last[tmp] != 0)
		{
			tmp = last[tmp];
		}
		// printf("%d\n", tmp);
		eve[1] = tmp;
		while (next[eve[cnt2]] != 0)
		{
			eve[cnt2 + 1] = next[eve[cnt2]];
			cnt2++;
		}
		for (int i = 1; i <= min(cnt1, cnt2); ++i)
		{
			qu.push(eve[i]);
			qu.push(odd[i]);
			// printf("%d %d\n", eve[i], odd[i]);
		}
		if(cnt1 != cnt2)
		{
			if (cnt1 > cnt2)
			{
				for (int i = cnt2 + 1; i <= cnt1; ++i)
				{
					qu.push(odd[i]);
				}
			}
			else
			{
				for (int i = cnt1 + 1; i <= cnt2; ++i)
				{
					qu.push(eve[i]);
				}
			}
		}
		while(!qu.empty())
		{
			printf("%d", qu.front());
			qu.pop();
			if (!qu.empty())
			{
				printf(" ");
			}
			else
			{
				printf("\n");
				break;
			}
		}
	}
	return 0;
}