CF-29C - Mail Stamps（DFS+离散化）

C - Mail Stamps

Crawling in process... Crawling failed Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status Practice CodeForces 29C

Description

One day Bob got a letter in an envelope. Bob knows that when Berland's post officers send a letter directly from city «A» to city «B», they stamp it with «A B», or «B A». Unfortunately, often it is impossible to send a letter directly from the city of the sender to the city of the receiver, that's why the letter is sent via some intermediate cities. Post officers never send a letter in such a way that the route of this letter contains some city more than once. Bob is sure that the post officers stamp the letters accurately.

There are n stamps on the envelope of Bob's letter. He understands that the possible routes of this letter are only two. But the stamps are numerous, and Bob can't determine himself none of these routes. That's why he asks you to help him. Find one of the possible routes of the letter.

Input

The first line contains integer n (1 ≤ n ≤ 10⁵) — amount of mail stamps on the envelope. Then there follow n lines with two integers each — description of the stamps. Each stamp is described with indexes of the cities between which a letter is sent. The indexes of cities are integers from 1 to 10⁹. Indexes of all the cities are different. Every time the letter is sent from one city to another, exactly one stamp is put on the envelope. It is guaranteed that the given stamps correspond to some valid route from some city to some other city.

Output

Output n + 1 numbers — indexes of cities in one of the two possible routes of the letter.

Sample Input

Input

2
1 100
100 2

Output

2 100 1 

Input

3
3 1
100 2
3 2

Output

100 2 3 1 

思路：选叶子，如果没有就随便选一点，开始搜，这保证所搜路径一定有答案路径，当有一条路能搜遍所有点时就输出路径返回。其中点有的太大，10^9,但不同的点最多10^5

        因此选用离散化来存点。

‘

#include<iostream>
#include<cstdio>
#include<iomanip>
#include<cstring>
#include<map>
#include<vector>
using namespace std;
const int mm=310000;
int f[mm];
map<int,int>mp;///离散指针
vector<int>g[mm];///邻接表
int a,b,m;
int pos;
bool vis[mm];//记录走过的点
bool flag;
bool dfs(int u,int dep)///dep访问不同点的个数
{

  if(dep==pos){cout<<f[u]<<" ";return 1;}
  for(int i=0;i<g[u].size();i++)
      if(!vis[g[u][i]])
      { vis[g[u][i]]=1;
        if(dfs(g[u][i],dep+1))
        {
          cout<<f[u]<<" ";return 1;
        }
        vis[g[u][i]]=0;
      }


}
int main()
{
  while(cin>>m)
  { mp.clear();pos=0;
    for(int i=0;i<mm;i++)
      g[i].clear();
     for(int i=0;i<m;i++)
    { cin>>a>>b;
      if(mp[a]==0)mp[a]=++pos,f[pos]=a;///离散化
      if(mp[b]==0)mp[b]=++pos,f[pos]=b;
      g[mp[a]].push_back(mp[b]);
      g[mp[b]].push_back(mp[a]);

    }
    memset(vis,0,sizeof(vis));
    int x=1;///保证所搜路径包含解路径
    for(int i=1;i<=pos;i++)
      if(g[i].size()==1)x=i;
      vis[x]=1;
    dfs(x,1);
    cout<<"\n";
  }
}