zoukankan      html  css  js  c++  java
  • POJ 2230 Watchcow

    Watchcow

    Time Limit: 3000ms
    Memory Limit: 65536KB
    This problem will be judged on PKU. Original ID: 2230
    64-bit integer IO format: %lld      Java class name: Main
     
    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...
     

    Source

     
    解题:欧拉回路
     
     1 #include <cstdio>
     2 #include <cstring>
     3 using namespace std;
     4 const int maxn = 10010;
     5 struct arc {
     6     int to,next;
     7     arc(int x = 0,int y = -1) {
     8         to = x;
     9         next = y;
    10     }
    11 } e[500000];
    12 int head[maxn],tot,n,m;
    13 bool vis[500000];
    14 void add(int u,int v) {
    15     e[tot] = arc(v,head[u]);
    16     head[u] = tot++;
    17 }
    18 void dfs(int u) {
    19     for(int &i = head[u]; ~i; i = e[i].next) {
    20         if(vis[i]) continue;
    21         vis[i] = true;
    22         dfs(e[i].to);
    23     }
    24     printf("%d
    ",u);
    25 }
    26 int main() {
    27     int u,v;
    28     while(~scanf("%d%d",&n,&m)) {
    29         memset(head,-1,sizeof head);
    30         memset(vis,false,sizeof vis);
    31         for(int i = tot = 0; i < m; ++i) {
    32             scanf("%d%d",&u,&v);
    33             add(u,v);
    34             add(v,u);
    35         }
    36         dfs(1);
    37     }
    38     return 0;
    39 }
    View Code
  • 相关阅读:
    0基础学小程序----day1
    比较两个库的表信息
    SQL Server 2008 临时解除约束删除表中数据
    HTML5音乐、视频等新媒体播放标签video、audio、embed与object介绍以及使用方式
    Docker最全教程——从理论到实战(一)
    SQL Server查询优化方法
    idea插件esayCode自动生成代码(代码生成器)
    SQL Server 小技巧
    Java和C#与SQL Server、MySQL和Oracle数据类型对照映射表
    笔记 | 史上最全的正则表达式
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/4716400.html
Copyright © 2011-2022 走看看