有N个点，然后输入1～N个点，输入从它到其他点的血量变化，然后有几个点能到达，最后是这几个点。我们起点为1，终点为N。然后求的是我们是不是有可能或者达到终点（ >0 ）。
直接SPFA跑最长路。
感觉是在造样例：
6
0 1 2
-1000 1 3
2 1 4
2 1 5
2 2 3 6
0 0
ans:hopeless
7
0 1 2
0 2 3 5
-100 1 4
-100 1 7
1 1 6
0 1 5
0 0
-1
ans:hopeless
4
0 1 2
1 2 2 3
-20000000 1 4
0 0
-1
ans:
winnable
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define efs 1e-6
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MAX_3(a, b, c) max(max(a, b), c)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 1e2 + 7, maxE = 2e4 + 7;
int N, M, cnt, head[maxN], dist[maxN], used[maxN], _UP;
struct node
{
int val, id;
}a[maxN];
inline bool cmp(node e1, node e2) { return e1.val < e2.val; }
struct Eddge
{
int nex, to, val;
Eddge(int a=-1, int b=0, int c=0):nex(a), to(b), val(c) {}
}edge[maxE];
inline void addEddge(int u, int v, int w)
{
edge[cnt] = Eddge(head[u], v, w);
head[u] = cnt++;
}
queue<int> Q;
bool inque[maxN];
inline bool spfa(int st = 1, int ed = N)
{
Q.push(st); inque[st] = true; used[st]++;
while(!Q.empty())
{
int u = Q.front(); Q.pop(); inque[u] = false;
for(int i=head[u], v, w; ~i; i=edge[i].nex)
{
v = edge[i].to; w = edge[i].val;
if(used[u] > N)
{
if(used[v] <= N)
{
inque[v] = true;
Q.push(v);
}
used[v] = N + 1;
dist[v] = N + 1;
}
else if(dist[v] < dist[u] + w && dist[u] + w > 0)
{
dist[v] = dist[u] + w;
if(!inque[v])
{
if(used[v] > N)
{
dist[v] = INF;
continue;
}
inque[v] = true;
Q.push(v);
used[v]++;
}
}
}
}
return dist[N] > 0;
}
inline void init()
{
cnt = 0;
memset(head, -1, sizeof(head));
memset(inque, false, sizeof(inque));
for(int i=0; i<=N; i++) dist[i] = -INF;
memset(used, 0, sizeof(used));
dist[1] = 100;
while(!Q.empty()) Q.pop();
}
char op[5];
int main()
{
while(scanf("%d", &N) != EOF)
{
if(N == -1) break;
init();
for(int i=1, val, num, v; i<=N; i++)
{
scanf("%d%d", &val, &num);
while(num--)
{
scanf("%d", &v);
addEddge(i, v, val);
}
}
if(spfa()) printf("winnable\n");
else printf("hopeless\n");
}
return 0;
}
/*
4
0 1 2
1 2 2 3
-20000000 1 4
0 0
-1
ans:
winnable
*/
/*
7
0 1 2
0 2 3 5
-100 1 4
-100 1 7
1 1 6
0 1 5
0 0
-1
ans:hopeless
*/
/*
6
0 1 2
-1000 1 3
2 1 4
2 1 5
2 2 3 6
0 0
ans:hopeless
*/
