Submission #1064329

#	Time	Username	Problem	Language	Result	Execution time	Memory
1064329		MarwenElarbi	Digital Circuit (IOI22_circuit)	C++17	2 / 100	7 ms	2136 KiB

circuit

#include <bits/stdc++.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];
int n;
int m;
void init(int N, int M, std::vector<int> P, std::vector<int> A){
  n=N;m=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 < m; ++i)
  {
    if(L-n<=i&&i<=R-n) tab[i]^=1;
    ans+=tab[i];
  }
  return ans;
}

• Subtask 1: 2 / 2
• Subtask 2: 0 / 7
• Subtask 3: 0 / 9
• Subtask 4: 0 / 4
• Subtask 5: 0 / 12
• Subtask 6: 0 / 27
• Subtask 7: 0 / 28
• Subtask 8: 0 / 11