记录编号	121052	评测结果	AAAAAAAA
题目名称	骑马修栅栏	最终得分	100
用户昵称	HouJikan	是否通过	通过
代码语言	C++	运行时间	0.009 s
提交时间	2014-09-17 21:19:13	内存使用	1.14 MiB

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <list>
#include <vector>
#include <ctime>
#include <iterator>
#include <functional>
#define pritnf printf
#define scafn scanf
#define For(i,j,k) for(int i=(j);i<=(k);(i)++)
using namespace std;
typedef long long LL;
typedef unsigned int Uint; 
const int INF=0x7ffffff;
//==============struct declaration==============

//==============var declaration=================
const int MAXN=510;
int Edge[MAXN][MAXN],deg[MAXN];
int n=0,m,start=1;
vector <int> path;
//==============function declaration============
void dfs(int x);
//==============main code=======================
int main()
{  
  string FileName="fenceus";//程序名 
  string FloderName="COGS";//文件夹名 
  freopen((FileName+".in").c_str(),"r",stdin);
  freopen((FileName+".out").c_str(),"w",stdout);
#ifdef DEBUG  
  system(("cp C:\\Users\\Administrator\\Desktop\\"+FloderName+"\\standard.cpp C:\\Users\\Administrator\\Desktop\\"+FloderName+"\\submit.txt").c_str());
  clock_t Start_Time=clock();
#endif    
  scanf("%d",&m);
  memset(Edge,0,sizeof(Edge));
  memset(deg,0,sizeof(deg));
  For(i,1,m)
  {
    int s,e;
    scanf("%d%d",&s,&e);
    Edge[s][e]++;Edge[e][s]++;
    deg[s]++;deg[e]++;
    if (s>n) n=s;if(e>n) n=e;
  }
  For(i,1,n)
    if (deg[i]&1)
    {
      start=i;
      break;
    }
 dfs(start);
 for(int i=m;i>=0;i--)
   pritnf("%d\n",path[i]);
#ifdef DEBUG  
  clock_t End_Time=clock();
  cout<<endl<<endl<<"Time Used: "<<(End_Time-Start_Time)/CLOCKS_PER_SEC<<endl;
#endif    
  return 0;
}
//================fuction code====================
void dfs(int x)
{
  For(i,1,n)
    if (Edge[x][i])
    {
      Edge[x][i]--;Edge[i][x]--;
      dfs(i);
    }
  path.push_back(x);
}