結果
問題 | No.5006 Hidden Maze |
ユーザー | ks2m |
提出日時 | 2022-06-12 17:57:56 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,819 ms / 2,000 ms |
コード長 | 3,628 bytes |
コンパイル時間 | 1,821 ms |
実行使用メモリ | 74,140 KB |
スコア | 84,652 |
平均クエリ数 | 154.48 |
最終ジャッジ日時 | 2022-06-12 17:58:43 |
合計ジャッジ時間 | 45,886 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
純コード判定しない問題か言語 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 197 ms
62,796 KB |
testcase_01 | AC | 273 ms
65,548 KB |
testcase_02 | AC | 186 ms
58,776 KB |
testcase_03 | AC | 171 ms
57,544 KB |
testcase_04 | AC | 290 ms
63,940 KB |
testcase_05 | AC | 345 ms
69,468 KB |
testcase_06 | AC | 247 ms
59,576 KB |
testcase_07 | AC | 316 ms
64,452 KB |
testcase_08 | AC | 510 ms
67,836 KB |
testcase_09 | AC | 122 ms
57,468 KB |
testcase_10 | AC | 242 ms
59,800 KB |
testcase_11 | AC | 186 ms
57,560 KB |
testcase_12 | AC | 335 ms
63,856 KB |
testcase_13 | AC | 120 ms
53,752 KB |
testcase_14 | AC | 376 ms
69,892 KB |
testcase_15 | AC | 116 ms
51,396 KB |
testcase_16 | AC | 157 ms
55,504 KB |
testcase_17 | AC | 138 ms
51,744 KB |
testcase_18 | AC | 467 ms
65,864 KB |
testcase_19 | AC | 169 ms
57,148 KB |
testcase_20 | AC | 161 ms
55,756 KB |
testcase_21 | AC | 153 ms
58,932 KB |
testcase_22 | AC | 159 ms
54,412 KB |
testcase_23 | AC | 153 ms
62,244 KB |
testcase_24 | AC | 276 ms
63,780 KB |
testcase_25 | AC | 169 ms
56,632 KB |
testcase_26 | AC | 957 ms
65,188 KB |
testcase_27 | AC | 167 ms
64,068 KB |
testcase_28 | AC | 81 ms
49,748 KB |
testcase_29 | AC | 220 ms
63,768 KB |
testcase_30 | AC | 198 ms
57,536 KB |
testcase_31 | AC | 147 ms
60,084 KB |
testcase_32 | AC | 437 ms
63,860 KB |
testcase_33 | AC | 217 ms
59,132 KB |
testcase_34 | AC | 182 ms
56,020 KB |
testcase_35 | AC | 143 ms
53,160 KB |
testcase_36 | AC | 117 ms
57,604 KB |
testcase_37 | AC | 228 ms
65,596 KB |
testcase_38 | AC | 252 ms
64,188 KB |
testcase_39 | AC | 290 ms
64,140 KB |
testcase_40 | AC | 178 ms
57,164 KB |
testcase_41 | AC | 207 ms
58,396 KB |
testcase_42 | AC | 160 ms
62,624 KB |
testcase_43 | AC | 279 ms
64,072 KB |
testcase_44 | AC | 123 ms
58,052 KB |
testcase_45 | AC | 1,196 ms
70,304 KB |
testcase_46 | AC | 1,819 ms
74,140 KB |
testcase_47 | AC | 138 ms
53,468 KB |
testcase_48 | AC | 368 ms
64,224 KB |
testcase_49 | AC | 1,211 ms
68,908 KB |
testcase_50 | AC | 233 ms
64,344 KB |
testcase_51 | AC | 162 ms
55,220 KB |
testcase_52 | AC | 118 ms
53,856 KB |
testcase_53 | AC | 401 ms
63,860 KB |
testcase_54 | AC | 161 ms
59,260 KB |
testcase_55 | AC | 193 ms
63,996 KB |
testcase_56 | AC | 163 ms
57,368 KB |
testcase_57 | AC | 631 ms
67,272 KB |
testcase_58 | AC | 103 ms
51,920 KB |
testcase_59 | AC | 148 ms
58,944 KB |
testcase_60 | AC | 192 ms
57,512 KB |
testcase_61 | AC | 383 ms
64,052 KB |
testcase_62 | AC | 310 ms
64,412 KB |
testcase_63 | AC | 280 ms
61,476 KB |
testcase_64 | AC | 317 ms
62,276 KB |
testcase_65 | AC | 152 ms
63,936 KB |
testcase_66 | AC | 170 ms
54,000 KB |
testcase_67 | AC | 198 ms
62,560 KB |
testcase_68 | AC | 322 ms
63,356 KB |
testcase_69 | AC | 303 ms
63,984 KB |
testcase_70 | AC | 131 ms
52,592 KB |
testcase_71 | AC | 337 ms
63,980 KB |
testcase_72 | AC | 125 ms
53,568 KB |
testcase_73 | AC | 224 ms
58,328 KB |
testcase_74 | AC | 193 ms
63,892 KB |
testcase_75 | AC | 384 ms
64,940 KB |
testcase_76 | AC | 496 ms
64,204 KB |
testcase_77 | AC | 506 ms
67,772 KB |
testcase_78 | AC | 159 ms
56,952 KB |
testcase_79 | AC | 538 ms
68,028 KB |
testcase_80 | AC | 184 ms
58,080 KB |
testcase_81 | AC | 298 ms
64,236 KB |
testcase_82 | AC | 147 ms
57,544 KB |
testcase_83 | AC | 86 ms
56,320 KB |
testcase_84 | AC | 215 ms
67,736 KB |
testcase_85 | AC | 420 ms
65,188 KB |
testcase_86 | AC | 86 ms
57,112 KB |
testcase_87 | AC | 366 ms
65,584 KB |
testcase_88 | AC | 404 ms
64,676 KB |
testcase_89 | AC | 726 ms
67,072 KB |
testcase_90 | AC | 216 ms
59,060 KB |
testcase_91 | AC | 192 ms
61,724 KB |
testcase_92 | AC | 236 ms
59,488 KB |
testcase_93 | AC | 185 ms
63,748 KB |
testcase_94 | AC | 708 ms
68,384 KB |
testcase_95 | AC | 190 ms
58,496 KB |
testcase_96 | AC | 128 ms
52,616 KB |
testcase_97 | AC | 584 ms
69,152 KB |
testcase_98 | AC | 1,180 ms
68,452 KB |
testcase_99 | AC | 237 ms
58,416 KB |
ソースコード
import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.List; import java.util.Queue; public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String[] sa = br.readLine().split(" "); int h = Integer.parseInt(sa[0]); int w = Integer.parseInt(sa[1]); int p = Integer.parseInt(sa[2]); int h1 = h - 1; int w1 = w - 1; int q = 100 - p; int[] dx = {1, 0, -1, 0}; int[] dy = {0, 1, 0, -1}; double[][] tate = new double[h][w]; double[][] yoko = new double[h][w]; for (int i = 0; i < h; i++) { Arrays.fill(tate[i], 0.15); Arrays.fill(yoko[i], 0.15); } double border = 0.98; List<Integer> list = new ArrayList<>(4); for (int i = 0; i < 4; i++) { list.add(i); } while (true) { border = Math.min(border, 0.995); // 探索 double[][] d = new double[h][w]; int[][] pre = new int[h][w]; for (int i = 0; i < h; i++) { Arrays.fill(d[i], 1e9); Arrays.fill(pre[i], -1); } d[0][0] = 0; Queue<Node> que = new ArrayDeque<>(); que.add(new Node(0, 0)); while (!que.isEmpty()) { Node cur = que.poll(); int cx = cur.v / w; int cy = cur.v % w; Collections.shuffle(list); for (int i : list) { int nx = cx + dx[i]; int ny = cy + dy[i]; if (nx < 0 || h <= nx || ny < 0 || w <= ny) { continue; } double wall = 0; if (i == 0) wall = yoko[cx][cy]; else if (i == 1) wall = tate[cx][cy]; else if (i == 2) wall = yoko[nx][ny]; else if (i == 3) wall = tate[nx][ny]; if (wall > border) { continue; } double alt = cur.d + 1 + wall * 2.2; // TODO 調整 if (alt < d[nx][ny]) { que.add(new Node(nx * w + ny, alt)); d[nx][ny] = alt; pre[nx][ny] = cur.v; } } } if (pre[h1][w1] == -1) { border += 0.002; continue; } // 出力 StringBuilder sb = new StringBuilder(); int pos = h1 * w + w1; while (pos != 0) { int cx = pos / w; int cy = pos % w; int np = pre[cx][cy]; int nx = np / w; int ny = np % w; if (nx < cx) sb.append('D'); else if (ny < cy) sb.append('R'); else if (nx > cx) sb.append('U'); else if (ny > cy) sb.append('L'); else throw new RuntimeException(); pos = np; } sb.reverse(); System.out.println(sb.toString()); // 入力 int a = Integer.parseInt(br.readLine()); if (a == -1) { return; } // 壁更新 int cx = 0; int cy = 0; for (int i = 0; i < a; i++) { char c = sb.charAt(i); if (c == 'D') { yoko[cx][cy] = 0; cx++; } else if (c == 'R') { tate[cx][cy] = 0; cy++; } else if (c == 'U') { cx--; yoko[cx][cy] = 0; } else if (c == 'L') { cy--; tate[cx][cy] = 0; } } char c = sb.charAt(a); if (c == 'D' && yoko[cx][cy] > 0.1) { yoko[cx][cy] += (1 - yoko[cx][cy]) * q / 100; } else if (c == 'R' && tate[cx][cy] > 0.1) { tate[cx][cy] += (1 - tate[cx][cy]) * q / 100; } else if (c == 'U' && yoko[cx - 1][cy] > 0.1) { yoko[cx - 1][cy] += (1 - yoko[cx - 1][cy]) * q / 100; } else if (c == 'L' && tate[cx][cy - 1] > 0.1) { tate[cx][cy - 1] += (1 - tate[cx][cy - 1]) * q / 100; } } } static class Node implements Comparable<Node> { int v; double d; public Node(int v, double d) { this.v = v; this.d = d; } public int compareTo(Node o) { return Double.compare(d, o.d); } } }