题目链接:>_>
题目:Arbitrage
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 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
题意:
判断能不能通过各个国家汇率的不同赚到比当初更多的钱。
AC代码:
#include<stdio.h>
#include<map>
#include<iostream>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
using namespace std;
#define ll long long
#define itn int
#define maxn 1005
#define maxm 1005
const ll inf = 0x3f3f3f3f;
int n, m;
int cnt = 0;
double dis[maxn];
int vis[maxn], head[maxm], outqueue[maxm];
struct node {
int next, to;
double w;
}x[maxm];
void add(int start, int endd, double w) {
x[cnt].w = w;
x[cnt].to = endd;
x[cnt].next = head[start];
head[start] = cnt++;
}
queue<int>q;
void init() {
memset(head, -1, sizeof head);
cnt = 0;
memset(x, 0, sizeof x);
memset(dis, 0, sizeof dis);
memset(outqueue, 0, sizeof outqueue);
while (!q.empty())q.pop();
}
bool spfa() {
for (int i = 1; i <= n; i++) {
dis[i] = 0;
vis[i] = 0;
}
q.push(1);
dis[1] = 1.0;
vis[1] = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
vis[u] = 0;
outqueue[u]++;
if (outqueue[u] > n)return 0;
for (int i = head[u]; i != -1; i = x[i].next) {
int v = x[i].to;
if (dis[v] < (dis[u] * x[i].w)) {
dis[v] = (dis[u] * x[i].w);
if (vis[v] == 0) {
vis[v] = 1;
q.push(v);
}
}
}
}
return 1;
}
int main() {
int yyy = 0;
while (~scanf("%d", &n) && n) {
yyy++;
init();
itn i, j;
map<string, int>m1;
string s1, s2;
double q1;
for (i = 1; i <= n; i++) {
cin >> s1;
m1[s1] = i;
}
scanf("%d", &m);
for (i = 1; i <= m; i++) {
cin >> s1 >> q1 >> s2;
add(m1[s1], m1[s2], q1);
}
if (spfa()) {
cout << "Case " << yyy << ": No" << endl;
}
else {
cout << "Case "<<yyy<<": Yes" << endl;
}
}
return 0;
}