結果
問題 | No.1000 Point Add and Array Add |
ユーザー | tenten |
提出日時 | 2023-02-01 09:53:33 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,040 ms / 2,000 ms |
コード長 | 3,311 bytes |
コンパイル時間 | 2,838 ms |
コンパイル使用メモリ | 81,328 KB |
実行使用メモリ | 88,012 KB |
最終ジャッジ日時 | 2023-09-13 22:52:12 |
合計ジャッジ時間 | 15,124 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 58 ms
51,036 KB |
testcase_01 | AC | 58 ms
51,100 KB |
testcase_02 | AC | 59 ms
50,780 KB |
testcase_03 | AC | 58 ms
50,828 KB |
testcase_04 | AC | 58 ms
50,808 KB |
testcase_05 | AC | 58 ms
50,824 KB |
testcase_06 | AC | 58 ms
50,712 KB |
testcase_07 | AC | 58 ms
50,740 KB |
testcase_08 | AC | 59 ms
50,848 KB |
testcase_09 | AC | 60 ms
50,968 KB |
testcase_10 | AC | 59 ms
50,748 KB |
testcase_11 | AC | 59 ms
51,100 KB |
testcase_12 | AC | 114 ms
53,740 KB |
testcase_13 | AC | 133 ms
55,700 KB |
testcase_14 | AC | 128 ms
54,416 KB |
testcase_15 | AC | 116 ms
53,576 KB |
testcase_16 | AC | 703 ms
75,252 KB |
testcase_17 | AC | 622 ms
68,640 KB |
testcase_18 | AC | 899 ms
72,392 KB |
testcase_19 | AC | 798 ms
72,324 KB |
testcase_20 | AC | 1,040 ms
88,012 KB |
testcase_21 | AC | 757 ms
75,024 KB |
testcase_22 | AC | 771 ms
72,636 KB |
testcase_23 | AC | 786 ms
77,180 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(); long[] inits = new long[n]; for (int i = 0; i < n; i++) { inits[i] = sc.nextInt(); } boolean[] isAs = new boolean[m]; int[] idx = new int[m]; int[] value = new int[m]; for (int i = 0; i < m; i++) { isAs[i] = (sc.next().charAt(0) == 'A'); idx[i] = sc.nextInt(); value[i] = sc.nextInt(); } BinaryIndexedTree counts = new BinaryIndexedTree(n + 2); long[] ans = new long[n]; for (int i = m - 1; i >= 0; i--) { if (isAs[i]) { int time = counts.getSum(idx[i]); long x = value[i]; ans[idx[i] - 1] += x * time; } else { counts.add(idx[i], 1); counts.add(value[i] + 1, -1); } } for (int i = 0; i < n; i++) { ans[i] += inits[i] * counts.getSum(i + 1); } System.out.println(String.join(" ", Arrays.stream(ans).mapToObj(String::valueOf).toArray(String[]::new))); } } 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 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(); } }