题目分析:这道题是一道裸地差分约束题,直接套模板。。。
下面是代码:
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
const int maxn = 210;
const int INF = 100000000;
int v[maxn],w[maxn],first[maxn],next[maxn];
int d[maxn],t[maxn],e,n,m;
queue<int> q;
bool inq[maxn];
//添加边
void add(int a,int b,int c)
{
v[e] = b;
w[e] = c;
next[e] = first[a];
first[a] = e;
e++;
}
//判断是否有环
bool SPFA()
{
for(int i = 0; i <= n + 1; i++) d[i] = INF,inq[i] = false,t[i] = 0;
t[n+1]++;
d[n+1] = 0;
inq[n+1] = true;
while(!q.empty()) q.pop(); //每次将队列清空,这里wa了n次!
q.push(n+1);
while(!q.empty())
{
int u = q.front(); q.pop();
inq[u] = false;
for(int i = first[u]; i != -1; i = next[i])
{
if(d[v[i]] > d[u] + w[i])
{
d[v[i]] = d[u] + w[i];
if(!inq[v[i]])
{
inq[v[i]] = true;
t[v[i]]++;
if(t[v[i]] > n + 1) return false;
q.push(v[i]);
}
}
}
}
return true;
}
int main()
{
while(scanf("%d",&n) && n)
{
scanf("%d",&m);
for(int i = 0; i <= n + 1; i++) first[i] = -1;
int a,b,c;
char str[3];
e = 0;
//读入所有不等式,以边的形式储存
for(int i = 0; i < m; i++)
{
scanf("%d%d%s%d",&a,&b,str,&c);
if(str[0] == 'g') add(a+b,a-1,-c-1);
else add(a-1,a+b,c-1);
}
//加一个源点,让这个源点和每个点都是相连的,所以一共有n+1个点
for(int i = 0; i <= n; i++) add(n+1,i,0);
if(SPFA()) printf("lamentable kingdom\n");
else printf("successful conspiracy\n");
}
return 0;
}
PS:差分约束主要就是如何建图,有时间多刷几道差分约束的题目!