Hide

# Problem GXYZZY

The prototypical computer adventure game, first designed by Will Crowther on the PDP-10 in the mid-1970s as an attempt at computer-refereed fantasy gaming, and expanded into a puzzle-oriented game by Don Woods at Stanford in 1976. (Woods had been one of the authors of INTERCAL.) Now better known as Adventure or Colossal Cave Adventure, but the TOPS-10 operating system permitted only six-letter filenames in uppercase. See also vadding, Zork, and Infocom.

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 $-1000$ and $+1000$. 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 (at most $50$). 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 energy 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 1 Sample Output 1
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

hopeless
hopeless
winnable
winnable