結果
問題 | No.1767 BLUE to RED |
ユーザー | tenten |
提出日時 | 2023-11-30 18:47:02 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,312 ms / 2,000 ms |
コード長 | 3,468 bytes |
コンパイル時間 | 2,536 ms |
コンパイル使用メモリ | 84,748 KB |
実行使用メモリ | 103,528 KB |
最終ジャッジ日時 | 2023-11-30 18:47:29 |
合計ジャッジ時間 | 23,342 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
54,072 KB |
testcase_01 | AC | 61 ms
54,076 KB |
testcase_02 | AC | 52 ms
54,136 KB |
testcase_03 | AC | 53 ms
54,092 KB |
testcase_04 | AC | 80 ms
55,016 KB |
testcase_05 | AC | 89 ms
55,144 KB |
testcase_06 | AC | 56 ms
54,248 KB |
testcase_07 | AC | 96 ms
55,404 KB |
testcase_08 | AC | 104 ms
55,400 KB |
testcase_09 | AC | 772 ms
82,376 KB |
testcase_10 | AC | 1,112 ms
94,316 KB |
testcase_11 | AC | 922 ms
83,652 KB |
testcase_12 | AC | 776 ms
81,436 KB |
testcase_13 | AC | 1,092 ms
92,020 KB |
testcase_14 | AC | 1,173 ms
97,580 KB |
testcase_15 | AC | 1,270 ms
101,376 KB |
testcase_16 | AC | 1,304 ms
103,012 KB |
testcase_17 | AC | 1,250 ms
97,556 KB |
testcase_18 | AC | 1,302 ms
102,936 KB |
testcase_19 | AC | 1,195 ms
101,168 KB |
testcase_20 | AC | 1,223 ms
101,400 KB |
testcase_21 | AC | 1,305 ms
103,528 KB |
testcase_22 | AC | 1,312 ms
102,928 KB |
testcase_23 | AC | 1,166 ms
101,148 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()); } int prev = -1; PriorityQueue<Bridge> bridges = new PriorityQueue<>(); for (int i = 1; i <= m; i++) { int x = sc.nextInt(); if (reds.first() <= x) { bridges.add(new Bridge(i, 0, x - reds.floor(x))); } if (reds.last() >= x) { bridges.add(new Bridge(i, 0, reds.ceiling(x) - x)); } if (i > 1) { bridges.add(new Bridge(i, i - 1, x - prev)); } prev = x; } UnionFindTree uft = new UnionFindTree(m + 1); long ans = 0; while (bridges.size() > 0) { ans += uft.unite(bridges.poll()); } System.out.println(ans); } static class Bridge implements Comparable<Bridge> { int left; int right; int value; public Bridge(int left, int right, int value) { this.left = left; this.right = right; this.value = value; } public int compareTo(Bridge another) { return value - another.value; } } static class UnionFindTree { int[] parents; public UnionFindTree(int size) { parents = new int[size]; for (int i = 0; i < size; i++) { parents[i] = i; } } public int find(int x) { if (x == parents[x]) { return x; } else { return parents[x] = find(parents[x]); } } public int unite(Bridge b) { int x = find(b.left); int y = find(b.right); if (x == y) { return 0; } else { parents[x] = y; return b.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(); } }