思路:从题目已知一些A和B的距离已知,那么就可以得d[A]-d[B]<=X && d[A]-d[B]>=X,并且有一些边只知道大小关系的就是d[A]-d[B]>=1,然后建图最短路就可以了
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
const int maxn = 1005;
#define inf 1e9
vector<pair<int,int> >e[maxn];
int d[maxn],inq[maxn],cnt[maxn],n;
int spfa()
{
memset(cnt,0,sizeof(cnt));
memset(inq,0,sizeof(inq));
for(int i = 1;i<=n;i++)
d[i]=inf;
queue<int>q;
q.push(0);
d[0]=0;
inq[0]=1;
while(!q.empty())
{
int u = q.front();
q.pop();
inq[u]=0;
for(int i =0;i<e[u].size();i++)
{
int v = e[u][i].first;
if(d[v]>d[u]+e[u][i].second)
{
d[v]=d[u]+e[u][i].second;
if(!inq[v])
{
inq[v]=1;
q.push(v);
if(++cnt[v]>n)
return false;
}
}
}
}
return true;
}
int main()
{
int m;
while(scanf("%d%d",&n,&m)!=EOF)
{
for(int i = 0;i<=n;i++)
e[i].clear();
for(int i =1;i<=m;i++)
{
char s[10];int u,v;
scanf("%s",s);
if(s[0]=='P')
{
int w;
scanf("%d%d%d",&u,&v,&w);
e[v].push_back(make_pair(u,w));
e[u].push_back(make_pair(v,-w));
}
else if(s[0]=='V')
{
scanf("%d%d",&u,&v);
e[u].push_back(make_pair(v,-1));
}
}
for(int i = 1;i<=n;i++)
e[0].push_back(make_pair(i,0));
if(spfa())
printf("Reliable\n");
else
printf("Unreliable\n");
}
}