-
Notifications
You must be signed in to change notification settings - Fork 0
/
821 - Page Hopping.cpp
69 lines (59 loc) · 1.42 KB
/
821 - Page Hopping.cpp
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
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int adj[105][105];
bool vis[105];
int main()
{
int u, v, t = 1;
while (true)
{
memset(adj, 63, sizeof adj);
memset(vis, false, sizeof vis);
scanf("%d %d", &u, &v);
if (u == 0 && v == 0)
{
break;
}
while (true)
{
vis[u] = true;
vis[v] = true;
adj[u][v] = 1;
scanf("%d %d", &u, &v);
if (u == 0 && v == 0)
{
break;
}
}
for (int k = 0; k < 105; k++)
{
for (int i = 0; i < 105; i++)
{
for (int j = 0; j < 105; j++)
{
adj[i][j] = min(adj[i][j],adj[i][k] + adj[k][j]);
}
}
}
double ans = 0, c = 0;
for (int i = 0; i < 105; i++)
{
for (int j = 0; j < 105; j++)
{
if (i == j)
{
continue;
}
if (vis[i] && vis[j])
{
ans += adj[i][j];
c++;
}
}
}
printf("Case %d: average length between pages = %.3lf clicks\n",t++, ans / c);
}
return 0;
}