# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
910760 | tnun | Digital Circuit (IOI22_circuit) | C++17 | 0 ms | 0 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>
using namespace std;
#define ll long long
#define pb push_back
int n,m,p[100060],a[100060];
int count_ways(int l,int r){
for(int i=l-1;i<r;i++){
a[i]=(a[i]+1)%2;
}
int cnt=0;
for(int i=0;i<m;i++){
if(a[i]==1){
cnt++;
}
}
return cnt;
}
void init(int N,int M, int P[],int A[]){
n=N;
m=M;
for(int i=0;i<N+M;i++){
p[i]=P[i];
}
for(int i=0;i<M;i++){
a[i]=A[i];
}
}