Bessie’s been appointed the new watch-cow for the farm. Every night, it’s her job to walk across the farm and make sure that no evildoers are doing any evil. She begins at the barn, makes her patrol, and then returns to the barn when she’s done.
If she were a more observant cow, she might be able to just walk each of M (1 <= M <= 50,000) bidirectional trails numbered 1…M between N (2 <= N <= 10,000) fields numbered 1…N on the farm once and be confident that she’s seen everything she needs to see. But since she isn’t, she wants to make sure she walks down each trail exactly twice. It’s also important that her two trips along each trail be in opposite directions, so that she doesn’t miss the same thing twice.
A pair of fields might be connected by more than one trail. Find a path that Bessie can follow which will meet her requirements. Such a path is guaranteed to exist.
Input
- Line 1: Two integers, N and M.
- Lines 2…M+1: Two integers denoting a pair of fields connected by a path.
Output - Lines 1…2M+1: A list of fields she passes through, one per line, beginning and ending with the barn at field 1. If more than one solution is possible, output any solution.
Sample Input
4 5
1 2
1 4
2 3
2 4
3 4
Sample Output
1
2
3
4
2
1
4
3
2
4
1
Hint
OUTPUT DETAILS:
Bessie starts at 1 (barn), goes to 2, then 3, etc…
思路
题意:给你一个无向图图,必须从1出发每条边都走两次并且回到1.
直接在建图加边的时候加两次边,然后找一个欧拉回路
#include<iostream>
#include<cstring>
#include<cstdio>
#define maxn 50010
using namespace std;
struct edge{
int to,next,vis;
}e[maxn*3];
int head[maxn],tot;
void add(int u,int v)
{
e[tot].to=v;
e[tot].vis=false;
e[tot].next=head[u];//邻接表存储
head[u]=tot++;
}
void dfs(int u)
{
for(int i=head[u];i!=-1;i=e[i].next)
{
if(e[i].vis==false)//如果该边没走过
{
e[i].vis=true;
dfs(e[i].to);
}
}
printf("%d\n",u);
}
int main()
{
int n,m,u,v;
scanf("%d %d",&n,&m);
memset(head,-1,sizeof(head));
for(int i=0;i<m;i++)
{
scanf("%d %d",&u,&v);
add(u,v);//要经过每个边两次,也就是加两次边,然后找一个欧拉回路
add(v,u);
}
dfs(1);
}