//flody 这里的是乘,不是加
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define MAXN 35
#define INF 0x3f3f3f3f
char name[MAXN][MAXN];
int pos, used[MAXN];
double each_dis[MAXN][MAXN], dis[MAXN], val;
int get_index(const char *str)
{
for(int i = 0; i < pos; i ++) {
if( !strcmp(str, name[i]) ) {
return i;
}
}
strcpy(name[pos ++], str);
return pos-1;
}
int floyd(void)
{
for(int k = 0; k < pos; k ++) {
for(int i = 0; i < pos; i ++) {
for(int j = 0; j < pos; j ++) {
if( 0.0 == each_dis[i][k] || 0.0 == each_dis[k][j] ) {
continue;
}
each_dis[i][j] = max(each_dis[i][j], each_dis[i][k]*each_dis[k][j]);
}
}
}
for(int i = 0; i < pos; i ++) {
if( each_dis[i][i] > 1.0 ) {
return 1;
}
}
return 0;
}
int main(int argc, char const *argv[])
{
#ifndef ONLINE_JUDGE
freopen("test.in", "r", stdin);
#endif
char u[MAXN], v[MAXN];
int m, n, uu, vv, cas(1), flag;
while( scanf("%d", &n) && n ) {
for(int i = 0; i < n; i ++) {
scanf("%s", u);
}
scanf("%d", &m); pos = 0; flag = 0;
memset(each_dis, 0, sizeof(each_dis));
for(int i = 0; i < m; i ++) {
scanf("%s %lf %s", u, &val, v);
uu = get_index(u); vv = get_index(v);
each_dis[uu][vv] = val;
}
printf("Case %d: ", cas ++);
if( floyd() ) {
printf("Yes\n"); continue;
}
printf("No\n");
}
return 0;
}
hdu_1217
最新推荐文章于 2021-09-16 15:55:17 发布