(欧拉回路)Watchcow(P2230)
来源:互联网 发布:数据库远程连接错误26 编辑:程序博客网 时间:2024/06/06 01:55
//题意:给出N个点,直接求出其欧拉回路经过的各个点,
#include<iostream>#include<cstdio>#include<cstring> #include<algorithm> #include<queue>#include<cstdlib>#include<vector>using namespace std; #define N 10001vector<int> v[N];int n,m;void dfs(int k){int i,j;while (v[k].size()){j=v[k][v[k].size()-1];v[k].pop_back();dfs(j);}printf("%d\n",k); }int main(){int i,j,k;scanf("%d%d",&n,&m);for (i=1;i<=n;i++)v[i].clear();while (m--){scanf("%d%d",&i,&j);v[i].push_back(j);v[j].push_back(i);}dfs(1);return 0;}
Watchcow
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 4337 Accepted: 1811 Special Judge
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...
Source
USACO 2005 January Silver
- (欧拉回路)Watchcow(P2230)
- POJ2230 Watchcow【欧拉回路】
- POJ2230 Watchcow(欧拉回路)
- poj2230 Watchcow (欧拉回路)
- POJ2230 Watchcow——欧拉回路
- POJ 2230 Watchcow 【欧拉回路】
- poj 2230 Watchcow (DFS + 欧拉回路)
- poj 2230 Watchcow(欧拉回路)
- poj - 2230 - Watchcow(欧拉回路)
- POJ 2230 Watchcow 欧拉回路题解
- POJ2230 Watchcow 【欧拉回路】+【DFS】
- [欧拉回路] poj 2230 Watchcow
- POJ 2230 Watchcow(欧拉回路)
- POJ 2230 Watchcow (欧拉回路)
- poj 2230 Watchcow 欧拉回路
- POJ 2230 Watchcow (欧拉回路)
- POJ2230 Watchcow 欧拉回路路径
- POJ 2230 Watchcow( 欧拉回路 )
- Android 如何在自己的应用中模拟Home键
- AJAX 缓存问题的两种解决方法(IE)
- 问题:使用struts2,如何处理action的路径?还有,在action转到的jsp中,如何写js,css,图 片的路径
- Hibernate的Criteria 的用法进行总结:
- PThread note
- (欧拉回路)Watchcow(P2230)
- 图片轮播
- 介绍一个不错的图书下载网站-顺便推荐几本书
- 如何从List集合中删除对象
- 前台如何将多个json对象传入java后台[修正]
- iOS面试题搜集(持续更新)
- 农民贫困到连自己都不敢相信
- repeat多级嵌套
- html的符号