zoukankan      html  css  js  c++  java
  • POJ1300Door Man(欧拉回路)

                                                               Door Man
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 2639   Accepted: 1071

    Description

    You are a butler in a large mansion. This mansion has so many rooms that they are merely referred to by number (room 0, 1, 2, 3, etc...). Your master is a particularly absent-minded lout and continually leaves doors open throughout a particular floor of the house. Over the years, you have mastered the art of traveling in a single path through the sloppy rooms and closing the doors behind you. Your biggest problem is determining whether it is possible to find a path through the sloppy rooms where you:

    1. Always shut open doors behind you immediately after passing through
    2. Never open a closed door
    3. End up in your chambers (room 0) with all doors closed

    In this problem, you are given a list of rooms and open doors between them (along with a starting room). It is not needed to determine a route, only if one is possible.

    Input

    Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets.
    A single data set has 3 components:

    1. Start line - A single line, "START M N", where M indicates the butler's starting room, and N indicates the number of rooms in the house (1 <= N <= 20).
    2. Room list - A series of N lines. Each line lists, for a single room, every open door that leads to a room of higher number. For example, if room 3 had open doors to rooms 1, 5, and 7, the line for room 3 would read "5 7". The first line in the list represents room 0. The second line represents room 1, and so on until the last line, which represents room (N - 1). It is possible for lines to be empty (in particular, the last line will always be empty since it is the highest numbered room). On each line, the adjacent rooms are always listed in ascending order. It is possible for rooms to be connected by multiple doors!
    3. End line - A single line, "END"

    Following the final data set will be a single line, "ENDOFINPUT".

    Note that there will be no more than 100 doors in any single data set.

    Output

    For each data set, there will be exactly one line of output. If it is possible for the butler (by following the rules in the introduction) to walk into his chambers and close the final open door behind him, print a line "YES X", where X is the number of doors he closed. Otherwise, print "NO".

    Sample Input

    START 1 2
    1
    
    END
    START 0 5
    1 2 2 3 3 4 4
    
    
    
    
    END
    START 0 10
    1 9
    2
    3
    4
    5
    6
    7
    8
    9
    
    END
    ENDOFINPUT

    Sample Output

    YES 1
    NO
    YES 10
    【分析】这一题就是个欧拉回路的判定,很简单,但是输入有点麻烦。
    #include <iostream>
    #include <cstdio>
    #include <cstdlib>
    #include <cmath>
    #include <algorithm>
    #include <climits>
    #include <cstring>
    #include <string>
    #include <set>
    #include <map>
    #include <queue>
    #include <stack>
    #include <vector>
    #include <list>
    #include<functional>
    #define mod 1000000007
    #define inf 0x3f3f3f3f
    #define pi acos(-1.0)
    using namespace std;
    typedef long long ll;
    const int N=1005;
    const int M=150005;
    ll power(ll a,int b,ll c){ll ans=1;while(b){if(b%2==1){ans=(ans*a)%c;b--;}b/=2;a=a*a%c;}return ans;}
    char str[N];
    int n,m,cnt[35];
    int main()
    {
        while(gets(str)!=NULL){
            if(!strcmp(str,"ENDOFINPUT"))break;
            sscanf(str,"%*s%d%d",&m,&n);
            memset(cnt,0,sizeof(cnt));
            int ans=0;
            for(int i=0;i<n;i++){
                gets(str);
                int k=0,j;
                while(sscanf(str+k,"%d",&j)==1){
                    ans++;
                    cnt[i]++;
                    cnt[j]++;
                    while(str[k]&&str[k]==' ')k++;
                    while(str[k]&&str[k]!=' ')k++;
                }
            }
            gets(str);
            int odd=0,even=0;
            for(int i=0;i<n;i++){
                if(cnt[i]&1)odd++;
                else even++;
            }
            if(!odd&&!m)printf("YES %d
    ",ans);
            else if(odd==2&&(cnt[m]&1)&&(cnt[0]&1)&&m)printf("YES %d
    ",ans);
            else printf("NO
    ");
        }
    
        return 0;
    }
    View Code
  • 相关阅读:
    亚像素显示详解
    一文看懂显示关键材料之彩色滤光片(Color Filter)
    Android Camera2 Opengles2.0 实时滤镜(冷暖色/放大镜/模糊/美颜)
    Android Camera2 预览,拍照,人脸检测并实时展现
    Camera2点击对焦实现2
    关于Android Camera2 API 的自动对焦的坑
    Camera2点击对焦实现
    Android 新老两代 Camera API 大起底
    Android Camera2 参数调节关键字翻译集合,常用关键字解析
    MediaCodec在Android视频硬解码组件的应用
  • 原文地址:https://www.cnblogs.com/jianrenfang/p/5771225.html
Copyright © 2011-2022 走看看