結果

問題 No.859 路線A、路線B、路線C
ユーザー uwiuwi
提出日時 2019-08-09 21:27:29
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,859 bytes
コンパイル時間 3,955 ms
コンパイル使用メモリ 83,516 KB
実行使用メモリ 50,268 KB
最終ジャッジ日時 2024-07-19 11:10:47
合計ジャッジ時間 5,383 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
37,060 KB
testcase_01 AC 52 ms
36,972 KB
testcase_02 AC 52 ms
36,760 KB
testcase_03 AC 50 ms
36,644 KB
testcase_04 AC 51 ms
36,824 KB
testcase_05 AC 51 ms
37,108 KB
testcase_06 AC 52 ms
36,840 KB
testcase_07 AC 51 ms
36,836 KB
testcase_08 AC 53 ms
36,964 KB
testcase_09 AC 53 ms
37,048 KB
testcase_10 AC 55 ms
37,056 KB
testcase_11 WA -
testcase_12 AC 51 ms
37,048 KB
testcase_13 AC 52 ms
36,660 KB
testcase_14 AC 52 ms
36,960 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190809;
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 C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int[] x = na(3);
		char s0 = nc();
		int t0 = ni();
		char s1 = nc();
		int t1 = ni();
		long[][] g = new long[8][8];
		for(int i = 0;i < 8;i++)Arrays.fill(g[i], Long.MAX_VALUE / 3);
		for(int i= 0;i < 8;i++)g[i][i] = 0;
		for(int i = 0;i < 3;i++){
			for(int j = 0;j < 3;j++){
				if(i != j)g[i][j] = 1;
				if(i != j)g[i+3][j+3] = 1;
			}
		}
		g[0][3] = g[3][0] = x[0]-1;
		g[1][4] = g[4][1] = x[1]-1;
		g[2][5] = g[5][2] = x[2]-1;
		g[s0-'A'][6] = g[6][s0-'A'] = t0 - 1;
		g[s0-'A'+3][6] = g[6][s0-'A'+3] = x[s0-'A'] - t0;
		g[s1-'A'][7] = g[7][s1-'A'] = t1 - 1;
		g[s1-'A'+3][7] = g[7][s1-'A'+3] = x[s1-'A'] - t1;
		
		for (int k = 0; k < 8; k++) {
			for (int i = 0; i < 8; i++) {
				for (int j = 0; j < 8; j++) {
					if (g[i][j] > g[i][k] + g[k][j]) {
						g[i][j] = g[i][k] + g[k][j];
					}
				}
			}
		}
		out.println(g[6][7]);
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new C().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private 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 boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private 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 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private 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 int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private 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) { System.out.println(Arrays.deepToString(o)); }
}
0