結果
問題 | No.789 範囲の合計 |
ユーザー | tenten |
提出日時 | 2022-08-24 09:41:14 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 728 ms / 1,000 ms |
コード長 | 2,698 bytes |
コンパイル時間 | 2,159 ms |
コンパイル使用メモリ | 79,264 KB |
実行使用メモリ | 73,568 KB |
最終ジャッジ日時 | 2024-04-20 00:57:55 |
合計ジャッジ時間 | 9,569 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
50,544 KB |
testcase_01 | AC | 51 ms
49,936 KB |
testcase_02 | AC | 654 ms
68,008 KB |
testcase_03 | AC | 318 ms
58,540 KB |
testcase_04 | AC | 643 ms
67,792 KB |
testcase_05 | AC | 643 ms
68,768 KB |
testcase_06 | AC | 661 ms
68,092 KB |
testcase_07 | AC | 301 ms
58,556 KB |
testcase_08 | AC | 481 ms
63,052 KB |
testcase_09 | AC | 472 ms
63,204 KB |
testcase_10 | AC | 728 ms
73,568 KB |
testcase_11 | AC | 651 ms
68,084 KB |
testcase_12 | AC | 662 ms
67,792 KB |
testcase_13 | AC | 50 ms
50,432 KB |
testcase_14 | AC | 49 ms
50,336 KB |
ソースコード
import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); boolean[] isAdds = new boolean[n]; int[] lefts = new int[n]; int[] rights = new int[n]; TreeMap<Integer, Integer> compress = new TreeMap<>(); for (int i = 0; i < n; i++) { isAdds[i] = (sc.nextInt() == 0); lefts[i] = sc.nextInt(); rights[i] = sc.nextInt(); if (isAdds[i]) { compress.put(lefts[i], null); } else { compress.put(lefts[i], null); compress.put(rights[i], null); } } int idx = 1; for (int x : compress.keySet()) { compress.put(x, idx++); } BinaryIndexedTree bit = new BinaryIndexedTree(idx); long ans = 0; for (int i = 0; i < n; i++) { if (isAdds[i]) { bit.add(compress.get(lefts[i]), rights[i]); } else { ans += bit.getSum(compress.get(lefts[i]), compress.get(rights[i])); } } System.out.println(ans); } } class BinaryIndexedTree { int size; int[] tree; public BinaryIndexedTree(int size) { this.size = size; tree = new int[size]; } public void add(int idx, int value) { int mask = 1; while (idx < size) { if ((idx & mask) != 0) { tree[idx] += value; idx += mask; } mask <<= 1; } } public int getSum(int from, int to) { return getSum(to) - getSum(from - 1); } public int getSum(int x) { int mask = 1; int ans = 0; while (x > 0) { if ((x & mask) != 0) { ans += tree[x]; x -= mask; } mask <<= 1; } return ans; } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); 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 String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }