-
Notifications
You must be signed in to change notification settings - Fork 34
/
C.java
54 lines (49 loc) · 1.81 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
import java.io.PrintStream;
import java.util.*;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
/**
* APAC 2016 Round A Problem C: gCampus
* Check README.md for explanation.
*/
public class Main {
private String solve(Scanner scanner) {
int n=scanner.nextInt(), m=scanner.nextInt();
int[][] distance=new int[n][n];
for (int i=0;i<n;i++) {
Arrays.fill(distance[i], Integer.MAX_VALUE/10);
distance[i][i]=0;
}
int[][] roads=new int[m][3];
for (int i=0;i<m;i++) {
roads[i]=new int[] {scanner.nextInt(), scanner.nextInt(), scanner.nextInt()};
int x=roads[i][0], y=roads[i][1], r=roads[i][2];
distance[x][y]=distance[y][x]=Math.min(distance[x][y], r);
}
for (int k=0;k<n;k++) {
for (int i=0;i<n;i++) {
for (int j=0;j<n;j++) {
distance[i][j]=Math.min(distance[i][j], distance[i][k]+distance[k][j]);
}
}
}
ArrayList<String> arrayList=new ArrayList<>();
arrayList.add("");
for (int i=0;i<m;i++) {
if (distance[roads[i][0]][roads[i][1]]!=roads[i][2])
arrayList.add(String.valueOf(i));
}
return String.join("\n", arrayList);
}
public static void main(String[] args) throws Exception {
System.setOut(new PrintStream("output.txt"));
Scanner scanner=new Scanner(System.in);
int times=scanner.nextInt();
long start=System.currentTimeMillis();
for (int t=1;t<=times;t++) {
System.out.println(String.format("Case #%d: %s", t, new Main().solve(scanner)));
}
long end=System.currentTimeMillis();
System.err.println(String.format("Time used: %.3fs", (end-start)/1000.0));
}
}