hdoj 1217 Arbitrage 【最短路径】【floyd】

最新推荐文章于 2021-04-10 10:17:08 发布

l踏雪无痕ll

最新推荐文章于 2021-04-10 10:17:08 发布

阅读量252

点赞数

CC 4.0 BY-SA版权

分类专栏：最短路

本文链接：https://blog.youkuaiyun.com/longge33445/article/details/51038732

最短路专栏收录该内容

21 篇文章

订阅专栏

本文概述了AI音视频处理领域的关键技术，包括视频分割、语义识别、自动驾驶、AR、SLAM、物体检测与识别、语音识别变声等，探讨了AI在音视频处理的应用与发展趋势。

Arbitrage

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6319 Accepted Submission(s): 2919

Problem Description

Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 British pound, 1 British pound buys 10.0 French francs, and 1 French franc buys 0.21 US dollar. Then, by converting currencies, a clever trader can start with 1 US dollar and buy 0.5 * 10.0 * 0.21 = 1.05 US dollars, making a profit of 5 percent.

Your job is to write a program that takes a list of currency exchange rates as input and then determines whether arbitrage is possible or not.

Input

The input file will contain one or more test cases. Om the first line of each test case there is an integer n (1<=n<=30), representing the number of different currencies. The next n lines each contain the name of one currency. Within a name no spaces will appear. The next line contains one integer m, representing the length of the table to follow. The last m lines each contain the name ci of a source currency, a real number rij which represents the exchange rate from ci to cj and a name cj of the destination currency. Exchanges which do not appear in the table are impossible.
Test cases are separated from each other by a blank line. Input is terminated by a value of zero (0) for n.

Output

For each test case, print one line telling whether arbitrage is possible or not in the format "Case case: Yes" respectively "Case case: No".

Sample Input

3
USDollar
BritishPound
FrenchFranc
3
USDollar 0.5 BritishPound
BritishPound 10.0 FrenchFranc
FrenchFranc 0.21 USDollar

3
USDollar
BritishPound
FrenchFranc
6
USDollar 0.5 BritishPound
USDollar 4.9 FrenchFranc
BritishPound 10.0 FrenchFranc
BritishPound 1.99 USDollar
FrenchFranc 0.09 BritishPound
FrenchFranc 0.19 USDollar

0

Sample Output

Case 1: Yes
Case 2: No

题意：在每种钱币间进行各种交换，最后换回自己如果能赚，那么就Yes,否则No

思路：以汇率为边，floyd算法

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
int n,t=1;
double map[40][40];
void init()
{
	int i,j;
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			map[i][j]=0;
		}
	}
}
void floyd()
{
	int i,j,k,f=0;
	for(k=0;k<n;k++)
	{
		for(i=0;i<n;i++)
		{
			for(j=0;j<n;j++)
			{
				if(map[i][j]<map[i][k]*map[k][j])
				{
					map[i][j]=map[i][k]*map[k][j];
				}
			}
		}
	}
	for(i=0;i<n;i++)
	{
		if(map[i][i]>1)
		{
			f=1;
			break;
		}
	}
	if(f)
	printf("Case %d: Yes\n",t++);
	else
	printf("Case %d: No\n",t++);
}
int main()
{
	int m,i,j,x,y;
	double rat;
	char a[100],b[100],s[100][100];
	while(scanf("%d",&n)!=EOF&&n!=0)
	{
		init(); 
		for(i=0;i<n;i++)
		{
			scanf("%s",s[i]);
		}
		scanf("%d",&m);
		for(i=0;i<m;i++)
		{
			scanf("%s%lf%s",a,&rat,b);
			for(j=0;j<n;j++)
			{
				if(strcmp(a,s[j])==0)
				{
					x=j;
					break;
				}
			}
			for(j=0;j<n;j++)
			{
				if(strcmp(b,s[j])==0)
				{
					y=j;
					break;
				}
			}
			map[x][y]=rat;
		}
		floyd();
	}
	return 0;
}