From d8bd7b03a4a545e20fb70c571a6a1496e3a2d47a Mon Sep 17 00:00:00 2001 From: LiiNi-coder <97495437+LiiNi-coder@users.noreply.github.com> Date: Tue, 3 Feb 2026 23:53:07 +0900 Subject: [PATCH] =?UTF-8?q?[20260203]=20BOJ=20/=20G5=20/=20=EC=88=98?= =?UTF-8?q?=EC=97=B4=EA=B3=BC=20=ED=98=84=ED=8C=85=20/=20=EC=9D=B4?= =?UTF-8?q?=EC=9D=B8=ED=9D=AC?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...4\352\263\274 \355\227\214\355\214\205.md" | 69 +++++++++++++++++++ 1 file changed, 69 insertions(+) create mode 100644 "LiiNi-coder/202602/03 BOJ \354\210\230\354\227\264\352\263\274 \355\227\214\355\214\205.md" diff --git "a/LiiNi-coder/202602/03 BOJ \354\210\230\354\227\264\352\263\274 \355\227\214\355\214\205.md" "b/LiiNi-coder/202602/03 BOJ \354\210\230\354\227\264\352\263\274 \355\227\214\355\214\205.md" new file mode 100644 index 00000000..a093696b --- /dev/null +++ "b/LiiNi-coder/202602/03 BOJ \354\210\230\354\227\264\352\263\274 \355\227\214\355\214\205.md" @@ -0,0 +1,69 @@ +```java +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Arrays; +import java.util.StringTokenizer; + +public class Main { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + int n = Integer.parseInt(br.readLine()); + long[] ms = new long[n]; + long[] ps = new long[n]; + long[] sortedMs = new long[n]; + long[] sortedPs = new long[n]; + for (int i = 0; i < n; i++) { + StringTokenizer st = new StringTokenizer(br.readLine()); + long a = Long.parseLong(st.nextToken()); + long b = Long.parseLong(st.nextToken()); + ms[i] = a - b; + ps[i] = a + b; + sortedMs[i] = ms[i]; + sortedPs[i] = ps[i]; + } + Arrays.sort(sortedMs); + Arrays.sort(sortedPs); + + StringBuilder sb = new StringBuilder(); + for (int i = 0; i < n; i++) { + long low = ms[i]; + long high = ps[i]; + + int minIdx = lowerBound(sortedPs, low) + 1; + int maxIdx = upperBound(sortedMs, high); + sb.append(minIdx).append(" ").append(maxIdx).append("\n"); + } + System.out.println(sb.toString()); + } + + private static int lowerBound(long[] arr, long target) { + int l = 0; + int r = arr.length; + while (l < r) { + int mid = (l + r) / 2; + if (arr[mid] < target) { + l = mid + 1; + } else { + r = mid; + } + } + return l; + } + + private static int upperBound(long[] arr, long target) { + int l = 0; + int r = arr.length; + while (l < r) { + int mid = (l + r) / 2; + if (arr[mid] <= target) { + l = mid + 1; + } else { + r = mid; + } + } + return l; + } +} + +```