POJ 题目1300 Door Man(欧拉路)
来源:互联网 发布:sql语句中单引号 编辑:程序博客网 时间:2024/06/06 03:21
Door Man
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2380 Accepted: 949
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 21ENDSTART 0 51 2 2 3 3 4 4ENDSTART 0 101 923456789ENDENDOFINPUT
Sample Output
YES 1NOYES 10
Source
South Central USA 2002
ac代码
#include<stdio.h>#include<string.h>#include<math.h>#include<stdlib.h>char s[100010];int dig[100010];int n,m;int main(){while(scanf("%s",s)!=EOF){int i,a,b,len=0;if(strcmp("ENDOFINPUT",s)==0)break;scanf("%d%d",&m,&n);getchar();memset(dig,0,sizeof(dig));for(i=0;i<n;i++){char *p;gets(s);p=strtok(s," ");while(p){int temp=atoi(p);len++;dig[temp]++;dig[i]++;p=strtok(NULL," ");}}scanf("%s",s);a=b=0;for(i=0;i<n;i++){if(dig[i]&1)a++;elseb++;}if(a==0&&m==0){printf("YES %d\n",len);}elseif(m!=0&&dig[m]&1&&dig[0]&1&&a==2){printf("YES %d\n",len);}elseprintf("NO\n");}}
0 0
- POJ 题目1300 Door Man(欧拉路)
- poj 1300 Door Man
- POJ-1300-Door Man
- Door Man poj 1300
- POJ 1300 Door Man
- poj Door Man(1300)
- POJ-1300 Door Man
- poj 1300 Door Man
- POJ-1300 Door Man
- [欧拉图] poj 1300 Door Man
- POJ 1300 Door Man 笔记
- POJ 1300 Door Man(欧拉通路)
- POJ 1300 Door Man - from lanshui_Yang
- poj 1300 Door Man 欧拉回路
- [欧拉回路] poj 1300 Door Man
- zoj 1395 && poj 1300 Door Man
- 1300 Door Man
- POJ 1300 Door Man(欧拉回路_格式控制*)
- Nginx 第三方模块试用记
- Java中getResourceAsStream的用法
- HTML Web Storage
- 天声人語 20150226
- 新年新计划
- POJ 题目1300 Door Man(欧拉路)
- Java NIO 系列教程
- 为什么一个view一个controller
- linux cache buffer区别
- 总结人工智能需要的数学知识
- iOS cocos2d 2游戏开发实战(第3版)书评
- 暴风云视频平台点播SDK使用介绍(三)-- 视频播放(IOS)
- 日经春秋 20150226
- OJ1818《概率游戏》题解