結果
問題 | No.1 道のショートカット |
ユーザー | uafr_cs |
提出日時 | 2015-04-29 22:52:25 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,828 bytes |
コンパイル時間 | 2,336 ms |
コンパイル使用メモリ | 76,480 KB |
実行使用メモリ | 61,260 KB |
最終ジャッジ日時 | 2023-09-22 12:07:56 |
合計ジャッジ時間 | 11,692 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 120 ms
56,048 KB |
testcase_01 | AC | 121 ms
55,752 KB |
testcase_02 | AC | 121 ms
56,044 KB |
testcase_03 | AC | 128 ms
55,908 KB |
testcase_04 | WA | - |
testcase_05 | AC | 124 ms
55,796 KB |
testcase_06 | AC | 129 ms
55,792 KB |
testcase_07 | AC | 136 ms
55,700 KB |
testcase_08 | AC | 210 ms
59,368 KB |
testcase_09 | AC | 207 ms
58,556 KB |
testcase_10 | AC | 203 ms
59,540 KB |
testcase_11 | AC | 217 ms
59,180 KB |
testcase_12 | WA | - |
testcase_13 | AC | 229 ms
59,344 KB |
testcase_14 | AC | 153 ms
56,260 KB |
testcase_15 | AC | 124 ms
55,928 KB |
testcase_16 | WA | - |
testcase_17 | AC | 125 ms
55,804 KB |
testcase_18 | AC | 176 ms
56,292 KB |
testcase_19 | AC | 152 ms
56,084 KB |
testcase_20 | AC | 186 ms
56,248 KB |
testcase_21 | AC | 177 ms
56,384 KB |
testcase_22 | AC | 148 ms
53,932 KB |
testcase_23 | AC | 220 ms
59,556 KB |
testcase_24 | AC | 209 ms
59,392 KB |
testcase_25 | AC | 184 ms
56,336 KB |
testcase_26 | AC | 182 ms
56,028 KB |
testcase_27 | AC | 219 ms
59,168 KB |
testcase_28 | AC | 131 ms
56,068 KB |
testcase_29 | AC | 217 ms
59,196 KB |
testcase_30 | WA | - |
testcase_31 | AC | 203 ms
58,240 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | AC | 207 ms
59,384 KB |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | AC | 180 ms
56,444 KB |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | AC | 124 ms
56,212 KB |
testcase_43 | AC | 123 ms
56,368 KB |
ソースコード
import java.util.ArrayList; import java.util.HashMap; import java.util.HashSet; import java.util.PriorityQueue; import java.util.Scanner; public class Main { public static class State implements Comparable<State> { int node, cost, time; public State(int node, int cost, int time) { super(); this.node = node; this.cost = cost; this.time = time; } public int compareTo(State o) { if(Integer.compare(this.time, o.time) != 0){ return Integer.compare(this.time, o.time); }else if(Integer.compare(this.cost, o.cost) != 0){ return Integer.compare(this.cost, o.cost); }else if(Integer.compare(this.node, o.node) != 0){ return Integer.compare(this.node, o.node); }else{ return 0; } } } public static void main(String[] args){ Scanner sc = new Scanner(System.in); final int N = sc.nextInt(); final int C = sc.nextInt(); final int V = sc.nextInt(); int[] S = new int[V]; for(int i = 0; i < V; i++){ S[i] = sc.nextInt() - 1; } int[] T = new int[V]; for(int i = 0; i < V; i++){ T[i] = sc.nextInt() - 1; } int[] Y = new int[V]; for(int i = 0; i < V; i++){ Y[i] = sc.nextInt(); } int[] M = new int[V]; for(int i = 0; i < V; i++){ M[i] = sc.nextInt(); } ArrayList<HashSet<Integer>> nexts = new ArrayList<HashSet<Integer>>(); ArrayList<HashMap<Integer, Integer>> costs = new ArrayList<HashMap<Integer, Integer>>(); ArrayList<HashMap<Integer, Integer>> times = new ArrayList<HashMap<Integer, Integer>>(); for(int i = 0; i < N; i++){ nexts.add(new HashSet<Integer>()); costs.add(new HashMap<Integer, Integer>()); times.add(new HashMap<Integer, Integer>()); } for(int i = 0; i < V; i++){ nexts.get(S[i]).add(T[i]); costs.get(S[i]).put(T[i], Math.min(Y[i], costs.get(S[i]).containsKey(T[i]) ? costs.get(S[i]).get(T[i]) : Integer.MAX_VALUE)); times.get(S[i]).put(T[i], Math.min(M[i], times.get(S[i]).containsKey(T[i]) ? times.get(S[i]).get(T[i]) : Integer.MAX_VALUE)); } boolean[][] visited = new boolean[N][C + 1]; PriorityQueue<State> queue = new PriorityQueue<State>(); queue.add(new State(0, 0, 0)); while(!queue.isEmpty()){ final State state = queue.poll(); if(visited[state.node][state.cost]){ continue; }else{ visited[state.node][state.cost] = true; } if(state.node == N - 1){ System.out.println(state.time); return; } for(final int next : nexts.get(state.node)){ final int next_cost = state.cost + costs.get(state.node).get(next); final int next_time = state.time + times.get(state.node).get(next); if(next_cost > C){ continue; }else if(visited[next][next_cost]){ continue; } queue.add(new State(next, next_cost, next_time)); } } System.out.println(-1); } }