結果
問題 | No.1137 Circles |
ユーザー | tenten |
提出日時 | 2023-02-16 16:06:08 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 535 ms / 2,000 ms |
コード長 | 2,608 bytes |
コンパイル時間 | 2,465 ms |
コンパイル使用メモリ | 90,232 KB |
実行使用メモリ | 55,824 KB |
最終ジャッジ日時 | 2024-07-18 16:27:11 |
合計ジャッジ時間 | 10,205 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
37,348 KB |
testcase_01 | AC | 511 ms
54,804 KB |
testcase_02 | AC | 102 ms
38,844 KB |
testcase_03 | AC | 328 ms
49,532 KB |
testcase_04 | AC | 400 ms
52,184 KB |
testcase_05 | AC | 162 ms
42,848 KB |
testcase_06 | AC | 445 ms
53,100 KB |
testcase_07 | AC | 299 ms
48,708 KB |
testcase_08 | AC | 461 ms
53,224 KB |
testcase_09 | AC | 236 ms
46,432 KB |
testcase_10 | AC | 317 ms
50,044 KB |
testcase_11 | AC | 348 ms
49,416 KB |
testcase_12 | AC | 528 ms
55,824 KB |
testcase_13 | AC | 254 ms
47,680 KB |
testcase_14 | AC | 535 ms
55,624 KB |
testcase_15 | AC | 269 ms
48,816 KB |
testcase_16 | AC | 346 ms
49,664 KB |
testcase_17 | AC | 140 ms
41,256 KB |
testcase_18 | AC | 452 ms
53,564 KB |
testcase_19 | AC | 245 ms
47,960 KB |
testcase_20 | AC | 217 ms
46,624 KB |
testcase_21 | AC | 51 ms
37,336 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(); PriorityQueue<Place> queue = new PriorityQueue<>(); for (int i = 0; i < n; i++) { int x = sc.nextInt(); int r = sc.nextInt(); queue.add(new Place(1, i, x - r)); queue.add(new Place(0, i, x + r)); } HashSet<Integer> current = new HashSet<>(); int ans = 0; while (queue.size() > 0) { Place x = queue.poll(); if (x.type == 0) { current.remove(x.idx); } else { current.add(x.idx); ans = Math.max(ans, current.size()); } } System.out.println(ans); } static class Place implements Comparable<Place> { int type; int idx; int value; public Place(int type, int idx, int value) { this.type = type; this.idx = idx; this.value = value; } public int compareTo(Place another) { if (value == another.value) { return type - another.type; } else { 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(); } }