【差分约束】HDOJ 1531 King

差分约束模板题。。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>  
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 105
#define maxm 300005
#define eps 1e-10
#define mod 998244353
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp mark_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o->ch[0], L, mid  
#define rson o->ch[1], mid+1, R  
typedef long long LL;
//typedef int LL;
using namespace std;
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
// head

int h[maxn], next[maxm], v[maxm], cost[maxm];
int inq[maxn], dis[maxn], outq[maxn];
queue<int> q;
char s[maxn];
int n, m;

void init(void)
{
	for(int i = 0; i <= n+1; i++) h[i] = -1, inq[i] = outq[i] = 0;
	for(int i = 0; i <= n+1; i++) dis[i] = -INF;
}
void work(void)
{
	int a, b, c, cnt = 0;
	scanf("%d", &m);
	while(m--) {
		scanf("%d%d%s%d", &a, &b, s, &c);
		b += a + 1;
		if(s[0] == 'g') next[cnt] = h[a], h[a] = cnt, v[cnt] = b, cost[cnt] = c+1, cnt++;
		else next[cnt] = h[b], h[b] = cnt, v[cnt] = a, cost[cnt] = 1-c, cnt++;
	}
	for(int i = 1; i <= n+1; i++)
		next[cnt] = h[0], h[0] = cnt, v[cnt] = i, cost[cnt] = 0, cnt++;
}
bool spfa(int s)
{
	while(!q.empty()) q.pop();
	dis[s] = 0, inq[s] = 1, q.push(s);
	while(!q.empty()) {
		int u = q.front(); q.pop(), inq[u] = 0;
		outq[u]++;
		if(outq[u] > n+1) return false;
		for(int e = h[u]; ~e; e = next[e])
			if(dis[u] + cost[e] > dis[v[e]]) {
				dis[v[e]] = dis[u] + cost[e];
				if(!inq[v[e]]) q.push(v[e]), inq[v[e]] = 1;
			}
	}
	return true;
}
int main(void)
{
	while(scanf("%d", &n), n!=0) {
		init();
		work();
		if(spfa(0)) printf("lamentable kingdom\n");
		else printf("successful conspiracy\n");
	}
	return 0;
}