-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathhumancannonball.java
56 lines (45 loc) · 1.4 KB
/
humancannonball.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
import java.util.*;
import java.math.*;
public class humancannonball {
public static double cal_dist(double[] a, double[] b) {
return Math.sqrt((a[0]-b[0])*(a[0]-b[0]) + (a[1]-b[1])*(a[1]-b[1]));
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double[] start = new double[2];
double[] end = new double[2];
start[0] = sc.nextDouble();
start[1] = sc.nextDouble();
end[0] = sc.nextDouble();
end[1] = sc.nextDouble();
int n = sc.nextInt();
double[][] map = new double[n+2][2];
for (int i = 1; i <= n; i ++ ) {
map[i][0] = sc.nextDouble();
map[i][1] = sc.nextDouble();
}
map[0] = start;
map[n+1] = end;
double[][] adjMatrix = new double[n+2][n+2];
for (int i = 0; i < n+2; i ++ ) {
Arrays.fill(adjMatrix[i],Double.MAX_VALUE);
adjMatrix[i][i] = 0;
}
for (int i = 1; i < n + 2; i ++) {
adjMatrix[0][i] = cal_dist(map[0], map[i])/5;
}
for (int i = 1; i < n + 1; i ++) {
for (int j = 1; j < n + 2; j ++) {
adjMatrix[i][j] = Math.min(2 + Math.abs(cal_dist(map[i], map[j])-50)/5, cal_dist(map[i], map[j])/5);
}
}
for (int k = 0; k < n + 2; k ++) {
for (int i = 0; i < n + 2; i ++) {
for (int j = 0; j < n + 2; j ++) {
adjMatrix[i][j] = Math.min(adjMatrix[i][j], adjMatrix[i][k]+adjMatrix[k][j]);
}
}
}
System.out.println(adjMatrix[0][n+1]);
}
}