判断差分约束是否存在
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const double PI = acos(-1.0);
template <class T> inline T MAX(T a, T b){if (a > b) return a;return b;}
template <class T> inline T MIN(T a, T b){if (a < b) return a;return b;}
const int N = 111;
const int M = 11111;
const LL MOD = 1000000007LL;
const int dir[4][2] = {1, 0, -1, 0, 0, -1, 0, 1};
const int INF = 0x3f3f3f3f;
struct edge
{
int x,y,d;
};
edge a[101];
int d[101];
int main()
{
int m,n,i,j,k,x,y;
string s;
while(cin>>m&&m!=0)
{
cin>>n;
for(i=1;i<=n;i++)
{
cin>>x>>y>>s>>k;
if(s=="gt")
{
a[i].x=x+y;
a[i].y=x-1;
a[i].d=k+1;
}
else
{
a[i].x=x-1;
a[i].y=x+y;
a[i].d=-k+1;
}
}
for(i=0;i<=m;i++)
d[i]=-INF;
bool circle;
for(i=0;i<=m;i++)
{
circle=false;
for(j=1;j<=n;j++)
{
if(d[a[j].y]+a[j].d>d[a[j].x])
{
d[a[j].x]=d[a[j].y]+a[j].d;
circle=true;
}
}
}
if(circle) cout<<"successful conspiracy"<<endl;
else cout<<"lamentable kingdom"<<endl;
}
return 0;
}