| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 964045 | LucaLucaM | Sprinkler (JOI22_sprinkler) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <queue>
#warning That's not AS, that's my AS
typedef long long ll;
const int NMAX = 2e5;
int L;
struct Node {
int value, lazy;
};
struct segtree {
std::vector<Node> aint;
std::vector<int> brute;
int n;
segtree() {}
segtree(int _n) {
n = 1;
while (n <= _n) {
n <<= 1;
}
n <<= 1;
n |= 1;
aint.resize(n);
for (int i = 0; i < n; i++) {
aint[i] = {1, 1};
}
n = _n;
brute.resize(n + 1, 1);
}
void push(int node, int tl, int tr) {
if (aint[node].lazy != 1) {
aint[node].value = (ll) aint[node].value * aint[node].lazy % L;
if (tl != tr) {
aint[2 * node].lazy = (ll) aint[node].lazy * aint[2 * node].lazy % L;
aint[2 * node + 1].lazy = (ll) aint[node].lazy * aint[2 * node + 1].lazy % L;
}
aint[node].lazy = 1;
}
}
void upd(int node, int tl, int tr, int l, int r, int v) {
assert(1 <= tl && tl <= tr && tr <= n);
push(node, tl, tr);
if (l <= tl && tr <= r) {
aint[node].lazy = v;
} else {
int mid = (tl + tr) / 2;
if (l <= mid) {
upd(2 * node, tl, mid, l, r, v);
}
if (mid < r) {
upd(2 * node + 1, mid + 1, tr, l, r, v);
}
push(2 * node, tl, mid);
push(2 * node + 1, mid + 1, tr);
aint[node].value = (ll) aint[2 * node].value * aint[2 * node + 1].value;
}
}
int qry(int node, int tl, int tr, int p) {
push(node, tl, tr);
if (tl == tr) {
return aint[node].value;
} else {
int mid = (tl + tr) / 2;
if (p <= mid) {
return qry(2 * node, tl, mid, p);
}
return qry(2 * node + 1, mid + 1, tr, p);
}
}
void bruteUpdate(int l, int r, int v) {
for (int i = l; i <= r; i++) {
brute[i] = (ll) brute[i] * v % L;
}
}
int bruteQuery(int p) {
return brute[p];
}
void update(int l, int r, int v) {
// bruteUpdate(l, r, v);
upd(1, 1, n, l, r, v);
}
int query(int p) {
// return bruteQuery(p);
return qry(1, 1, n, p);
}
};
std::vector<int> g[NMAX + 1];
int parent[NMAX + 1];
int time[NMAX + 1];
int timer;
void bfs() {
std::queue<int> q;
q.push(1);
while (!q.empty()) {
int u = q.front();
q.pop();
time[u] = ++timer;
std::vector<int> newG;
for (const auto &v : g[u]) {
if (!time[v]) {
parent[v] = u;
newG.push_back(v);
q.push(v);
}
}
g[u] = newG;
}
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
int n;
std::cin >> n >> L;
for (int i = 1; i < n; i++) {
int u, v;
std::cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
bfs();
// std::cout << " > ";
// for (int i = 1; i <= n; i++) {
// std::cout << time[i] << ' ';
// }
// std::cout << '\n';
segtree aint(2 * n + 1);
for (int i = 1; i <= n; i++) {
int h;
std::cin >> h;
aint.update(time[i], time[i], h);
}
int q;
std::cin >> q;
while (q--) {
int type;
std::cin >> type;
if (type == 1) {
int u, d, h;
std::cin >> u >> d >> h;
assert(d <= 1);
aint.update(time[u], time[u], h);
if (d == 1) {
if (!g[u].empty()) {
int l = time[g[u][0]];
int r = time[g[u].back()];
aint.update(l, r, h);
}
if (u != 1) {
int v = parent[u];
aint.update(time[v], time[v], h);
}
}
} else {
int u;
std::cin >> u;
std::cout << aint.query(time[u]) << '\n';
}
}
return 0;
}