hdu 1317 XYZZY

http://acm.hdu.edu.cn/showproblem.php?pid=1317

 #include <cstdio>
 #include <queue>
 #include <cstring>
 #include <algorithm>
 #define maxn 1001
 using namespace std;
 const int inf=<<;

 int dis[maxn];
 bool vis[maxn];
 int n,m,x;
 int a[maxn];
 bool g[maxn][maxn];
 int cnt[maxn];

 bool spfa()
 {
     queue<int>q;
     memset(vis,false,sizeof(vis));
     memset(cnt,,sizeof(cnt));
     for(int i=; i<=n; i++) dis[i]=;
     dis[]=;
     q.push();
     vis[]=true;
     while(!q.empty())
     {
         int u=q.front();q.pop();
         vis[u]=false;
         if(u==n)
         {
            return true;
         }
         if(cnt[u]==n+)
         {
             continue;
         }
         cnt[u]++;
         if(cnt[u]==n+)
         {
             dis[u]=inf;
         }
         for(int i=; i<=n; i++)
         {
             if(g[u][i])
             {
                 if(dis[i]<dis[u]+a[i]&&(dis[u]+a[i]>))
                 {
                     dis[i]=dis[u]+a[i];
                     if(!vis[i])
                     {
                         vis[i]=true;
                         q.push(i);
                     }
                 }
             }
         }
     }
     return false;
 }

 int main()
 {
     while(scanf("%d",&n)!=EOF)
     {
         if(n==-) break;
         memset(g,false,sizeof(g));
         for(int i=; i<=n; i++)
         {
             scanf("%d",&a[i]);
             scanf("%d",&m);
             for(int j=; j<m; j++)
             {
                 scanf("%d",&x);
                 g[i][x]=true;
             }
         }
         if(spfa())
         {
             printf("winnable\n");
         }
         else
             printf("hopeless\n");
     }
     return ;
 }