結果
問題 | No.1 道のショートカット |
ユーザー | zimpha |
提出日時 | 2017-03-20 19:09:53 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 104 ms / 5,000 ms |
コード長 | 3,279 bytes |
コンパイル時間 | 3,424 ms |
コンパイル使用メモリ | 75,072 KB |
実行使用メモリ | 53,884 KB |
最終ジャッジ日時 | 2023-09-27 22:04:47 |
合計ジャッジ時間 | 7,383 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 39 ms
49,436 KB |
testcase_01 | AC | 40 ms
49,428 KB |
testcase_02 | AC | 37 ms
49,384 KB |
testcase_03 | AC | 39 ms
49,480 KB |
testcase_04 | AC | 37 ms
49,388 KB |
testcase_05 | AC | 38 ms
49,380 KB |
testcase_06 | AC | 39 ms
49,320 KB |
testcase_07 | AC | 40 ms
49,496 KB |
testcase_08 | AC | 68 ms
52,452 KB |
testcase_09 | AC | 65 ms
50,816 KB |
testcase_10 | AC | 63 ms
50,584 KB |
testcase_11 | AC | 76 ms
52,616 KB |
testcase_12 | AC | 101 ms
53,128 KB |
testcase_13 | AC | 104 ms
53,192 KB |
testcase_14 | AC | 43 ms
49,492 KB |
testcase_15 | AC | 40 ms
49,388 KB |
testcase_16 | AC | 49 ms
50,512 KB |
testcase_17 | AC | 39 ms
49,472 KB |
testcase_18 | AC | 42 ms
49,408 KB |
testcase_19 | AC | 43 ms
49,592 KB |
testcase_20 | AC | 52 ms
50,928 KB |
testcase_21 | AC | 45 ms
49,644 KB |
testcase_22 | AC | 42 ms
49,384 KB |
testcase_23 | AC | 103 ms
53,308 KB |
testcase_24 | AC | 91 ms
53,004 KB |
testcase_25 | AC | 55 ms
50,352 KB |
testcase_26 | AC | 48 ms
49,636 KB |
testcase_27 | AC | 100 ms
53,004 KB |
testcase_28 | AC | 40 ms
49,376 KB |
testcase_29 | AC | 80 ms
51,624 KB |
testcase_30 | AC | 51 ms
50,944 KB |
testcase_31 | AC | 67 ms
50,428 KB |
testcase_32 | AC | 64 ms
50,792 KB |
testcase_33 | AC | 63 ms
49,184 KB |
testcase_34 | AC | 91 ms
53,884 KB |
testcase_35 | AC | 59 ms
50,472 KB |
testcase_36 | AC | 63 ms
51,032 KB |
testcase_37 | AC | 59 ms
50,516 KB |
testcase_38 | AC | 42 ms
49,444 KB |
testcase_39 | AC | 45 ms
47,848 KB |
testcase_40 | AC | 50 ms
48,640 KB |
testcase_41 | AC | 42 ms
49,344 KB |
testcase_42 | AC | 39 ms
49,580 KB |
testcase_43 | AC | 38 ms
49,496 KB |
ソースコード
import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.StringTokenizer; import java.io.IOException; import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.ArrayList; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top * * @author Chiaki.Hoshinomori */ public class Main { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); Task001 solver = new Task001(); solver.solve(1, in, out); out.close(); } static class Task001 { public void solve(int testNumber, InputReader in, PrintWriter out) { int N = in.nextInt(); int C = in.nextInt(); int[][] dist = new int[N][]; ArrayList<Integer>[] graph = new ArrayList[N]; for (int i = 0; i < N; i++) { graph[i] = new ArrayList<>(); dist[i] = new int[C + 1]; Arrays.fill(dist[i], 1000000); } int V = in.nextInt(); int[] S = in.nextIntArray(V); int[] T = in.nextIntArray(V); int[] Y = in.nextIntArray(V); int[] M = in.nextIntArray(V); for (int i = 0; i < V; i++) { graph[S[i] - 1].add(i); } dist[0][0] = 0; for (int i = 0; i < N - 1; i++) { for (int j = 0; j < C; j++) { if (dist[i][j] == 1000000) continue; ; for (int k : graph[i]) { if (j + Y[k] <= C) { dist[T[k] - 1][j + Y[k]] = Math.min(dist[T[k] - 1][j + Y[k]], dist[i][j] + M[k]); } } } } int ret = -1; for (int i = 0; i <= C; i++) { if (ret == -1 || dist[N - 1][i] < ret) { ret = dist[N - 1][i]; } } if (ret == 1000000) ret = -1; out.println(ret); } } static class InputReader { public BufferedReader reader; public StringTokenizer tokenizer; public InputReader(InputStream stream) { reader = new BufferedReader(new InputStreamReader(stream), 32768); tokenizer = null; } public String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public int nextInt() { return Integer.parseInt(next()); } public int[] nextIntArray(int n) { int[] r = new int[n]; for (int i = 0; i < n; i++) { r[i] = nextInt(); } return r; } } }