結果
問題 | No.1767 BLUE to RED |
ユーザー | tenten |
提出日時 | 2023-03-27 15:22:01 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,801 ms / 2,000 ms |
コード長 | 2,914 bytes |
コンパイル時間 | 2,814 ms |
コンパイル使用メモリ | 93,484 KB |
実行使用メモリ | 119,472 KB |
最終ジャッジ日時 | 2023-10-19 14:59:39 |
合計ジャッジ時間 | 29,987 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
52,484 KB |
testcase_01 | AC | 56 ms
51,728 KB |
testcase_02 | AC | 57 ms
52,680 KB |
testcase_03 | AC | 57 ms
53,552 KB |
testcase_04 | AC | 95 ms
54,996 KB |
testcase_05 | AC | 92 ms
55,212 KB |
testcase_06 | AC | 60 ms
53,800 KB |
testcase_07 | AC | 104 ms
54,804 KB |
testcase_08 | AC | 112 ms
55,288 KB |
testcase_09 | AC | 1,052 ms
81,932 KB |
testcase_10 | AC | 1,334 ms
94,784 KB |
testcase_11 | AC | 1,243 ms
92,580 KB |
testcase_12 | AC | 1,033 ms
89,908 KB |
testcase_13 | AC | 1,379 ms
99,064 KB |
testcase_14 | AC | 1,606 ms
108,404 KB |
testcase_15 | AC | 1,801 ms
114,416 KB |
testcase_16 | AC | 1,621 ms
108,692 KB |
testcase_17 | AC | 1,687 ms
115,712 KB |
testcase_18 | AC | 1,570 ms
114,384 KB |
testcase_19 | AC | 1,673 ms
118,620 KB |
testcase_20 | AC | 1,725 ms
118,900 KB |
testcase_21 | AC | 1,737 ms
118,764 KB |
testcase_22 | AC | 1,614 ms
112,904 KB |
testcase_23 | AC | 1,730 ms
119,472 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 m = sc.nextInt(); TreeSet<Integer> reds = new TreeSet<>(); for (int i = 0; i < n; i++) { reds.add(sc.nextInt()); } reds.add(-Integer.MIN_VALUE / 2); reds.add(Integer.MAX_VALUE); PriorityQueue<Path> queue = new PriorityQueue<>(); int[] blues = new int[m + 2]; for (int i = 1; i <= m; i++) { blues[i] = sc.nextInt(); queue.add(new Path(i, blues[i] - reds.floor(blues[i]))); queue.add(new Path(i, reds.ceiling(blues[i]) - blues[i])); } blues[0] = -Integer.MIN_VALUE / 2; blues[m + 1] = Integer.MAX_VALUE; HashSet<Integer> used = new HashSet<>(); long ans = 0; while (queue.size() > 0) { Path p = queue.poll(); if (p.idx >= 1 && p.idx <= m && !used.contains(p.idx)) { ans += p.value; queue.add(new Path(p.idx - 1, blues[p.idx] - blues[p.idx - 1])); queue.add(new Path(p.idx + 1, blues[p.idx + 1] - blues[p.idx])); used.add(p.idx); } } System.out.println(ans); } 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(); } }