結果
問題 | No.2354 Poor Sight in Winter |
ユーザー | tenten |
提出日時 | 2023-07-05 11:48:17 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,264 ms / 2,000 ms |
コード長 | 3,489 bytes |
コンパイル時間 | 4,776 ms |
コンパイル使用メモリ | 88,368 KB |
実行使用メモリ | 68,404 KB |
最終ジャッジ日時 | 2023-09-26 11:26:55 |
合計ジャッジ時間 | 19,010 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
49,552 KB |
testcase_01 | AC | 48 ms
49,644 KB |
testcase_02 | AC | 47 ms
49,504 KB |
testcase_03 | AC | 47 ms
49,788 KB |
testcase_04 | AC | 47 ms
49,616 KB |
testcase_05 | AC | 47 ms
49,696 KB |
testcase_06 | AC | 47 ms
49,664 KB |
testcase_07 | AC | 47 ms
49,940 KB |
testcase_08 | AC | 47 ms
49,728 KB |
testcase_09 | AC | 51 ms
49,664 KB |
testcase_10 | AC | 51 ms
50,136 KB |
testcase_11 | AC | 1,052 ms
68,024 KB |
testcase_12 | AC | 791 ms
68,404 KB |
testcase_13 | AC | 1,033 ms
64,436 KB |
testcase_14 | AC | 1,024 ms
64,656 KB |
testcase_15 | AC | 1,159 ms
68,092 KB |
testcase_16 | AC | 1,264 ms
68,024 KB |
testcase_17 | AC | 1,138 ms
68,112 KB |
testcase_18 | AC | 514 ms
62,052 KB |
testcase_19 | AC | 784 ms
67,616 KB |
testcase_20 | AC | 688 ms
61,620 KB |
testcase_21 | AC | 123 ms
54,764 KB |
testcase_22 | AC | 375 ms
59,396 KB |
testcase_23 | AC | 444 ms
59,284 KB |
testcase_24 | AC | 644 ms
64,344 KB |
testcase_25 | AC | 314 ms
58,832 KB |
testcase_26 | AC | 301 ms
59,040 KB |
testcase_27 | AC | 85 ms
52,916 KB |
testcase_28 | AC | 101 ms
53,132 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int k = sc.nextInt(); Point[] points = new Point[n + 2]; for (int i = 0; i < n + 2; i++) { points[i] = new Point(sc.nextInt(), sc.nextInt()); } int[][] matrix = new int[n + 2][n + 2]; for (int i = 0; i < n + 2; i++) { for (int j = i + 1; j < n + 2; j++) { int d = points[i].getDixtance(points[j]); matrix[i][j] = d; matrix[j][i] = d; } } PriorityQueue<Path> queue = new PriorityQueue<>(); int[] costs = new int[n + 2]; int left = 0; int right = Integer.MAX_VALUE / 2; while (right - left > 1) { int m = (left + right) / 2; Arrays.fill(costs, Integer.MAX_VALUE); queue.add(new Path(0, 0)); 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; i++) { if (costs[i] == Integer.MAX_VALUE) { queue.add(new Path(i, p.value + (matrix[i][p.idx] - 1) / m)); } } } if (costs[1] > k) { left = m; } else { right = m; } } System.out.println(right); } static class Point { int x; int y; public Point(int x, int y) { this.x = x; this.y = y; } public int getDixtance(Point p) { return Math.abs(x - p.x) + Math.abs(y - p.y); } } 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; } } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }