Arbitrage POJ2240 bellman_ford
来源:互联网 发布:淘宝的钻石展位有用吗 编辑:程序博客网 时间:2024/05/17 22:52
Arbitrage
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21566 Accepted: 9185
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.
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 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.
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
3USDollarBritishPoundFrenchFranc3USDollar 0.5 BritishPoundBritishPound 10.0 FrenchFrancFrenchFranc 0.21 USDollar3USDollarBritishPoundFrenchFranc6USDollar 0.5 BritishPoundUSDollar 4.9 FrenchFrancBritishPound 10.0 FrenchFrancBritishPound 1.99 USDollarFrenchFranc 0.09 BritishPoundFrenchFranc 0.19 USDollar0
Sample Output
Case 1: YesCase 2: No
这一题和POJ1860挺像的,用bellman_ford水一水就可以了。不过还是有要注意的地方。。。。
1.在if判断句中,得先把值赋给一个变量之后再做比较,否则。。。只有二进制知道哪里出了问题。。。。。
2.之所以wa了三次,浪费了一个小时,是因为。。。。注意输出只有第一位字母是大写。。。。。
大概思路就是,对于每个点用一次bellman_ford,看有无与其相连的正圈,如果有就是yes。。。
代码如下:
<span style="font-size:24px;">#include<iostream>#include<cstring>#include<algorithm>#include<cmath>#include<map>#include<string>using namespace std;map<string,int>ma;struct My{ int from,to; double hui;} cun[950];double d[35]; int n,m;double num;bool bellman_ford(int s){ memset(d,0,sizeof(d)); d[s]=10;for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++) { My mm=cun[j]; double aa=d[mm.from]*mm.hui; if(d[mm.to]<aa) { d[mm.to]=d[mm.from]*mm.hui; if(i==n){ //cout<<i<<" "<<mm.from<<" "<<mm.to<<" "<<d[mm.to]<<endl; return true;} } }}return false;}int main(){ string str,str1; int icase=1; while(cin>>n&&n) { ma.clear();memset(cun,0,sizeof(cun)); for(int i=1; i<=n; i++) { cin>>str; ma[str]=i; } cin>>m; for(int i=1; i<=m; i++) { cin>>str>>num>>str1; cun[i].from=ma[str]; cun[i].to=ma[str1]; cun[i].hui=num; } bool flag=false; for(int i=1; i<=n; i++) { flag=bellman_ford(i); if(flag)break; } cout<<"Case "<<icase++<<": ";if(flag)cout<<"Yes"<<endl;else cout<<"No"<<endl; } return 0;}</span>
1 0
- Arbitrage POJ2240 bellman_ford
- 【bellman_ford】poj2240
- poj2240 Bellman_Ford
- POJ2240:Arbitrage
- poj2240 Arbitrage
- poj2240 - Arbitrage
- POJ2240 Arbitrage
- Arbitrage poj2240
- POJ2240 Arbitrage
- poj2240 Arbitrage
- poj2240--Arbitrage
- poj2240 Arbitrage
- POJ2240 - Arbitrage
- POJ2240-Arbitrage
- poj2240 Arbitrage
- POJ2240 Arbitrage
- poj2240 Arbitrage
- poj2240 Arbitrage
- Jsp动态网站初步项目 --简单商品浏览界面(工具包DBConnection类)
- NOIP 2014 提高组 无线网路发射器选址
- UISegmentedControl-更改背景色和字体颜色
- 变态跳台阶
- iOS10调用相册导致模拟器和xcode闪退
- Arbitrage POJ2240 bellman_ford
- SpringMVC开启CORS支持
- Traces.txt阅读
- POJ-1080-Human Gene Functions
- List<T>自定义元素个数重新分组
- CentOS7下安装MySQL
- Python 多进程使用中的一些记录
- Java 8 中的 Streams API 详解
- 大数据之数据结构例析(一)