I - Door Man
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u
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:
- 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.
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".
题意:走遍所有开门房间回到0房间
分析:欧拉回路
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<map>
using namespace std;
const int MAXN=25;
int num[MAXN];
int main()
{
int n,m,s,t,x,i;
char TF[1000];
while(gets(TF)!=NULL)
{
if(!strcmp(TF,"ENDOFINPUT"))break;
memset(num,0,sizeof num);
sscanf(TF,"START %d%d",&s,&n);
num[s]++;num[0]++;
for(i=0;i<n;i++)
{
gets(TF);
int flag=1,bum=0;
while(~sscanf(TF+bum,"%d",&x))
{
if(flag){flag=0;bum--;}
bum+=2;
if(x>9)bum+=1;
num[x]++;
num[i]++;
}
}
int sum=0;
for(i=0;i<n;i++)
{
sum+=num[i];
if(num[i]%2)break;
}
if(i==n)printf("YES %d\n",sum/2-1);
else printf("NO\n",sum/2);
gets(TF);
}
return 0;
}