結果
| 問題 |
No.1641 Tree Xor Query
|
| コンテスト | |
| ユーザー |
 noimi
|
| 提出日時 | 2021-08-06 21:53:50 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 41 ms / 5,000 ms |
| コード長 | 19,571 bytes |
| コンパイル時間 | 3,279 ms |
| コンパイル使用メモリ | 238,184 KB |
| 最終ジャッジ日時 | 2025-01-23 15:11:36 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 18 |
コンパイルメッセージ
main.cpp:575:1: warning: ISO C++ forbids declaration of ‘main’ with no type [-Wreturn-type]
575 | main() {
| ^~~~
main.cpp: In function ‘void scan(char*)’:
main.cpp:65:28: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
65 | void scan(char a[]) { scanf("%s", a); }
| ~~~~~^~~~~~~~~
ソースコード
#pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define rep2(i, a, b) for(ll i = a; i <= b; ++i)
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep3(i, a, b) for(ll i = a; i >= b; --i)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
IN(name)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
IN(name)
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define fi first
#define se second
#define all(c) begin(c), end(c)
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
using namespace std;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
#define Size(c) (int)(c).size()
#define INT(...) \
int __VA_ARGS__; \
IN(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
IN(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
IN(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
IN(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
IN(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
IN(__VA_ARGS__)
#define LD(...) \
ld __VA_ARGS__; \
IN(__VA_ARGS__)
int scan() { return getchar(); }
template <class T> void scan(T a) { cin >> a; }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(long double &a) { cin >> a; }
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T> void scan(vector<T> &);
template <class T, size_t size> void scan(array<T, size> &);
template <class T, class L> void scan(pair<T, L> &);
template <class T, size_t size> void scan(T (&)[size]);
template <class T> void scan(vector<T> &a) {
for(auto &i : a) scan(i);
}
template <class T> void scan(deque<T> &a) {
for(auto &i : a) scan(i);
}
template <class T, size_t size> void scan(array<T, size> &a) {
for(auto &i : a) scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> void scan(T (&a)[size]) {
for(auto &i : a) scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
scan(head);
IN(tail...);
}
string stin() {
string s;
cin >> s;
return s;
}
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
vi iota(int n) {
vi a(n);
iota(all(a), 0);
return a;
}
template <class T> void UNIQUE(vector<T> &x) {
sort(all(x));
x.erase(unique(all(x)), x.end());
}
int in() {
int x;
cin >> x;
return x;
}
ll lin() {
unsigned long long x;
cin >> x;
return x;
}
void print() { putchar(' '); }
void print(bool a) { cout << a; }
void print(int a) { cout << a; }
void print(long long a) { cout << a; }
void print(char a) { cout << a; }
void print(string &a) { cout << a; }
void print(double a) { cout << a; }
template <class T> void print(const vector<T> &);
template <class T, size_t size> void print(const array<T, size> &);
template <class T, class L> void print(const pair<T, L> &p);
template <class T, size_t size> void print(const T (&)[size]);
template <class T> void print(const vector<T> &a) {
if(a.empty()) return;
print(a[0]);
for(auto i = a.begin(); ++i != a.end();) {
cout << " ";
print(*i);
}
cout << endl;
}
template <class T> void print(const deque<T> &a) {
if(a.empty()) return;
print(a[0]);
for(auto i = a.begin(); ++i != a.end();) {
cout << " ";
print(*i);
}
}
template <class T, size_t size> void print(const array<T, size> &a) {
print(a[0]);
for(auto i = a.begin(); ++i != a.end();) {
cout << " ";
print(*i);
}
}
template <class T, class L> void print(const pair<T, L> &p) {
cout << '(';
print(p.first);
cout << ",";
print(p.second);
cout << ')';
}
template <class T> void print(set<T> &x) {
for(auto e : x) print(e), cout << " ";
cout << endl;
}
template <class T> void print(multiset<T> &x) {
for(auto e : x) print(e), cout << " ";
cout << endl;
}
template <class T, size_t size> void print(const T (&a)[size]) {
print(a[0]);
for(auto i = a; ++i != end(a);) {
cout << " ";
print(*i);
}
}
template <class T> void print(const T &a) { cout << a; }
int out() {
putchar('\n');
return 0;
}
template <class T> int out(const T &t) {
print(t);
putchar('\n');
return 0;
}
template <class Head, class... Tail> int out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
return 0;
}
ll gcd(ll a, ll b) {
while(b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
ll lcm(ll a, ll b) {
if(!a || !b) return 0;
return a * b / gcd(a, b);
}
vector<pll> factor(ll x) {
vector<pll> ans;
for(ll i = 2; i * i <= x; i++)
if(x % i == 0) {
ans.push_back({i, 1});
while((x /= i) % i == 0) ans.back().second++;
}
if(x != 1) ans.push_back({x, 1});
return ans;
}
vector<int> divisor(int x) {
vector<int> ans;
for(int i = 1; i * i <= x; i++)
if(x % i == 0) {
ans.pb(i);
if(i * i != x) ans.pb(x / i);
}
return ans;
}
template <typename T> void zip(vector<T> &x) {
vector<T> y = x;
sort(all(y));
for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }
}
int popcount(ll x) { return __builtin_popcountll(x); }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }
template <typename T> void shuffle(vector<T> &v) {
rep3(i, v.size() - 1, 1) { swap(v[i], v[rnd(i)]); }
}
#define endl '\n'
vector<string> YES{"NO", "YES"};
vector<string> Yes{"No", "Yes"};
vector<string> yes{"no", "yes"};
#ifdef _LOCAL
#undef endl
#define debug(x) \
cout << #x << ": "; \
print(x); \
cout << endl;
void err() {}
template <class T> void err(const T &t) {
print(t);
cout << " ";
}
template <class Head, class... Tail> void err(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
}
#else
#define debug(x)
template <class... T> void err(const T &...) {}
#endif
template <typename T> struct edge {
int from, to;
T cost;
int id;
edge(int to, T cost) : from(-1), to(to), cost(cost) {}
edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}
// edge(int from,int to,T cost,int id):from(from),to(to),cost(cost),id(id){}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedTree = vector<Edges<T>>;
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
template <typename T> using Matrix = vector<vector<T>>;
using Graph = vector<vector<int>>;
using tree = vector<vector<int>>;
tree getTree(int n, int offset = 1) {
tree res(n);
for(int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a -= offset, b -= offset;
res[a].emplace_back(b);
res[b].emplace_back(a);
}
return res;
}
template <typename T> WeightedTree<T> getWeightedTree(int n, int offset = 1) {
WeightedTree<T> res(n);
for(int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a -= offset, b -= offset;
T c;
cin >> c;
res[a].emplace_back(b, c);
res[b].emplace_back(a, c);
}
return res;
}
Graph getGraph(int n, int m, int offset = 1) {
Graph res(n);
for(int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
a -= offset, b -= offset;
res[a].emplace_back(b);
res[b].emplace_back(a);
}
return res;
}
template <typename T> WeightedGraph<T> getWeightedGraph(int n, int m, int offset = 1) {
WeightedGraph<T> res(n);
for(int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
T c;
cin >> c;
res[a].emplace_back(b, c);
res[b].emplace_back(a, c);
}
}
struct Setup_io {
Setup_io() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
}
} setup_io;
#pragma endregion
// _________コーディングはここから！！___________
template <typename G> struct HLDecomposition {
G &g;
vector<int> sz, in, out, head, rev, par;
HLDecomposition(G &g) : g(g), sz(g.size()), in(g.size()), out(g.size()), head(g.size()), rev(g.size()), par(g.size()) {}
void dfs_sz(int idx, int p) {
par[idx] = p;
sz[idx] = 1;
if(g[idx].size() and g[idx][0] == p) swap(g[idx][0], g[idx].back());
for(auto &to : g[idx]) {
if(to == p) continue;
dfs_sz(to, idx);
sz[idx] += sz[to];
if(sz[g[idx][0]] < sz[to]) swap(g[idx][0], to);
}
}
void dfs_hld(int idx, int par, int ×) {
in[idx] = times++;
rev[in[idx]] = idx;
for(auto &to : g[idx]) {
if(to == par) continue;
head[to] = (g[idx][0] == to ? head[idx] : to);
dfs_hld(to, idx, times);
}
out[idx] = times;
}
template <typename T> void dfs_hld(int idx, int par, int ×, vector<T> &v) {
in[idx] = times++;
rev[in[idx]] = idx;
for(auto &to : g[idx]) {
if(to == par) {
v[in[idx]] = to.cost;
continue;
}
head[to] = (g[idx][0] == to ? head[idx] : to);
dfs_hld(to, idx, times, v);
}
out[idx] = times;
}
template <typename T> void dfs_hld(int idx, int par, int ×, vector<T> &v, vector<T> &a) {
in[idx] = times++;
rev[in[idx]] = idx;
v[in[idx]] = a[idx];
for(auto &to : g[idx]) {
if(to == par) continue;
head[to] = (g[idx][0] == to ? head[idx] : to);
dfs_hld(to, idx, times, v, a);
}
out[idx] = times;
}
void build() {
dfs_sz(0, -1);
int t = 0;
dfs_hld(0, -1, t);
}
template <typename T> vector<T> build() {
dfs_sz(0, -1);
int t = 0;
vector<T> res(g.size());
dfs_hld(0, -1, t, res);
return res;
}
// 頂点属性で build する場合
template <typename T> vector<T> build(vector<T> &a) {
dfs_sz(0, -1);
int t = 0;
vector<T> res(g.size());
dfs_hld(0, -1, t, res, a);
return res;
}
int la(int v, int k) {
while(1) {
int u = head[v];
if(in[v] - k >= in[u]) return rev[in[v] - k];
k -= in[v] - in[u] + 1;
v = par[u];
}
}
int lca(int u, int v) {
for(;; v = par[head[v]]) {
if(in[u] > in[v]) swap(u, v);
if(head[u] == head[v]) return u;
}
}
template <typename T, typename Q, typename F> T query(int u, int v, const T &e, const Q &q, const F &f, bool edge = false) {
T l = e, r = e;
for(;; v = par[head[v]]) {
if(in[u] > in[v]) swap(u, v), swap(l, r);
if(head[u] == head[v]) break;
l = f(q(in[head[v]], in[v] + 1), l);
}
return f(f(q(in[u] + edge, in[v] + 1), l), r);
}
template <typename T, typename Q, typename Q2, typename F> T query(int u, int v, const T &e, const Q &q1, const Q2 &q2, const F &f, bool edge = false) {
T l = e, r = e;
for(;;) {
if(head[u] == head[v]) break;
if(in[u] > in[v]) {
l = f(l, q2(in[head[u]], in[u] + 1));
u = par[head[u]];
} else {
r = f(q1(in[head[v]], in[v] + 1), r);
v = par[head[v]];
}
}
if(in[u] > in[v]) return f(f(l, q2(in[v] + edge, in[u] + 1)), r);
return f(f(l, q1(in[u] + edge, in[v] + 1)), r);
}
template <typename Q> void add(int u, int v, const Q &q, bool edge = false) {
for(;; v = par[head[v]]) {
if(in[u] > in[v]) swap(u, v);
if(head[u] == head[v]) break;
q(in[head[v]], in[v] + 1);
}
q(in[u] + edge, in[v] + 1);
}
};
template <typename T = long long> struct SegmentTree {
using F = function<T(T, T)>;
#define clz(x) __builtin_clz(x)
int sz;
vector<T> seg;
const F f;
const T unit;
SegmentTree(int n, const F f, const T &unit) : f(f), unit(unit), sz(n - 1 ? 1 << (32 - clz(n - 1)) : 1) { seg.assign(2 * sz, unit); }
SegmentTree(vector<T> &a, const F f, const T &unit) : f(f), sz((int)a.size() > 1 ? 1 << (32 - clz(a.size() - 1)) : 1), unit(unit) {
int n0 = a.size();
seg.assign(2 * sz, unit);
for(int i = 0; i < n0; ++i) seg[i + sz] = a[i];
for(int i = sz - 1; i > 0; --i) seg[i] = f(seg[i << 1], seg[(i << 1) | 1]);
}
T query(int l, int r) {
T x = unit;
for(int d = r - l; d >= 1; d = r - l) {
int L = l | ((1U << 31) >> clz(d));
int k = __builtin_ctz(L);
x = f(x, seg[(sz | l) >> k]);
l += L & (-L);
}
return x;
}
void update(int i, T x) {
int k = i + sz;
seg[k] = x;
for(k = k >> 1; k > 0; k >>= 1) { seg[k] = f(seg[k << 1], seg[(k << 1) | 1]); }
}
void add(int i, T x) {
int k = i + sz;
seg[k] = f(seg[k], x);
for(k = k >> 1; k > 0; k >>= 1) { seg[k] = f(seg[k << 1], seg[(k << 1) | 1]); }
}
T operator[](int k) const { return seg[sz + k]; }
};
template <const int sz = 5 * 10000000, typename T = long long> struct IO {
char reader[sz], writer[sz];
char *now, *now2 = writer;
IO() {
reader[fread(reader, sizeof(char), sizeof(char) * sz, stdin)];
now = reader;
}
inline T read() {
while(*now && *now <= 32) now++;
if(*now == '-') {
now++;
T res = 0;
while('0' <= *now and *now <= '9') { res = res * 10 + *now++ - '0'; }
return -res;
} else {
T res = 0;
while('0' <= *now and *now <= '9') { res = res * 10 + *now++ - '0'; }
return res;
}
}
inline string read_str() {
string res;
while(*now and *now != '\n' and *now != ' ') res += *now++;
now++;
return res;
}
inline void write(T x, char margin = ' ') {
if(x == 0) {
putchar('0');
putchar(margin);
return;
}
if(x < 0) {
putchar('-');
x = -x;
}
while(x) {
*now2 = '0' + x % 10;
now2++;
x /= 10;
}
do {
now2--;
putchar(*now2);
} while(now2 != writer);
putchar(margin);
}
inline void write_str(string s, char margin = ' ') {
for(auto c : s) putchar(c);
putchar(margin);
}
};
IO io;
main() {
int n = io.read(), q = io.read();
vll a(n);
rep(i, n) a[i] = io.read();
tree g(n);
rep(i, n - 1) {
int x = io.read() - 1, y = io.read() - 1;
g[x].eb(y), g[y].eb(x);
}
HLDecomposition hld(g);
auto b = hld.build(a);
SegmentTree<ll> seg(
b, [](ll x, ll y) { return x ^ y; }, 0LL);
while(q--) {
int id = io.read();
if(id == 2) {
int x = io.read() - 1, y = io.read();
io.write(seg.query(hld.in[x], hld.out[x]), '\n');
} else {
int x = io.read() - 1, a = io.read();
seg.update(hld.in[x], a ^ seg[hld.in[x]]);
}
}
}