题目链接:http://poj.org/problem?id=1364
差分约束系统。
注意增加一个超级节点保证联通性即可。
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
using namespace std;
#define Maxn 505
#define Maxm 10005
#define INF 0x3f3f3f3f
int first[Maxn];
int next[Maxm];
int total;
struct Edge
{
int a,b;
int w;
}edge[Maxm];
int dist[Maxn];
int vis[Maxn];
void init()
{
total = 0;
memset(first,-1,sizeof(first));
}
void addEdge(int a,int b,int w)
{
edge[total].a = a,edge[total].b = b,edge[total].w = w;
next[total] = first[a];
first[a] = total++;
}
int cnt[Maxn];
bool spfa(int s,int n)
{
memset(dist,0x3f,sizeof(dist));
memset(vis,0,sizeof(vis));
memset(cnt,0,sizeof(cnt));
dist[s] = 0;
queue<int> q;
q.push(s);
vis[s] = 1;
while(!q.empty())
{
int temp = q.front();
q.pop();
vis[temp] = 0;
for(int i=first[temp];i!=-1;i=next[i])
{
int a = edge[i].a;
int b = edge[i].b;
int w = edge[i].w;
if(dist[a] + w < dist[b])
{
dist[b] = dist[a] + w;
if(!vis[b])
{
vis[b] = 1;
cnt[b]++;
if(cnt[b] > n) return false;
q.push(b);
}
}
}
}
//判负环
return true;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif
int n,m;
int w;
char op[10];
int a,b,c;
int start,end;
while(scanf(" %d",&n)!=EOF && n!=0)
{
scanf(" %d",&m);
init();
for(int i=0;i<m;i++)
{
scanf(" %d %d %s %d",&a,&b,op,&c);
b = a+b;
if(op[0] == 'g') addEdge(b,a-1,-1-c);
else addEdge(a-1,b,c-1);
}
//加一个超级源点
for(int i=0;i<=n;i++)
{
addEdge(n+1,i,0);
}
if(spfa(n+1,n+2)) puts("lamentable kingdom");
//if(bellmanFord(n+1,n+2,total)) puts("lamentable kingdom");
else puts("successful conspiracy");
}
return 0;
}