题意:
给出n个国家之间的m中货币交换方式,问能否产生正环。
题解:
标号+spfa
#include <iostream>
#include <cstdio>
#include <map>
#include <queue>
#include <string.h>
#include <string>
using namespace std;
typedef long long LL;
struct Edge{
int to,next;
double val;
Edge(int to=0,double val=0,int next=0):to(to),val(val),next(next){}
}e[100005];
int head[1005],now;
void add(int a,int b,double c){
e[++now]=Edge(b,c,head[a]);head[a]=now;
}
map<string,int>ma;
int n,m,cs;
double dis[1005];
int vis[1005],num[1005];
int spfa(){
memset(vis,0,sizeof(vis));
memset(num,0,sizeof(num));
memset(dis,0,sizeof(dis));
queue<int>q;
q.push(1);
vis[1]=num[1]=1;
dis[1]=1;
while(!q.empty()){
int u=q.front();
q.pop();
vis[u]=0;
for(int i=head[u];~i;i=e[i].next){
int v=e[i].to;
if(dis[v]<dis[u]*e[i].val){
dis[v]=dis[u]*e[i].val;
if(!vis[v]){
q.push(v);
vis[v]=1;
num[v]++;
if(num[v]>n) return 1;
}
}
}
}
return -1;
}
int main(){
string x,y;
while(cin>>n){
if(n==0) break;
memset(head,-1,sizeof(head));now=-1;
int cnt=0;
for(int i=1;i<=n;i++){
cin>>x;
ma[x]=++cnt;
}
cin>>m;
double w;
for(int i=1;i<=m;i++){
cin>>x>>w>>y;
add(ma[x],ma[y],w);
}
int ans=spfa();
if(ans==1) printf("Case %d: Yes\n",++cs);
else printf("Case %d: No\n",++cs);
}
}