# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
627720 | dqhungdl | Digital Circuit (IOI22_circuit) | C++17 | 1156 ms | 52320 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 <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 5, MOD = 1e9 + 2022;
int N;
long long C[MAX], f[MAX];
vector<int> g[MAX];
struct SegmentTree {
int n;
vector<vector<long long>> tree;
vector<int> lazy;
SegmentTree() {}
SegmentTree(vector<vector<long long>> &V) {
n = V.size();
tree.resize(4 * n + 5, {0, 0});
lazy.resize(4 * n + 5);
init(1, 0, n - 1, V);
}
void init(int k, int l, int r, vector<vector<long long>> &V) {
if (l == r) {
tree[k] = V[l];
return;
}
int mid = (l + r) / 2;
init(2 * k, l, mid, V);
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... |