結果

問題 No.1 道のショートカット
ユーザー uwiuwi
提出日時 2015-04-24 23:20:25
言語 Java21
(openjdk 21)
結果
AC  
実行時間 76 ms / 5,000 ms
コード長 3,895 bytes
コンパイル時間 3,836 ms
コンパイル使用メモリ 89,268 KB
実行使用メモリ 51,976 KB
最終ジャッジ日時 2023-09-27 21:42:50
合計ジャッジ時間 7,847 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
49,320 KB
testcase_01 AC 45 ms
49,292 KB
testcase_02 AC 44 ms
49,320 KB
testcase_03 AC 44 ms
49,232 KB
testcase_04 AC 45 ms
49,516 KB
testcase_05 AC 45 ms
49,260 KB
testcase_06 AC 45 ms
49,204 KB
testcase_07 AC 45 ms
49,104 KB
testcase_08 AC 75 ms
51,976 KB
testcase_09 AC 58 ms
47,860 KB
testcase_10 AC 54 ms
50,060 KB
testcase_11 AC 57 ms
50,296 KB
testcase_12 AC 67 ms
49,968 KB
testcase_13 AC 69 ms
51,648 KB
testcase_14 AC 47 ms
49,316 KB
testcase_15 AC 45 ms
49,096 KB
testcase_16 AC 51 ms
49,528 KB
testcase_17 AC 46 ms
49,372 KB
testcase_18 AC 47 ms
49,328 KB
testcase_19 AC 48 ms
49,244 KB
testcase_20 AC 49 ms
49,272 KB
testcase_21 AC 50 ms
49,256 KB
testcase_22 AC 48 ms
49,204 KB
testcase_23 AC 74 ms
51,656 KB
testcase_24 AC 76 ms
51,924 KB
testcase_25 AC 54 ms
50,068 KB
testcase_26 AC 51 ms
49,424 KB
testcase_27 AC 73 ms
51,684 KB
testcase_28 AC 47 ms
49,200 KB
testcase_29 AC 50 ms
49,156 KB
testcase_30 AC 46 ms
49,360 KB
testcase_31 AC 49 ms
49,196 KB
testcase_32 AC 75 ms
51,752 KB
testcase_33 AC 67 ms
51,432 KB
testcase_34 AC 75 ms
51,636 KB
testcase_35 AC 47 ms
47,644 KB
testcase_36 AC 49 ms
49,224 KB
testcase_37 AC 46 ms
47,184 KB
testcase_38 AC 45 ms
49,228 KB
testcase_39 AC 50 ms
49,200 KB
testcase_40 AC 46 ms
49,052 KB
testcase_41 AC 46 ms
49,268 KB
testcase_42 AC 44 ms
49,156 KB
testcase_43 AC 46 ms
49,252 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q0xx;

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 Q17 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), c = ni(), m = ni();
		int[] from = na(m);
		int[] to = na(m);
		int[] ys = na(m);
		int[] ms = na(m);
		for(int i = 0;i < m;i++)from[i]--;
		for(int i = 0;i < m;i++)to[i]--;
		
		int[][][] g = packWD(n, from, to, ys, ms);
		long[][] dp = new long[c+1][n];
		long I = Long.MAX_VALUE / 2;
		for(int i = 0;i <= c;i++){
			Arrays.fill(dp[i], I);
		}
		dp[c][0] = 0;
		for(int z = c;z >= 1;z--){
			for(int i = 0;i < n;i++){
				for(int[] e : g[i]){
					if(z-e[1] >= 0){
						dp[z-e[1]][e[0]] = Math.min(dp[z-e[1]][e[0]], dp[z][i] + e[2]);
					}
				}
			}
		}
		
		long ret = I;
		for(int z = c;z >= 0;z--){
			ret = Math.min(ret, dp[z][n-1]);
		}
		out.println(ret == I ? -1 : ret);
	}
	
	public static int[][][] packWD(int n, int[] from, int[] to, int[] w, int[] w2) {
		int[][][] g = new int[n][][];
		int[] p = new int[n];
		for (int f : from)
			p[f]++;
		for (int i = 0; i < n; i++)
			g[i] = new int[p[i]][3];
		for (int i = 0; i < from.length; i++) {
			--p[from[i]];
			g[from[i]][p[from[i]]][0] = to[i];
			g[from[i]][p[from[i]]][1] = w[i];
			g[from[i]][p[from[i]]][2] = w2[i];
		}
		return g;
	}
	
	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");
	}
	
	public static void main(String[] args) throws Exception { new Q17().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private 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 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