# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
627394 | Elegia | Digital Circuit (IOI22_circuit) | C++17 | 1238 ms | 14896 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 "circuit.h"
#include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using ull = unsigned long long;
const int MOD = 1000002022;
int N, M;
std::vector<int> val;
std::vector<int> S0, S1, tag;
void update(int o) {
S0[o] = (S0[o << 1] + S0[o << 1 | 1]) % MOD;
S1[o] = (S1[o << 1] + S1[o << 1 | 1]) % MOD;
}
void apply(int o) {
tag[o] ^= 1;
std::swap(S0[o], S1[o]);
}
void push(int o) {
if (tag[o]) {
apply(o << 1); apply(o << 1 | 1);
tag[o] = 0;
}
}
# | 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... |