poj 2230 Watchcow
来源:互联网 发布:动感新时代淘宝 编辑:程序博客网 时间:2024/05/17 08:33
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
Hint
OUTPUT DETAILS:
Bessie starts at 1 (barn), goes to 2, then 3, etc...
Bessie starts at 1 (barn), goes to 2, then 3, etc...
题目大意:
求无向图从起点1开始从不同方向经过所有边的一条路径,输出任意一条。
#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#include<vector>using namespace std;#define N 10001int n,m;struct node{ //每条边都要设个访问标志 int v,vis;};vector<node> g[N];void euler(int u){ int i; for (i=0;i<g[u].size();i++) { if (!g[u][i].vis) { g[u][i].vis=1; euler(g[u][i].v); } } printf("%d\n",u);}int main(){ int i,j; while (~scanf("%d%d",&n,&m)) { int u,v; for (i=0;i<=n;i++) g[i].clear(); node temp; for (i=1;i<=m;i++) { scanf("%d%d",&u,&v); temp.vis=0; temp.v=v; g[u].push_back(temp); temp.v=u; g[v].push_back(temp); } euler(1); } return 0;}
0 0
- POJ 2230 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
- poj 2230 Watchcow
- poj-2230- Watchcow
- poj 2230——Watchcow
- POJ 2230 Watchcow(欧拉图)
- POJ 2230 Watchcow 【欧拉回路】
- POJ 2230 Watchcow 欧拉路径 DFS
- poj 2230 Watchcow (DFS + 欧拉回路)
- poj 2230 Watchcow(欧拉回路)
- poj - 2230 - Watchcow(欧拉回路)
- CodeForces 803B Distances to Zero
- 2.11_多边形的绘制
- GDOI2017 省选抱抱我要滚了
- lua对redis操作返回值问题
- 光流法
- poj 2230 Watchcow
- Java之枚举
- cmd命令直接进入某个盘
- hdu 4786 Fibonacci Tree
- PySide+Python+QTDesiger界面设计+图形布局
- Spring Session + Redis实现分布式Session共享
- android设计框架:mvc-mvp-mvvm
- Cookie与Session
- 2.12.1_拖动多边形对象