結果
問題 | No.1 道のショートカット |
ユーザー | fujisu |
提出日時 | 2015-01-30 05:21:24 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 89 ms / 5,000 ms |
コード長 | 3,718 bytes |
コンパイル時間 | 2,484 ms |
コンパイル使用メモリ | 80,324 KB |
実行使用メモリ | 53,012 KB |
最終ジャッジ日時 | 2023-09-27 21:37:53 |
合計ジャッジ時間 | 6,234 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
50,200 KB |
testcase_01 | AC | 42 ms
50,332 KB |
testcase_02 | AC | 42 ms
50,168 KB |
testcase_03 | AC | 43 ms
50,736 KB |
testcase_04 | AC | 42 ms
50,580 KB |
testcase_05 | AC | 43 ms
50,432 KB |
testcase_06 | AC | 44 ms
50,152 KB |
testcase_07 | AC | 43 ms
49,840 KB |
testcase_08 | AC | 80 ms
52,156 KB |
testcase_09 | AC | 74 ms
52,328 KB |
testcase_10 | AC | 77 ms
52,140 KB |
testcase_11 | AC | 82 ms
52,440 KB |
testcase_12 | AC | 85 ms
52,780 KB |
testcase_13 | AC | 88 ms
51,836 KB |
testcase_14 | AC | 48 ms
49,804 KB |
testcase_15 | AC | 43 ms
50,016 KB |
testcase_16 | AC | 57 ms
50,216 KB |
testcase_17 | AC | 42 ms
50,240 KB |
testcase_18 | AC | 50 ms
50,592 KB |
testcase_19 | AC | 48 ms
49,824 KB |
testcase_20 | AC | 53 ms
50,188 KB |
testcase_21 | AC | 49 ms
49,848 KB |
testcase_22 | AC | 45 ms
49,884 KB |
testcase_23 | AC | 78 ms
52,060 KB |
testcase_24 | AC | 84 ms
51,924 KB |
testcase_25 | AC | 55 ms
50,396 KB |
testcase_26 | AC | 49 ms
50,220 KB |
testcase_27 | AC | 87 ms
52,432 KB |
testcase_28 | AC | 43 ms
50,252 KB |
testcase_29 | AC | 89 ms
53,012 KB |
testcase_30 | AC | 55 ms
50,584 KB |
testcase_31 | AC | 63 ms
50,980 KB |
testcase_32 | AC | 76 ms
52,048 KB |
testcase_33 | AC | 77 ms
51,304 KB |
testcase_34 | AC | 85 ms
52,108 KB |
testcase_35 | AC | 77 ms
52,088 KB |
testcase_36 | AC | 71 ms
51,956 KB |
testcase_37 | AC | 73 ms
52,388 KB |
testcase_38 | AC | 46 ms
49,860 KB |
testcase_39 | AC | 51 ms
50,836 KB |
testcase_40 | AC | 63 ms
50,720 KB |
testcase_41 | AC | 50 ms
49,812 KB |
testcase_42 | AC | 41 ms
50,252 KB |
testcase_43 | AC | 42 ms
49,648 KB |
ソースコード
import java.io.IOException; import java.util.InputMismatchException; import java.util.LinkedList; import java.util.List; import java.util.PriorityQueue; public class Main { int n; List<Edge>[] e; class Edge { int to; int cost, dist; Edge(int to, int cost, int dist) { this.to = to; this.cost = cost; this.dist = 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 (Edge e : e[pos]) { int npos = e.to; int nrem = rem - e.cost; int nlen = len + e.dist; 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]; for (int i = 0; i < n; i++) { e[i] = new LinkedList<Edge>(); } for (int i = 0; i < m; i++) { int a = u[i] - 1; int b = v[i] - 1; e[a].add(new Edge(b, y[i], 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(); } } }