結果

問題 No.160 最短経路のうち辞書順最小
ユーザー uwiuwi
提出日時 2015-03-01 23:30:18
言語 Java21
(openjdk 21)
結果
AC  
実行時間 136 ms / 5,000 ms
コード長 4,100 bytes
コンパイル時間 3,869 ms
コンパイル使用メモリ 81,392 KB
実行使用メモリ 55,240 KB
最終ジャッジ日時 2023-09-06 06:00:58
合計ジャッジ時間 8,928 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 80 ms
52,224 KB
testcase_01 AC 76 ms
52,568 KB
testcase_02 AC 73 ms
52,120 KB
testcase_03 AC 82 ms
50,760 KB
testcase_04 AC 126 ms
53,304 KB
testcase_05 AC 136 ms
53,644 KB
testcase_06 AC 135 ms
53,340 KB
testcase_07 AC 123 ms
53,192 KB
testcase_08 AC 125 ms
53,308 KB
testcase_09 AC 126 ms
53,456 KB
testcase_10 AC 124 ms
53,280 KB
testcase_11 AC 126 ms
53,364 KB
testcase_12 AC 125 ms
53,516 KB
testcase_13 AC 125 ms
53,480 KB
testcase_14 AC 127 ms
53,440 KB
testcase_15 AC 125 ms
53,396 KB
testcase_16 AC 124 ms
53,332 KB
testcase_17 AC 125 ms
53,416 KB
testcase_18 AC 125 ms
53,372 KB
testcase_19 AC 126 ms
53,512 KB
testcase_20 AC 127 ms
53,396 KB
testcase_21 AC 125 ms
55,240 KB
testcase_22 AC 122 ms
53,476 KB
testcase_23 AC 123 ms
53,352 KB
testcase_24 AC 124 ms
53,472 KB
testcase_25 AC 125 ms
53,316 KB
testcase_26 AC 129 ms
51,552 KB
testcase_27 AC 128 ms
53,460 KB
testcase_28 AC 136 ms
53,744 KB
testcase_29 AC 127 ms
53,476 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q3xx;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q417 {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int n = ni(), m = ni(), s = ni(), go = ni();
		int[][] g = new int[n][n];
		int[][] og = new int[n][n];
		for(int i = 0;i < n;i++){
			Arrays.fill(g[i], 99999999);
			g[i][i] = 0;
			Arrays.fill(og[i], 99999999);
			og[i][i] = 0;
		}
		for(int i = 0;i < m;i++){
			int f = ni(), t = ni();
			og[f][t] = og[t][f] = g[f][t] = g[t][f] = ni();
		}
		for (int k = 0; k < n; k++) {
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < n; j++) {
					if (g[i][j] > g[i][k] + g[k][j]) {
						g[i][j] = g[i][k] + g[k][j];
					}
				}
			}
		}
		
		int D = g[s][go];
		int cur = s;
		StringBuilder route = new StringBuilder();
		route.append(cur);
		while(cur != go){
			for(int i = 0;i < n;i++){
				if(i != cur && g[s][cur] + og[cur][i] + g[i][go] == D){
					route.append(" " + i);
					cur = i;
					break;
				}
			}
		}
		out.println(route);
	}
	
	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 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))){ // when nextLine, (isSpaceChar(b) && 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)); }
}
0