# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1064280 | 2024-08-18T11:10:25 Z | MarwenElarbi | Digital Circuit (IOI22_circuit) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "circuit.h" using namespace std; #define pb push_back #define ll long long #define fi first #define se second const int nax=2e3+5; const int MOD=1e9+2022; int tab[nax]; void init(int N, int M, std::vector<int> P, std::vector<int> A){ int n=m; for (int i = 0; i < M; ++i) { tab[i]=A[i]; } return; } int count_ways(int L, int R) { int ans=0; for (int i = 0; i < n; ++i) { if(L<=i&&i<=R) tab[i]^=1; ans+=tab[i]; } return ans; }