# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1125272 | nguyenkhangninh99 | Sprinkler (JOI22_sprinkler) | C++20 | 4094 ms | 79368 KiB |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
const int maxn = 2e5 + 69;
vector<array<int, 4>> query;
vector<int> g[maxn], c[maxn];
int mod;
int h[maxn];
int tin[maxn], out[maxn], depth[maxn], par[maxn], timeDfs = 0;
struct SegmentTree{
vector<long long> st, lazy;
void init(long long sz){
st.assign(4 * sz + 1, 1LL);
lazy.assign(4 * sz + 1, 1LL);
}
void down(int id){
long long &x = lazy[id];
st[id << 1] = st[id << 1] * x % mod;
st[id << 1 | 1] = st[id << 1 | 1] * x % mod;
lazy[id << 1] = lazy[id << 1] * x % mod;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |