poj1300 解题报告

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other)

Total Submission(s) : 30   Accepted Submission(s) : 16

Problem 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<stdio.h>
#include<queue>
#include<string.h>
using namespace std;
int in[105],down[105];
char str[300];
int fin(int a)
{
     if(down[a]!=a)
     {
           down[a]=fin(down[a]);
     }

     return down[a];
}
int main ()
{

       int i,m,n,j,sum,s,k;
       bool zhe;
      while(1)
      {
            scanf("%s",str);
            if(!strcmp(str,"ENDOFINPUT"))
                  break;
            scanf("%d%d",&m,&n);
            //printf("%d %d\n",m,n);
            k=n;
            for(i=0;i<102;i++)
            {
                  down[i]=i;
                  in[i]=0;
            }


            gets(str);
             memset(str,'\0',sizeof(str));
             s=0;
            for(j=0;j<n;j++)
            {
                  //printf("%d j",j);
                  gets(str);
                  //printf("%s\n",str);
                  sum=0;
                  for(i=0;str[i]!='\0';i++)
                  {

                        if(str[i]>='0'&&str[i]<='9')
                        {
                           sum=sum*10+str[i]-'0';
                        }
                        else
                        {
                          in[j]++;
                          in[sum]++;
                          //printf("%d\n",sum);
                          int a=fin(j);
                          int b=fin(sum);
                          if(a!=b)
                          {
                              down[a]=b;
                              k--;
                          }
                          sum=0;
                          s++;
                        }


                  }
                  if(sum!=0)
                  {
                        in[sum]++;
                        in[j]++;
                         int a=fin(j);
                          int b=fin(sum);
                          if(a!=b)
                          {
                              down[a]=b;
                              k--;
                          }
                          s++;
                          sum=0;
                       // printf("%d\n",sum);
                  }

                   memset(str,'\0',sizeof(str));

            }
           // printf("%dk\n",k);
           // if(k==1)
            zhe=true;
          //  else
                 // zhe=false;
                  if(zhe)
                  {


            if(m!=0)
            {


            for(i=0;i<n;i++)
            {
                  if(i==m||i==0)
                  {
                      if(!(in[i]%2))
                      {
                        zhe=false;
                        break;
                      }

                  }
                  else
                  {
                        if(in[i]%2)
                        {
                              zhe=false;
                              break;
                        }
                  }
            }
            }
            else
            {
            for(i=0;i<n;i++)
            {


                  if(in[i]%2)
                  {
                        zhe=false;
                        break;
                  }

            }
            }
                  }

            if(zhe)
            {

                  printf("YES %d\n",s);
            }
            else
            {
                  printf("NO\n");
            }
           // printf("end\n");
            gets(str);
             memset(str,'\0',sizeof(str));

      }


      return 0;

}

     
     
     
     

    
    
    
    

顶

0

踩

0

 

 

• 上一篇poj1116 Play on Words
• 下一篇poj2230 解题报告

我的同类文章

poj（96） 欧拉回路（5）

http://blog.csdn.net