// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
#ifndef DEBUG
#define cerr if (0) cerr
#endif
const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 400005;
const int MAXD = 41;
int n, l;
vii adj[MAXN];
int h[MAXN];
int q;
int m;
int pw[MAXN];
ii p[MAXN];
int pre[MAXN], pst[MAXN], ptr = 1;
void dfs(int u) {
REP (i, 0, adj[u].size()) {
if (adj[u][i].FI == p[u].FI) {
swap(adj[u][i], adj[u][SZ(adj[u]) - 1]);
break;
}
}
pre[u] = ptr;
for (auto &[v, id] : adj[u]) {
if (v == p[u].FI) continue;
id = ptr++;
p[v] = {u, id};
}
pst[u] = ptr;
for (auto [v, id] : adj[u]) {
if (v == p[u].FI) continue;
dfs(v);
}
}
void fwincre(int i, int x, int *fw) {
for (; i <= MAXD; i += i & -i) fw[i] = fw[i] + x;
}
int fwqry(int i, int *fw) {
int res = 0;
for (; i > 0; i -= i & -i) res = res + fw[i];
return res;
}
int st[MAXN * 4][MAXD + 1];
void incre(int p, int l, int x) {
int u = p + m;
while (u) {
fwincre(l, x, st[u]);
u >>= 1;
}
}
int qry(int s, int e, int l) {
int a = s + m, b = e + m;
int res = 0;
while (a < b) {
if (a & 1) {
res = res + fwqry(l, st[a]);
a++;
}
if (b & 1) {
b--;
res = res + fwqry(l, st[b]);
}
a >>= 1; b >>= 1;
}
return res;
}
int main() {
#ifndef DEBUG
ios::sync_with_stdio(0), cin.tie(0);
#endif
cin >> n >> l;
REP (i, 1, n) {
int a, b; cin >> a >> b;
adj[a].pb({b, 0});
adj[b].pb({a, 0});
}
pw[0] = 1;
REP (i, 1, MAXN) {
pw[i] = pw[i - 1] * 2ll % l;
}
int on = n;
REP (i, 2, n + 1) {
if (adj[i].size() == 1) {
adj[i].pb({++on, 0});
adj[on].pb({i, 0});
}
}
dfs(1);
m = 1;
while (m < ptr) {
m <<= 1;
}
REP (i, 0, MAXN * 4) {
REP (j, 0, MAXD + 1) {
st[i][j] = 0;
}
}
REP (i, 1, n + 1) {
cin >> h[i];
}
cin >> q;
while (q--) {
int t; cin >> t;
if (t == 1) {
int x, d, w; cin >> x >> d >> w;
int u = x;
REP (i, MAXD - d + 1, MAXD + 1) {
if (p[u].FI == 0) break;
int id = p[u].SE;
u = p[u].FI;
incre(id, i, 1);
}
u = x;
REP (i, MAXD - d, MAXD + 1) {
if (adj[u][0].FI == p[u].FI) break;
int id = adj[u][0].SE;
u = adj[u][0].FI;
incre(id, i, 1);
}
} else {
int x; cin >> x;
int ans = 0;
ans = ans + qry(pre[x], pst[x], MAXD);
int u = x;
RREP (i, MAXD - 1, 1) {
if (p[u].FI == 0) break;
int id = p[u].SE;
u = p[u].FI;
ans = ans + qry(pre[u], id, i);
ans = ans + qry(id + 1, pst[u], i);
}
//cerr << ans << '\n';
cout << (ll) h[x] * pw[ans] % l << '\n';
}
}
return 0;
}
/*
6 10
5 6
1 2
1 4
2 6
3 6
9
2
3
4
9
1
100
1 4 1 9
2 1
*/
Compilation message
sprinkler.cpp: In function 'void dfs(int)':
sprinkler.cpp:16:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
16 | #define REP(i, s, e) for (int i = s; i < e; i++)
......
52 | REP (i, 0, adj[u].size()) {
| ~~~~~~~~~~~~~~~~~~~
sprinkler.cpp:52:5: note: in expansion of macro 'REP'
52 | REP (i, 0, adj[u].size()) {
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
119 ms |
274268 KB |
Output is correct |
| 2 |
Incorrect |
106 ms |
274332 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
105 ms |
274280 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
105 ms |
274280 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
106 ms |
274380 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
107 ms |
274276 KB |
Output is correct |
| 2 |
Correct |
1523 ms |
294156 KB |
Output is correct |
| 3 |
Execution timed out |
4057 ms |
289784 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
119 ms |
274268 KB |
Output is correct |
| 2 |
Incorrect |
106 ms |
274332 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
