poj Door Man(1300)

Door Man

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 2057		Accepted: 813

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. 
   
2. Always shut open doors behind you immediately after passing through 
   
3. Never open a closed door 
   
4. 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. 
   
2. 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). 
   
3. 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! 
   
4. 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

YES 1
NO
YES 10

题目大意：

你是一座大庄园的管家，庄园里有很多房间，编号为 0，1，2，3.。。大庄园的主人是一个心不在焉的人，经常沿着走廊随意地把房间的门打开，他沿着一个通道，穿过这些大房间，并把房间门头上，能否找到一条路径经过所有开着的门的房间，并使得，

1，通过门后立即把门关上，

2，关上门后不再打开，

3，最后你回到你自己的房间0，并且所有的门都已经关闭了。

题目分折：

本题实际上是判断一个图中是否存在一个欧拉回路或者欧拉通路。

1，如果所有的房间都有偶数个门，那么有欧拉回路，但这种情况下，出发的房间必须是0，才能回到 0 号房间。

2，如果有两个房间的门数为奇数，其余的为偶数，那么必须从号一个顶点出发，回到 0 号房间。

3，其他的情况可以直接输出NO。

题目链接：http://poj.org/problem?id=1300

小乐一下：

本题的难点在于输入数据的处理。

1，因为有空行，而且这些空行都是有用的信息，所以不能简单地用cin读入每个房间有门通往其他房间的房间号。

2，一行数中既有字符型数据，又有数值型数据，比如 START 1 2，必须区分不同的类型的数据。

因此，必须采用cin.getline 或者 getchar() 函数将输入数据读入到字符数组buf中，再采用 sscanf 函数从 buf 中读出有用的数据。

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

int readLine(char *s){
    int L;
    for(L = 0;(s[L]=getchar())!='\n' && s[L]!=EOF;L++);
    s[L] = 0;
    return L;
}

int main(){
    int i,j;
    char buf[128];
    int N,M;
    int door[20];
    while(readLine(buf)){
        if(buf[0]=='S'){
            sscanf(buf,"%*s %d %d",&M,&N);//%*s 表示可以读出来，但不传递给任何值。
            for(i = 0;i<N;i++) door[i] = 0;
            int doors = 0;
            for(i = 0;i<N;i++){
                readLine(buf);
                int k = 0;
                while(sscanf(buf+k,"%d",&j)==1){  //数据的处理过程，
                    doors ++;
                    door[i] ++;
                    door[j] ++;
                    while(buf[k] && buf[k]==' ') k++;
                    while(buf[k] && buf[k]!=' ') k++;
                }
            }
            readLine(buf);
            int odd = 0,even = 0;
            for(i = 0;i<N;i++){
                if(door[i]%2==0) even ++;
                else odd++;
            }
            if(odd == 0 && M==0)printf("YES %d\n",doors); //<span style="font-family: 'Courier New', Courier, monospace;">如果所有的房间都有偶数个门，那么有欧拉回路，但这种情况下，出发的房间必须是0，才能回到 0 号房间。</span>
            else if(odd == 2 && door[M]%2==1 && door[0]%2==1 && M!=0) printf("YES %d\n",doors);//<span style="font-family: 'Courier New', Courier, monospace;">如果有两个房间的门数为奇数，其余的为偶数，那么必须从号一个顶点出发，回到 0 号房间。</span>
            else printf("NO\n");//<span style="font-family: 'Courier New', Courier, monospace;">其他的情况可以直接输出NO。</span>
        }
        else if(!strcmp(buf,"ENDOFINPUT")) break;
    }
    return 0;
}

伟大的梦想成就伟大的人，从细节做好，从点点滴滴做好，从认真做好。