poj 1300 Door Man

Door Man

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 2135		Accepted: 855

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

Sample Output

YES 1
NO
YES 10

欧拉回路和欧拉通路（每条边经过一次）。有定理：在连通图下，欧拉回路等价于每个顶点的度数为偶数，欧拉通路等价于除两个顶点度数为奇数外，其余顶点度数为偶数。

因为终点为0，所以这题欧拉回路下起点为0，欧拉通路下起点不为0。

代码：

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

char s[1010];
int indeg[30];
int main()
{
    int n,m,cnt,even,odd,x;
    while(scanf("%s",s),s[0]!='E'){
        cnt=odd=even=0;
        memset(indeg,0,sizeof indeg);
        scanf("%d%d",&m,&n);
        gets(s);
        for(int i=0;i<n;i++){
            gets(s);
            int k=0;
            while(~sscanf(s+k,"%d",&x)){
                cnt++;
                indeg[i]++;
                indeg[x]++;
                while(s[k]&&s[k]==' ') k++;
                while(s[k]&&s[k]!=' ') k++;
            }
        }
        for(int i=0;i<n;i++)
            if(indeg[i]&1) odd++;
            else even++;
        if(!odd&&!m||(odd==2&&indeg[m]&1&&indeg[0]&1&&m))
            printf("YES %d\n",cnt);
        else puts("NO");
        gets(s);
    }
    return 0;
}