201512-4------------送货

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e4 + 500;
int n, m;
bool g[N][N];
int d[N];
int ans[N], cnt1;
int p[N];
int find(int x){
	if (x != p[x])   p[x] = find(p[x]);
	return p[x];
}
void dfs(int u){
	for (int i = 1; i <= n; i ++)
		if (g[u][i]){
		//	cout << i << "-------" << endl;
			g[u][i] = 0, g[i][u] = 0;
			dfs(i);
		}
	ans[++ cnt1] = u;
}
int main(){
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i ++)   p[i] = i;
		while(m --){
		int a, b;
		scanf("%d%d", &a, &b);
		g[a][b] = true, g[b][a] = true;
		d[a] ++, d[b] ++;
		int pa = find(a), pb = find(b);
		p[pa] = pb;
	}
 	 	bool flag = true;
 	int cnt = 0;
 	 	for (int i = 1; i <= n; i ++){
 		if (p[i] == i)  cnt ++;
	 }
	 if (cnt != 1)   flag  = false;
	 	 cnt = 0;
	 if (d[1] & 1){
	 	for (int i = 2; i <= n; i ++)
	 	if (d[i] & 1)   cnt ++;
	 	if (cnt != 1)  flag = false;
	 }
	 else{
	 	for (int i = 2; i <= n; i ++)
	 	if (d[i] & 1)   flag = false;
	 }
	//	if (flag)  cout << "-----------" << endl;
		if (!flag){
		cout << -1 << endl;
	}
	else{
		//cout << g[1][3] << endl;
		dfs(1);
		//cout << cnt << endl;
		for (int i = cnt1; i; i --)   printf("%d ", ans[i]);
		cout << endl;
	}
		return 0;
}

70分以后改