题意:N个点,M条边的无向图,一头牛要去巡视,从1开始,每条边要往、来各一次,输出路径(1 <= M <= 50,000,2 <= N <= 10,000)。
题目链接:http://poj.org/problem?id=2230
——>>欧拉回路问题,递归完后再输出该点。
可是为什么直接输出路径会WA呢?
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 10000 + 10;
const int maxm = 50000 + 10;
int head[maxn], nxt[maxm<<1], v[maxm<<1], ecnt, N, M;
bool vis[maxm<<1];
void init(){
memset(head, -1, sizeof(head));
ecnt = 0;
memset(vis, 0, sizeof(vis));
}
void addEdge(int uu, int vv){
v[ecnt] = vv;
nxt[ecnt] = head[uu];
head[uu] = ecnt;
ecnt++;
}
void read(){
int uu, vv;
for(int i = 0; i < M; i++){
scanf("%d%d", &uu, &vv);
addEdge(uu, vv);
addEdge(vv, uu);
}
}
void dfs(int x){
for(int e = head[x]; e != -1; e = nxt[e]) if(!vis[e]){
vis[e] = 1;
dfs(v[e]);
}
printf("%d\n", x);
}
int main()
{
while(scanf("%d%d", &N, &M) == 2){
init();
read();
dfs(1);
}
return 0;
}