結果

問題 No.1 道のショートカット
ユーザー fujisufujisu
提出日時 2015-01-30 05:06:37
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,853 bytes
コンパイル時間 2,142 ms
コンパイル使用メモリ 87,680 KB
実行使用メモリ 52,204 KB
最終ジャッジ日時 2024-07-08 03:43:38
合計ジャッジ時間 6,193 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
37,176 KB
testcase_01 AC 48 ms
37,132 KB
testcase_02 AC 48 ms
37,144 KB
testcase_03 AC 48 ms
37,116 KB
testcase_04 WA -
testcase_05 AC 47 ms
36,936 KB
testcase_06 AC 48 ms
37,104 KB
testcase_07 AC 49 ms
36,800 KB
testcase_08 AC 93 ms
39,164 KB
testcase_09 AC 88 ms
39,040 KB
testcase_10 AC 92 ms
39,112 KB
testcase_11 AC 86 ms
39,176 KB
testcase_12 WA -
testcase_13 AC 89 ms
39,376 KB
testcase_14 AC 51 ms
37,340 KB
testcase_15 AC 46 ms
37,032 KB
testcase_16 WA -
testcase_17 AC 48 ms
37,392 KB
testcase_18 AC 51 ms
37,160 KB
testcase_19 AC 52 ms
37,324 KB
testcase_20 AC 56 ms
37,476 KB
testcase_21 AC 54 ms
37,320 KB
testcase_22 AC 53 ms
37,260 KB
testcase_23 AC 141 ms
45,240 KB
testcase_24 AC 90 ms
39,460 KB
testcase_25 AC 57 ms
37,288 KB
testcase_26 AC 58 ms
37,384 KB
testcase_27 AC 93 ms
39,276 KB
testcase_28 AC 52 ms
36,976 KB
testcase_29 AC 97 ms
39,196 KB
testcase_30 WA -
testcase_31 AC 81 ms
38,224 KB
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 AC 91 ms
38,948 KB
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 AC 53 ms
37,244 KB
testcase_40 WA -
testcase_41 WA -
testcase_42 AC 48 ms
36,920 KB
testcase_43 AC 49 ms
36,840 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.LinkedList;
import java.util.List;
import java.util.PriorityQueue;

public class Main {
	int n;
	List<Integer>[] e;
	int[][] cost, dist;

	class D implements Comparable<D> {
		int pos;
		int rem;
		int len;

		D(int pos, int rem, int len) {
			this.pos = pos;
			this.rem = rem;
			this.len = len;
		}

		@Override
		public int compareTo(D o) {
			if (this.len != o.len)
				return this.len - o.len;
			if (this.rem != o.rem)
				return this.rem - o.rem;
			return this.pos - o.pos;
		}

		@Override
		public String toString() {
			return "(" + pos + ", " + rem + ", " + len + ")";
		}
	}

	int dijkstra(int c) {
		PriorityQueue<D> queue = new PriorityQueue<D>();
		queue.add(new D(0, c, 0));

		while (!queue.isEmpty()) {
			D d = queue.poll();
			int pos = d.pos;
			int rem = d.rem;
			int len = d.len;

			if (pos == n - 1) {
				return len;
			}

			for (Integer I : e[pos]) {
				int npos = I;
				int nrem = rem - cost[pos][I];
				int nlen = len + dist[pos][I];
				if (nrem < 0)
					continue;
				queue.add(new D(npos, nrem, nlen));
			}
		}

		return -1;
	}

	void run() {
		MyScanner sc = new MyScanner();

		n = sc.nextInt();
		int c = sc.nextInt();
		int m = sc.nextInt();
		int[] u = sc.nextIntArray(m);
		int[] v = sc.nextIntArray(m);
		int[] y = sc.nextIntArray(m);
		int[] t = sc.nextIntArray(m);
		e = new LinkedList[n];
		cost = new int[n][n];
		dist = new int[n][n];
		for (int i = 0; i < n; i++) {
			Arrays.fill(cost[i], 1 << 27);
			Arrays.fill(dist[i], 1 << 27);
		}
		for (int i = 0; i < n; i++) {
			e[i] = new LinkedList<Integer>();
		}
		for (int i = 0; i < m; i++) {
			int a = u[i] - 1;
			int b = v[i] - 1;
			e[a].add(b);
			cost[a][b] = Math.min(cost[a][b], y[i]);
			dist[a][b] = Math.min(dist[a][b], t[i]);
		}

		System.out.println(dijkstra(c));
	}

	public static void main(String[] args) {
		new Main().run();
	}

	public void mapDebug(int[][] a) {
		System.out.println("--------map display---------");
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length; j++) {
				System.out.printf("%3d ", a[i][j]);
			}
			System.out.println();
		}
		System.out.println("----------------------------" + '\n');
	}

	class MyScanner {
		int read() {
			try {
				return System.in.read();
			} catch (IOException e) {
				throw new InputMismatchException();
			}
		}

		boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		boolean isEndline(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		int[] nextIntArray(int n) {
			int[] array = new int[n];
			for (int i = 0; i < n; i++)
				array[i] = nextInt();
			return array;
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		long[] nextLongArray(int n) {
			long[] array = new long[n];
			for (int i = 0; i < n; i++)
				array[i] = nextLong();
			return array;
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		double[] nextDoubleArray(int n) {
			double[] array = new double[n];
			for (int i = 0; i < n; i++)
				array[i] = nextDouble();
			return array;
		}

		String next() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		String[] nextStringArray(int n) {
			String[] array = new String[n];
			for (int i = 0; i < n; i++)
				array[i] = next();

			return array;
		}

		String nextLine() {
			int c = read();
			while (isEndline(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndline(c));
			return res.toString();
		}
	}
}
0