最短路之SPFA（单源）HDU 1317

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#define N 110
#define INF 0x7ffffff
using namespace std;
int n,val[N],mp[N][N],d[N],v[N],num[N],r[N][N];
void floyd()
{
    for(int k=;k<=n;k++)
        for(int i=;i<=n;i++)
            for(int j=;j<=n;j++)
                r[i][j]=max(r[i][j],r[i][k]&r[k][j]);
}
int spfa(int s,int t)
{
    for(int i=;i<=n;i++)
    {
        num[i]=;
        d[i]=-INF;
        v[i]=;
    }
    queue<int> q;
    q.push(s);
    v[s]=;
    d[s]=;
    num[s]++;
    while(!q.empty())
    {
        int c=q.front();
        q.pop();
        v[c]=;
        for(int i=;i<=n;i++)
        {
            if(d[c]+mp[c][i]>&&d[i]<d[c]+mp[c][i])
            {
                d[i]=d[c]+mp[c][i];
                if(!v[i])
                {
                    if(++num[i]>=n)  return r[i][t];
                    v[i]=,q.push(i);
                }
            }
        }
    }
    if(d[t]>) return ;
    return ;
}
int main()
{
    while(~scanf("%d",&n)&&n!=-)
    {
        memset(mp,,sizeof(mp));
        memset(r,,sizeof(r));
        for(int i=;i<=n;i++)
        {
            int nn;
            scanf("%d%d",&val[i],&nn);
            for(int j=;j<nn;j++)
            {
                int c;
                scanf("%d",&c);
                mp[i][c]=;
                r[i][c]=;
            }
        }
        for(int i=;i<=n;i++)
            for(int j=;j<=n;j++)
            {
                if(mp[i][j]==) mp[i][j]=-INF;
                else    mp[i][j]*=val[j];
            }
        floyd();
        if(spfa(,n))   cout<<"winnable"<<endl;
        else cout<<"hopeless"<<endl;
    }
}