poj——2230——Watchcow(欧拉路+dfs)
来源:互联网 发布:彩票销售软件 编辑:程序博客网 时间:2024/06/07 11:55
Description
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.
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.
* 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 51 21 42 32 43 4
Sample Output
12342143241
题意:Bessie要求从第一个农场巡视到最后一个农场,而且要求每条路要走两遍,并且这两遍必须是不同的方向。
这是一道有向图输出欧拉路径的问题,用dfs回溯,记录点的序号,就可以得到整条欧拉回路的点序列。
#include<stdio.h>#include<string.h>#define M 100007using namespace std;int vis[M],head[M],path[M];int n,m,cnt,num;struct E{ int to,next;} edg[M];void addedge(int a,int b){ edg[cnt].to=b; edg[cnt].next=head[a]; head[a]=cnt++;}void dfs(int u){ int v; for(v=head[u]; v!=-1; v=edg[v].next) { int next=edg[v].to; if(!vis[v]) { vis[v]=1; dfs(next); //path[num++]=v;//记录边的路径 } } path[num++]=u;//记录点的路径}int main(){ while(scanf("%d%d",&n,&m)!=EOF) { cnt=num=0; memset(vis,0,sizeof(vis)); memset(head,-1,sizeof(head)); int a,b; for(int i=1; i<=m; i++) { scanf("%d%d",&a,&b); addedge(a,b); addedge(b,a); } dfs(1); for(int i=0; i<num; i++) printf("%d\n",path[i]); } return 0;}
- poj——2230——Watchcow(欧拉路+dfs)
- poj 2230——Watchcow
- 【poj2230】Watchcow——dfs
- POJ 2230 Watchcow(欧拉回路+DFS)
- POJ 2230 Watchcow 欧拉路径 DFS
- poj 2230 Watchcow (DFS + 欧拉回路)
- POJ 2230 Watchcow(欧拉图)
- POJ 2230 Watchcow (欧拉路径 dfs 邻接表)
- poj2230——Watchcow(遍历有向欧拉图)
- POJ2230 Watchcow——欧拉回路
- poj 2230 Watchcow(欧拉回路)
- poj - 2230 - Watchcow(欧拉回路)
- POJ 2230 Watchcow(欧拉回路)
- POJ 2230 Watchcow (欧拉回路)
- POJ 2230 Watchcow
- poj 2230 Watchcow
- POJ-2230-Watchcow
- poj 2230 Watchcow
- Android滑动菜单特效实现,仿人人客户端侧滑效果,史上最简单的侧滑实现
- Linux Shell编程入门
- input子系统
- Winform添加App.config(原)
- HDU1402
- poj——2230——Watchcow(欧拉路+dfs)
- ASP.NET学习篇之——初识框架
- 使用structs2的拦截器判断用户权限的操作
- codeblocks快捷键
- (多项式运算4.7.6)POJ 2527 Polynomial Remains(多项式除法)
- 链接MySQL数据库出现CannotCreateTransactionException
- Android双向滑动菜单完全解析,教你如何一分钟实现双向滑动特效
- 集线器与交换机的区别
- 【C++进阶】类别互相引用(Class include each other)