# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
824354 | boyliguanhan | Digital Circuit (IOI22_circuit) | C++17 | 2172 ms | 2097152 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;
long long tm = 1, l[80100], r[80100], v[80100], cont[80100], lz[80100], mod = 1000002022, st[20100], nn, deg[20100], Cont[10010];
set<int> nansc[20100];
void pd(int n) {
if(lz[n]){
v[n]=cont[n]-v[n];
lz[n]=0;
if(l[n]!=r[n])
lz[n*2]^=1,lz[n*2+1]^=1;
}
}
void build(int i, int L, int R) {
l[i] = L;
r[i] = R;
if(L==R) {
cont[i] = Cont[L];
v[i] = st[L]*cont[i];
} else {
build(i*2,L,L+R>>1);
build(i*2+1,L+R+2>>1, R);
cont[i] = cont[i*2]+cont[i*2+1];
v[i] = v[i*2]+v[i*2+1];
}
}
void update(int i, int tl, int tr) {
if(tl<=l[i]&&r[i]<=tr)
lz[i]^=1, tr=-1;
pd(i);
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... |