poj 1300 Door Man(欧拉回路判定)
2013-03-01 11:31
531 查看
Door Man
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.
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:
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
Sample Output
Source
South Central USA 2002
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 1598 | Accepted: 596 |
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.
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:
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
Source
South Central USA 2002
#include<iostream> #include<cstdio> #include<cstring> using namespace std; const int mm=110003; int id[mm]; char s[mm]; int a,b,c,m; int main() { while(cin>>s) { if(strcmp(s,"ENDOFINPUT")==0)break; cin>>c>>m;int ans=0; memset(id,0,sizeof(id)); cin.get(); for(int i=0;i<m;i++) { int k=0; cin.getline(s,9999,'\n');int j; while(sscanf(s+k,"%d",&j)!=EOF) { ++ans;++id[j];++id[i]; while(s[k]&&s[k]==' ')++k; while(s[k]&&s[k]!=' ')++k; } } cin>>s; int odd=0; for(int i=0;i<m;i++) if(id[i]&1)++odd; if(odd==0&&c==0)cout<<"YES "<<ans<<"\n"; else if(odd==2&&id[c]&1&&id[0]&1&&c!=0)cout<<"YES "<<ans<<"\n"; else cout<<"NO\n"; } }
相关文章推荐
- POJ-1300 Door Man 欧拉回路判定
- POJ 1300 Door Man(欧拉回路判定)
- poj 1300 Door Man(欧拉回路判定)
- POJ 1300 Door Man 欧拉回路的判定
- POJ 1300 Door Man(欧拉回路判定)
- POJ 1300 Door Man(欧拉回路的判定)
- poj1300 Door Man(欧拉回路)
- [欧拉回路] poj 1300 Door Man
- POJ 1300 Door Man(欧拉回路_格式控制*)
- 欧拉回路的判定 poj 1300
- Poj 1300 Door Man (欧拉回路 通路 stream处理输入)
- POJ1300 Door Man —— 欧拉回路(无向图)
- [欧拉回路] poj 1300 Door Man
- poj 1300 欧拉回路判定方法
- Door Man(欧拉回路判定)
- POJ 1300 Door Man(欧拉通路)
- POJ 1300 Door Man(欧拉通路)
- POJ 1300 - 阅读理解+恶心输入+欧拉回路
- POJ 1300 Door Man
- POJ-1637 Sightseeing tour(通过网络流判定混合图的欧拉回路)