Door Man
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 2653 | Accepted: 1082 |
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:
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.
- Always shut open doors behind you immediately after passing through
- Never open a closed door
- 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:
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.
A single data set has 3 components:
- 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).
- 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!
- 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个或2个度为奇数的节点
欧拉回路:图连通;图中所有节点度数均为偶数
有向图:
欧拉通路:图连通;除2个端点外其余节点入度=出度;1个端点入度比出度大1;一个端点入度比出度小1 或 所有节点入度等于出度
欧拉回路:图连通;所有节点入度等于出度
起始位置n,m为房间个数
然后接下来m行
每一行的数字都是比它大的数字号码,表示i 和这些数字有路通过
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
int n,m;
char temp[20];
int map[200];
//freopen("in.txt","r",stdin);
while(scanf("%s",temp),strcmp(temp,"ENDOFINPUT"))
{
memset(map,0,sizeof(map));
scanf("%d%d",&n,&m);
char ch=getchar();
for(int i=0;i<m;i++){
ch=getchar();
while(ch!='\n')
{
if(ch!=' '){
map[i]+=1;
map[ch-'0']++;
}
ch=getchar();
}
}
int flag=0;
int sum=0;
for(int i=0;i<m;i++){
if(map[i]%2)
flag++;
sum+=map[i];
}
if((flag==2&&(map[0]%2)&&n)||(flag==0&&n==0))
printf("YES %d\n",sum/2);
else
puts("NO");
scanf("%s",temp);
}
return 0;
}