結果
問題 | No.1000 Point Add and Array Add |
ユーザー | tenten |
提出日時 | 2021-05-12 08:59:05 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 756 ms / 2,000 ms |
コード長 | 2,644 bytes |
コンパイル時間 | 5,083 ms |
コンパイル使用メモリ | 77,464 KB |
実行使用メモリ | 70,848 KB |
最終ジャッジ日時 | 2023-10-23 20:53:24 |
合計ジャッジ時間 | 16,299 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
52,492 KB |
testcase_01 | AC | 50 ms
53,616 KB |
testcase_02 | AC | 50 ms
53,616 KB |
testcase_03 | AC | 50 ms
53,612 KB |
testcase_04 | AC | 50 ms
53,612 KB |
testcase_05 | AC | 49 ms
53,616 KB |
testcase_06 | AC | 50 ms
53,608 KB |
testcase_07 | AC | 50 ms
53,624 KB |
testcase_08 | AC | 50 ms
53,620 KB |
testcase_09 | AC | 49 ms
53,608 KB |
testcase_10 | AC | 49 ms
53,556 KB |
testcase_11 | AC | 50 ms
53,620 KB |
testcase_12 | AC | 121 ms
55,312 KB |
testcase_13 | AC | 111 ms
55,692 KB |
testcase_14 | AC | 117 ms
55,840 KB |
testcase_15 | AC | 124 ms
55,688 KB |
testcase_16 | AC | 621 ms
70,796 KB |
testcase_17 | AC | 566 ms
66,032 KB |
testcase_18 | AC | 756 ms
70,788 KB |
testcase_19 | AC | 734 ms
68,896 KB |
testcase_20 | AC | 594 ms
68,984 KB |
testcase_21 | AC | 709 ms
70,712 KB |
testcase_22 | AC | 686 ms
70,848 KB |
testcase_23 | AC | 727 ms
70,676 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(); int q = sc.nextInt(); int[] org = new int[n + 1]; for (int i = 1; i <= n; i++) { org[i] = sc.nextInt(); } boolean[] isA = new boolean[q]; int[] lefts = new int[q]; int[] rights = new int[q]; for (int i = 0; i < q; i++) { isA[i] = sc.next().equals("A"); lefts[i] = sc.nextInt(); rights[i] = sc.nextInt(); } BinaryIndexedTree bit = new BinaryIndexedTree(n + 2); long[] ans = new long[n + 1]; for (int i = q - 1; i >= 0; i--) { if (isA[i]) { ans[lefts[i]] += (long)rights[i] * bit.getSum(lefts[i]); } else { bit.add(lefts[i], 1); bit.add(rights[i] + 1, -1); } } StringBuilder sb = new StringBuilder(); for (int i = 1; i <= n; i++) { if (i > 1) { sb.append(" "); } ans[i] += (long)org[i] * bit.getSum(i); sb.append(ans[i]); } System.out.println(sb); } } 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 String next() throws Exception { if (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }