-
Notifications
You must be signed in to change notification settings - Fork 34
/
Copy pathC.java
66 lines (59 loc) · 2.01 KB
/
C.java
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
import java.io.PrintStream;
import java.util.*;
/**
* KickStart 2017 Round F
* Problem C. Catch Them All
*/
public class Main {
public String solve(Scanner scanner) {
int n=scanner.nextInt(), m=scanner.nextInt(), p=scanner.nextInt();
int[][] distance=new int[n][n];
for (int i=0;i<n;i++)
for (int j=0;j<n;j++)
if (i!=j)
distance[i][j]=Integer.MAX_VALUE/10;
for (int i=0;i<m;i++) {
int x=scanner.nextInt()-1, y=scanner.nextInt()-1;
distance[x][y]=distance[y][x]=scanner.nextInt();
}
// prim
for (int i=0;i<n;i++) {
for (int j=0;j<n;j++) {
for (int k=0;k<n;k++) {
distance[i][j]=Math.min(distance[i][j], distance[i][k]+distance[k][j]);
}
}
}
double[] ans=new double[n], tmp=new double[n];
for (int i=0;i<p;i++) {
for (int j=0;j<n;j++) {
tmp[j]=0;
for (int k=0;k<n;k++) {
if (j==k) continue;
tmp[j]+=(distance[j][k]+ans[k]);
}
tmp[j]/=(n-1);
}
for (int j=0;j<n;j++)
ans[j]=tmp[j];
}
return String.format("%.9f", ans[0]);
}
public static void main(String[] args) throws Exception {
// System.setOut(new PrintStream("output.txt"));
Scanner scanner=new Scanner(System.in);
int times=Integer.parseInt(scanner.nextLine());
long start=System.currentTimeMillis();
for (int t=1;t<=times;t++) {
try {
System.out.println(String.format("Case #%d: %s", t, new Main().solve(scanner)));
}
catch (Throwable e) {
System.err.println("ERROR in case #"+t);
e.printStackTrace();
}
}
long end=System.currentTimeMillis();
System.err.println(String.format("Time used: %.3fs", (end-start)/1000.0));
}
}