結果
問題 | No.1641 Tree Xor Query |
ユーザー | tenten |
提出日時 | 2022-09-06 14:30:14 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 566 ms / 5,000 ms |
コード長 | 3,159 bytes |
コンパイル時間 | 2,415 ms |
コンパイル使用メモリ | 79,032 KB |
実行使用メモリ | 90,092 KB |
最終ジャッジ日時 | 2024-05-01 11:42:52 |
合計ジャッジ時間 | 6,589 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 50 ms
50,284 KB |
testcase_01 | AC | 49 ms
50,428 KB |
testcase_02 | AC | 45 ms
50,324 KB |
testcase_03 | AC | 47 ms
50,476 KB |
testcase_04 | AC | 50 ms
50,392 KB |
testcase_05 | AC | 50 ms
50,104 KB |
testcase_06 | AC | 48 ms
50,308 KB |
testcase_07 | AC | 47 ms
49,992 KB |
testcase_08 | AC | 48 ms
49,988 KB |
testcase_09 | AC | 49 ms
50,352 KB |
testcase_10 | AC | 48 ms
50,160 KB |
testcase_11 | AC | 48 ms
50,328 KB |
testcase_12 | AC | 50 ms
50,340 KB |
testcase_13 | AC | 549 ms
90,092 KB |
testcase_14 | AC | 566 ms
89,232 KB |
testcase_15 | AC | 130 ms
52,184 KB |
testcase_16 | AC | 164 ms
57,184 KB |
testcase_17 | AC | 145 ms
54,580 KB |
testcase_18 | AC | 142 ms
54,808 KB |
testcase_19 | AC | 133 ms
52,160 KB |
testcase_20 | AC | 508 ms
75,308 KB |
ソースコード
import java.io.*; import java.util.*; public class Main { static ArrayList<ArrayList<Integer>> graph = new ArrayList<>(); static int size = 0; static int[] starts; static int[] ends; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int q = sc.nextInt(); int[] values = new int[n]; for (int i = 0; i < n; i++) { values[i] = sc.nextInt(); graph.add(new ArrayList<>()); } for (int i = 0; i < n - 1; i++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; graph.get(a).add(b); graph.get(b).add(a); } starts = new int[n]; ends = new int[n]; setIdx(0, 0); BinaryIndexedTree bit = new BinaryIndexedTree(size + 1); for (int i = 0; i < n; i++) { bit.add(starts[i], values[i]); } StringBuilder sb = new StringBuilder(); while (q-- > 0) { int type = sc.nextInt(); int x = sc.nextInt() - 1; int y = sc.nextInt(); if (type == 1) { bit.add(starts[x], y); } else { sb.append(bit.getSum(starts[x], ends[x])).append("\n"); } } System.out.print(sb); } static void setIdx(int i, int p) { size++; starts[i] = size; for (int x : graph.get(i)) { if (x == p) { continue; } setIdx(x, i); size++; } ends[i] = size; } } 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(""); 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 String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }