POJ 2330 Watchcow(欧拉回路)
来源:互联网 发布:ubuntu emacs 编辑:程序博客网 时间:2024/06/01 11:26
Watchcow
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 8249 Accepted: 3589 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
题意:给出一有向图,输出其欧拉回路
#include <stdio.h>#include <vector>#include <stack>using namespace std;int n, m;struct xx{ int v, vis;};vector<xx> k[10010];stack<int> s;void dfs(int x){ for(int i = 0; i < k[x].size(); i++){ if(!k[x][i].vis){ k[x][i].vis = 1; dfs(k[x][i].v); s.push(k[x][i].v); } }}int main(){ while(scanf("%d%d", &n, &m) == 2){ for(int i = 0; i < m; i++){ int x, y; xx s; scanf("%d%d",&x ,&y); s.v = y, s.vis = 0; k[x].push_back(s); s.v = x; k[y].push_back(s); } dfs(1); s.push(1); while(!s.empty()){ printf("%d\n", s.top()); s.pop(); } }}
阅读全文
0 0
- POJ 2330 Watchcow(欧拉回路)
- poj 2230 Watchcow(欧拉回路)
- poj - 2230 - Watchcow(欧拉回路)
- POJ 2230 Watchcow(欧拉回路)
- POJ 2230 Watchcow (欧拉回路)
- poj 2330 Watchcow(欧拉回路求点序列)
- POJ 2230 Watchcow(欧拉回路+DFS)
- POJ 2230 Watchcow (欧拉回路模板)
- POJ 2230 Watchcow 【欧拉回路】
- poj 2230 Watchcow (DFS + 欧拉回路)
- POJ 2230 Watchcow 欧拉回路题解
- [欧拉回路] poj 2230 Watchcow
- POJ 2230 Watchcow (欧拉回路)
- poj 2230 Watchcow 欧拉回路
- POJ 2230 Watchcow( 欧拉回路 )
- POJ 2230 Watchcow (欧拉回路)
- Poj 2230 Watchcow【欧拉回路】
- poj 2230 Watchcow(欧拉回路)
- php判断身份证是否合乎规定
- hibernate初学2之核心接口
- 欢迎使用CSDN-markdown编辑器
- jquery系列教程4-事件操作全解
- HorizontalScrollView嵌套RecyclerView横向展示不全
- POJ 2330 Watchcow(欧拉回路)
- c++ ;类的继承(二)
- [practice]cpp primer 1 script
- 重构SQLHelper
- GitHub for windows中文乱码问题
- jquery系列教程5-动画操作全解
- 关于cygwin/msys/msys2/mingw/mingw64
- 2017百度之星资格赛1003(完全背包)
- DSP入门应该懂得57个问题