-
Notifications
You must be signed in to change notification settings - Fork 17
/
1137.cpp
92 lines (80 loc) · 3.02 KB
/
1137.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
#include <bits/stdc++.h>
using namespace std;
#define print_op(...) ostream& operator<<(ostream& out, const __VA_ARGS__& u)
template<typename A, typename B> print_op(pair<A, B>) { return out << "(" << u.first << ", " << u.second << ")"; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> print_op(T_container) { out << "{"; string sep; for (const T &x : u) out << sep << x, sep = ", "; return out << "}"; }
template<typename T> void dbg_out(string s, T x) {cerr << "\033[1;35m" << s << "\033[0;32m = \033[33m" << x << "\033[0m\n";}
template<typename T, typename... Args> void dbg_out(string s, T x, Args... args) {for (int i=0, b=0; i<(int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++; else
if (s[i] == ')' || s[i] == '}') b--; else if (s[i] == ',' && b == 0) {cerr << "\033[1;35m" << s.substr(0, i) << "\033[0;32m = \033[33m" << x << "\033[31m | "; dbg_out(s.substr(s.find_first_not_of(' ', i + 1)), args...); break;}}
#ifdef LOCAL
#define dbg(...) dbg_out(#__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(...)
#endif
#define ar array
#define ll long long
#define ld long double
#define sz(x) ((int)x.size())
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(a) (a).begin(), (a).end()
const int MAX_N = 2e5 + 5;
const int MAX_L = 20;
const int MAX_C = 26;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
template<typename T> struct FenwickTree {
int n; vector<T> ft;
void init(int _n) { n = _n; ft.resize(_n); }
void init(const vector<int> &a) { init(sz(a)); for (int i = 0; i < n; i++) update(i, a[i]); }
void update(int x, T v) { for (; x < n; x = x | (x + 1)) ft[x] += v; }
void update(int l, int r, T v) { update(l, v); update(r + 1, -v); }
T query(int x) {
T res = 0;
for (; x >= 0; x = (x & (x + 1)) - 1) res += ft[x];
return res;
}
T query(int l, int r) { return (l <= r) ? query(r) - query(l - 1) : 0; }
};
int n, q, ti = -1, tin[MAX_N], tout[MAX_N], a[MAX_N];
vector<int> adj[MAX_N];
void dfs(int u, int p = -1) {
tin[u] = ++ti;
for (int v : adj[u]) {
if (v == p) continue;
dfs(v, u);
}
tout[u] = ti;
}
void solve(int tc = 0) {
cin >> n >> q;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n - 1; i++) {
int u, v; cin >> u >> v; u--; v--;
adj[u].push_back(v);
adj[v].push_back(u);
}
dfs(0);
FenwickTree<ll> ft; ft.init(n);
for (int i = 0; i < n; i++) ft.update(tin[i], a[i]);
while (q--) {
int t; cin >> t;
if (t == 1) {
int u, x; cin >> u >> x; u--;
ft.update(tin[u], x - a[u]);
a[u] = x;
} else {
int u; cin >> u; u--;
cout << ft.query(tin[u], tout[u]) << "\n";
}
}
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int tc = 1;
// cin >> tc;
for (int t = 1; t <= tc; t++) {
// cout << "Case #" << t << ": ";
solve(t);
}
}