結果
問題 | No.2695 Warp Zone |
ユーザー | tenten |
提出日時 | 2024-03-25 14:25:49 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,929 ms / 2,000 ms |
コード長 | 2,851 bytes |
コンパイル時間 | 2,672 ms |
コンパイル使用メモリ | 79,320 KB |
実行使用メモリ | 146,272 KB |
最終ジャッジ日時 | 2024-03-25 14:26:17 |
合計ジャッジ時間 | 22,981 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
54,108 KB |
testcase_01 | AC | 51 ms
54,116 KB |
testcase_02 | AC | 53 ms
54,108 KB |
testcase_03 | AC | 1,929 ms
146,272 KB |
testcase_04 | AC | 1,722 ms
124,696 KB |
testcase_05 | AC | 1,623 ms
124,664 KB |
testcase_06 | AC | 1,669 ms
140,092 KB |
testcase_07 | AC | 1,842 ms
145,740 KB |
testcase_08 | AC | 82 ms
55,180 KB |
testcase_09 | AC | 483 ms
82,508 KB |
testcase_10 | AC | 55 ms
54,104 KB |
testcase_11 | AC | 249 ms
62,720 KB |
testcase_12 | AC | 775 ms
86,964 KB |
testcase_13 | AC | 52 ms
54,124 KB |
testcase_14 | AC | 982 ms
101,284 KB |
testcase_15 | AC | 424 ms
75,252 KB |
testcase_16 | AC | 211 ms
62,732 KB |
testcase_17 | AC | 354 ms
68,424 KB |
testcase_18 | AC | 1,414 ms
114,708 KB |
testcase_19 | AC | 79 ms
54,780 KB |
testcase_20 | AC | 1,257 ms
114,756 KB |
testcase_21 | AC | 935 ms
101,252 KB |
testcase_22 | AC | 461 ms
76,184 KB |
testcase_23 | AC | 820 ms
87,604 KB |
testcase_24 | AC | 53 ms
54,104 KB |
testcase_25 | AC | 54 ms
54,120 KB |
testcase_26 | AC | 53 ms
54,120 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int h = sc.nextInt(); int w = sc.nextInt(); int n = sc.nextInt(); Point start = new Point(0, 0); Point[] points = new Point[n * 2 + 2]; for (int i = 0; i < n * 2; i++) { points[i] = new Point(sc.nextInt(), sc.nextInt()); } points[n * 2] = new Point(1, 1); points[n * 2 + 1] = new Point(h, w); PriorityQueue<Path> queue = new PriorityQueue<>(); queue.add(new Path(n * 2, 0)); int[] costs = new int[n * 2 + 2]; Arrays.fill(costs, Integer.MAX_VALUE); while (queue.size() > 0) { Path p = queue.poll(); if (costs[p.idx] <= p.value) { continue; } costs[p.idx] = p.value; for (int i = 0; i < n * 2 + 2; i++) { if (costs[i] == Integer.MAX_VALUE) { queue.add(new Path(i, p.value + points[p.idx].getDistance(points[i]))); } } if (p.idx < n * 2 && p.idx % 2 == 0) { queue.add(new Path(p.idx + 1, p.value + 1)); } } System.out.println(costs[n * 2 + 1]); } static class Path implements Comparable<Path> { int idx; int value; public Path(int idx, int value) { this.idx = idx; this.value = value; } public int compareTo(Path another) { return value - another.value; } } static class Point { int x; int y; public Point(int x, int y) { this.x = x; this.y = y; } public int getDistance(Point p) { return Math.abs(x - p.x) + Math.abs(y - p.y); } } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }