1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <vector>
using namespace std;
const int INF = 10020000;
typedef pair <int,int> P;
#define MID(x,y) ((x+y)>>1)
#define iabs(x) ((x)>0?(x):-(x))
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define mp make_pair
#define print() cout<<"--------"<<endl
#define maxn 220
int n,m,num;
map<string,int>maps;
int edge[maxn][maxn];
int query(string s)
{
map<string,int>::iterator it;
it = maps.find(s);
if (it == maps.end()){
maps[s] = num++;
return maps[s];
}else return maps[s];
}
void floyd()
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
{
edge[i][j] = max(edge[i][j],min(edge[i][k],edge[k][j]));
}
}
int main(){
int co = 0,w;
char s1[100],s2[100];
while (scanf("%d%d", &n, &m) && (m + n)){
getchar();
num = 1;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; j++)
edge[i][j] = 0;
for (int i = 1; i <= m; ++i)
{
scanf("%s%s%d", s1, s2, &w);getchar();
int x = query(s1);
int y = query(s2);
edge[x][y] = w;
edge[y][x] = w;
}
floyd();
scanf("%s%s",s1,s2);
int x = query(s1);
int y = query(s2);
printf("Scenario #%dn%d tonsnn", ++co, edge[x][y]);
}
return 0;
}
|