# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
910753 | 2024-01-18T07:50:38 Z | tnun | Digital Circuit (IOI22_circuit) | C++17 | 0 ms | 0 KB |
#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]; } }