2 shunfurh shunfurh 于 2017.09.17 17:58 提问

XYZZY

It has recently been discovered how to run open-source software on the Y-Crate gaming device. A number of enterprising designers have developed Advent-style games for deployment on the Y-Crate. Your job is to test a number of these designs to see which are winnable.
Each game consists of a set of up to 100 rooms. One of the rooms is the start and one of the rooms is the finish. Each room has an energy value between -100 and +100. One-way doorways interconnect pairs of rooms.

The player begins in the start room with 100 energy points. She may pass through any doorway that connects the room she is in to another room, thus entering the other room. The energy value of this room is added to the player's energy. This process continues until she wins by entering the finish room or dies by running out of energy (or quits in frustration). During her adventure the player may enter the same room several times, receiving its energy each time.

Input

The input consists of several test cases. Each test case begins with n, the number of rooms. The rooms are numbered from 1 (the start room) to n (the finish room). Input for the n rooms follows. The input for each room consists of one or more lines containing:

the energy value for room i
the number of doorways leaving room i
a list of the rooms that are reachable by the doorways leaving room i
The start and finish rooms will always have enery level 0. A line containing -1 follows the last test case.

Output

In one line for each case, output "winnable" if it is possible for the player to win, otherwise output "hopeless".

Sample Input

5
0 1 2
-60 1 3
-60 1 4
20 1 5
0 0
5
0 1 2
20 1 3
-60 1 4
-60 1 5
0 0
5
0 1 2
21 1 3
-60 1 4
-60 1 5
0 0
5
0 1 2
20 2 1 3
-60 1 4
-60 1 5
0 0
-1

Sample Output

hopeless
hopeless
winnable
winnable

1个回答

caozhy
caozhy   Ds   Rxr 2017.10.01 04:19
已采纳
Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!
其他相关推荐
hdu 1317 XYZZY 国产SPFA算法AC,,题目输入部分真特么难懂。。内有解析
XYZZY Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3017    Accepted Submission(s): 824 Problem Description It has recently been disc
扫雷外挂的设计与实现
其实我不玩网络游戏的,所以对于外挂类程序也没什么好或坏的感觉,甚至平时基本不会想到这个概念。这个实验项目一开始称为“扫雷助手”,而究其技术含量,与现在真正实用的游戏外挂程序也没有可比性。设计它的意义,无非在于对某些Windows API的的进一步熟悉,使从未涉足过此领域的新手(当初的我自己)能够揭开某些“神秘的面纱”。之所以选择“扫雷”这个最经典的小游戏进行hack,一方面,使这个项目更贴近生活,
XYZZY
 XYZZY 大意: 模拟一个游戏,初始时有100能量,处于房间1, 现在输入n,表示有n个房间的信息,接下来n行,每行输入进入房间n的所获得的能量,以及该房间可以进入其他房间的数目; 房间可以重复进入,求出能否到达房间n,且到达每个房间时能量都大于0; 要点: 房间可以重复进入,所以能量可以达到无限; 可以判断每次到达某个房间时的能量,下一次到达该房间时如果能量大于上一次的能量
ACM 专题训练 最短最长路
A  HDOJ-2544 模板题。不解释了。 顺便学习了一下dij+优先队列的姿势:
hdu1317XYZZY (SPFA处理 有环的情况)
Problem Description It has recently been discovered how to run open-source software on the Y-Crate gaming device. A number of enterprising designers have developed Advent-style games for deployment o
HDU1317 XYZZY
XYZZY Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1701    Accepted Submission(s): 419 Problem Description It has recently been
Uva10557 XYZZY
题意,进出房间需要消耗 #include #include #include #include using namespace std; bool map[105][105]; int val[105]; int aft[105]; bool vis[105]; int que[105]; int n; //看经过回路内的点否
10557 - XYZZY
描述:这道题题意很简单,就是开始时有一百点生命值,共有N个房间,每到一个房间生命值有时减少,有时增减,然后这个房间有几条通道通向其他房间,生命值一旦少于零就闯关失败,通关的条件就是在生命值大于零时到达第N个房间……不知道哪错了,交了n次,唉…… dfs代码: #include #include #include using namespace std; struct Graphs {
XYZZY UVA10557
这道题用到了一个独特的算法SPFA,同时需要判断是否存在正环,刚开始的无从下手,后来参考别人的代码,就看明白了。 #include #include #include using namespace std; #define maxn 110 int grid[maxn][maxn],val[maxn][maxn],num[maxn][maxn]; int vis[maxn],dis[
XYZZY HDU1317
XYZZY HDU1317