#355147 (Java) No.845 最長の切符

• 問題: No.845 最長の切符
• ユーザー: Grenache
• 提出日時: 2019-06-28 22:37:25
• 言語: Java (openjdk 23)
• 結果: WA
• 実行時間: -
• コード長: 2,129 bytes
• コンパイル時間: 3,724 ms
• コンパイル使用メモリ: 79,228 KB
• 実行使用メモリ: 44,456 KB
• 最終ジャッジ日時: 2024-07-02 04:59:02
• 合計ジャッジ時間: 9,472 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 7 WA * 20

ソースコード

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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
import java.io.*;
import java.util.*;
public class Main_yukicoder845 {
    private static Scanner sc;
    private static Printer pr;
    private static void solve() {
        int n = sc.nextInt();
        int m = sc.nextInt();
        FloydWarshall fw = new FloydWarshall(n);
        for (int i = 0; i < m; i++) {
            int a = sc.nextInt() - 1;
            int b = sc.nextInt() - 1;
            int c = sc.nextInt();
            
            if (fw.d[a][b] == fw.INF || c > fw.d[a][b]) {
                fw.addEdge(a, b, c);
                fw.addEdge(b, a, c);
            }
        }
        
        long max = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                long tmp = fw.getShortestPath(i, j);
                if (i != j && tmp != fw.INF) {
                    max = Math.max(max, tmp);
                }
            }
        }
        
        pr.println(max);
    }
    // 全点対最短路 FloydWarshall O(V^3)
    private static class FloydWarshall {
        long[][] d;
        int n;
        long[][] result;
        boolean nf; // NEGATIVE CYCLE flag
        final long INF = Long.MAX_VALUE;
        FloydWarshall(int n) {
            this.n = n;
            d = new long[n][n];
            for (int i = 0; i < n; i++) {
                Arrays.fill(d[i], INF);
                d[i][i] = 0;
            }
            nf = false;
        }
        // i, j:0-indexed
        public void addEdge(int i, int j, int c) {
            d[i][j] = c;
        }
        // 負閉路があるときは-INFを返す
        public long getShortestPath(int i, int j) {
            if (nf) {
                return -INF;
            }
            if (result == null) {
                for (int kk = 0; kk < n; kk++) {
                    for (int ii = 0; ii < n; ii++) {
                        for (int jj = 0; jj < n; jj++) {
//                          d[ii][jj] = Math.min(d[ii][jj], d[ii][kk] + d[kk][jj]);
                            if (d[ii][kk] != INF && d[kk][jj] != INF && d[ii][jj] > d[ii][kk] + d[kk][jj]) {
                                d[ii][jj] = d[ii][kk] + d[kk][jj];
                            }
                        }
                    }
                }
                for (int k = 0; k < n; k++) {
                    if (d[k][k] < 0) {
                        nf = true;
                        return -INF;
                    }
                }
                result = d;
            }
            return result[i][j];
        }
    }
    // ---------------------------------------------------
    public static void main(String[] args) {
        sc = new Scanner(System.in);
        pr = new Printer(System.out);
            
        solve();
            
        pr.close();
        sc.close();
    }
    static class Printer extends PrintWriter {
        Printer(OutputStream out) {
            super(out);
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX