pku1364.cpp

内有pku1201

///POJ1364 King 
//查分约束

#include <stdio.h>

int st[68], ed[68], w[68];
short V, E;
int dis[68], i, j;
short a, b, c;
char str[3];
short flag;

short bellman()
{

	for(i=1; i<=V; i++){
		dis[i] = 0;
	}
	for(i=0; i<=V; i++){
		flag = 1;
		for(j=0; j<E; j++){
			if(dis[ed[j]] > dis[st[j]] + w[j]){
				dis[ed[j]] = dis[st[j]] + w[j];
				flag = 0;
			}
		}
		if(flag) return 1;
	}
	return 0;
}

int main() {
	
	
	
	while(scanf("%hd",&V),V){
		scanf("%hd",&E);
		for(i=0; i<E; i++){
			scanf("%d %d %s %d",&a, &b, str, &c);
			b = a + b + 1;
			if(str[0]=='l'){
				st[i] = a; ed[i] = b; w[i] = c-1;
			}else{
				st[i] = b; ed[i] = a; w[i] = -c-1;
			}
		}
		if(bellman()){
			printf("lamentable kingdom\n");
		}else{
			printf("successful conspiracy\n");
		}
	}
	return 0;
}