結果

問題 No.160 最短経路のうち辞書順最小
ユーザー yuya178yuya178
提出日時 2017-09-27 01:18:10
言語 Java21
(openjdk 21)
結果
AC  
実行時間 131 ms / 5,000 ms
コード長 5,358 bytes
コンパイル時間 2,142 ms
コンパイル使用メモリ 87,436 KB
実行使用メモリ 53,304 KB
最終ジャッジ日時 2024-04-27 14:21:19
合計ジャッジ時間 6,743 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 70 ms
51,120 KB
testcase_01 AC 82 ms
51,160 KB
testcase_02 AC 72 ms
51,256 KB
testcase_03 AC 73 ms
50,876 KB
testcase_04 AC 116 ms
52,928 KB
testcase_05 AC 126 ms
53,304 KB
testcase_06 AC 127 ms
53,296 KB
testcase_07 AC 118 ms
53,256 KB
testcase_08 AC 118 ms
52,984 KB
testcase_09 AC 116 ms
53,224 KB
testcase_10 AC 120 ms
53,056 KB
testcase_11 AC 119 ms
53,148 KB
testcase_12 AC 117 ms
53,144 KB
testcase_13 AC 117 ms
53,028 KB
testcase_14 AC 118 ms
53,140 KB
testcase_15 AC 124 ms
53,108 KB
testcase_16 AC 117 ms
52,884 KB
testcase_17 AC 117 ms
53,104 KB
testcase_18 AC 118 ms
53,056 KB
testcase_19 AC 118 ms
53,012 KB
testcase_20 AC 122 ms
53,096 KB
testcase_21 AC 117 ms
53,116 KB
testcase_22 AC 111 ms
53,128 KB
testcase_23 AC 115 ms
52,844 KB
testcase_24 AC 117 ms
53,204 KB
testcase_25 AC 122 ms
53,052 KB
testcase_26 AC 122 ms
53,184 KB
testcase_27 AC 122 ms
53,264 KB
testcase_28 AC 131 ms
53,148 KB
testcase_29 AC 122 ms
53,156 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

public class Main {
    static InputStream is;
    static PrintWriter out;
    static String INPUT = "";
    
    static void solve()
    {
        int n = ni();
        int m = ni();
        int s = ni();
        int g = ni();
        int[][] d = new int[n][n];
        int[][] d1 = new int[n][n];
        for(int i = 0; i < n; i++){
            Arrays.fill(d[i], 99999999);
            d[i][i] = 0;
            Arrays.fill(d1[i], 99999999);
            d1[i][i] = 0;
        }
        for(int i = 0; i < m; i++){
            int a = ni(), b = ni();
            d[a][b] = d[b][a] = d1[a][b] = d1[b][a] = ni();
        }

        for (int k = 0; k < n; k++) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if (d[i][j] > d[i][k] + d[k][j]) {
                        d[i][j] = d[i][k] + d[k][j];
                    }
                }
            }
        }
        int D = d[s][g];
        int cur = s;
        StringBuffer sb = new StringBuffer();
        sb.append(cur);
        while(cur!=g){
            for(int i=0; i<n; i++){
                if(d[s][cur]+d1[cur][i]+d[i][g] == D && cur != i){
                    sb.append(" "+i);
                    cur = i;
                    break;
                }
            }
        }
        out.println(sb);
    }

    public static void main(String[] args) throws Exception
    {
        long S = System.currentTimeMillis();
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        solve();
        out.flush();
        long G = System.currentTimeMillis();
        tr(G-S+"ms");
    }


    
    private static boolean eof()
    {
        if(lenbuf == -1)return true;
        int lptr = ptrbuf;
        while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
        
        try {
            is.mark(1000);
            while(true){
                int b = is.read();
                if(b == -1){
                    is.reset();
                    return true;
                }else if(!isSpaceChar(b)){
                    is.reset();
                    return false;
                }
            }
        } catch (IOException e) {
            return true;
        }
    }
    
    private static byte[] inbuf = new byte[1024];
    static int lenbuf = 0, ptrbuf = 0;
    
    private static int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
//  private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
    private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private static double nd() { return Double.parseDouble(ns()); }
    private static char nc() { return (char)skip(); }
    
    private static String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private static char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private static char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private static int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private static int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }

    private static int[] nsi(){
        char[] s = ns().toCharArray();
        int[] a = new int[s.length];
        for(int j = 0; j < s.length; j++){
           a[j] = s[j] - '0';
        }
        return a;
    }
}
0