HDU 1317 XYZZY(spfa跑正环)

#include <bits/stdc++.h>
#define maxn 105
#define inf 105
using namespace std;
struct Node{
	int to,w,next;
	bool operator < (const Node &a) const{
		return a.w < w;
	}
}Edge[maxn * maxn];
int head[maxn * maxn],dist[maxn],cnt[maxn],num;
bool vis[maxn];
int n,m,x,v;

void init(){
	for(int i=1;i<=maxn;i++)
			cnt[i] = 0, head[i] = -1, dist[i] = 0, vis[i] = false;
	num = 0;
}

void add(int u,int v,int w){
	Edge[num].w = w;
	Edge[num].to = v;
	Edge[num].next = head[u];
	head[u] = num ++;
}

void spfa(){
	dist[1] = 100;
	queue<int> q;
	q.push(1);
	while(!q.empty()){
		int u = q.front();
		q.pop();
		vis[u] = false;
		for(int i=head[u];i!=-1;i=Edge[i].next){
			int v = Edge[i].to;
			if(dist[v] < dist[u] + Edge[i].w && cnt[v] < 10000){
				cnt[v] ++;
				dist[v] = dist[u] + Edge[i].w;
				if(vis[v] == false){
					vis[v] = true;
					q.push(v);
				}
			}
		}
	}
	if(dist[n] > 0){
		puts("winnable");
	}
	else{
		puts("hopeless");
	}
}

int main()
{
	while(~scanf("%d",&n)){
		if(n == -1) break;
		init();
		for(int i=1;i<=n;i++){
			scanf("%d%d",&x,&m);
			for(int j=0;j<m;j++){
				scanf("%d",&v);
				add(i, v, x);
			}
		}
		spfa();
	}
	return 0;
}