# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
631800 | 4123xr4323 | Digital Circuit (IOI22_circuit) | C++17 | 1036 ms | 13548 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 <bits/stdc++.h>
#define mp make_pair
#define all(a) a.begin(),a.end()
using namespace std;
using pii = pair <long long, long long>;
constexpr int maxn = 1e5 + 10;
constexpr int mod = 1000002022;
constexpr long long inf = 1e17 + 10;
vector <int> graph [maxn];
long long sub_size [maxn], ans [maxn];
long long x [maxn], tree [maxn << 2], S [maxn << 2];
bool R [maxn << 2];
int n, m;
inline void build (int v, int t_l, int t_r) {
if (t_l == t_r) {
S[v] = ans[t_l];
return;
}
int t_m = t_l + t_r >> 1;
build (v << 1, t_l, t_m);
build (v << 1 | 1, t_m + 1, t_r);
S[v] = (S[v << 1] + S[v << 1 | 1]) % mod;
}
inline void push (int v, int t_l, int t_r) {
if (!R[v]) return;
tree[v] = (S[v] - tree[v] + mod) % mod;
if (t_l < t_r) {
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |