Submission #796313

#	Time	Username	Problem	Language	Result	Execution time	Memory
796313		ln_e	Digital Circuit (IOI22_circuit)	C++17	2 / 100	8 ms	2000 KiB

circuit

#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
#include "circuit.h"
using ll=long long;
using ld=long double;
int const INF=1000000005;
ll const LINF=1000000000000000005;
ll const mod=1000000007;
ld const PI=3.14159265359;
ll const MAX_N=3e5+5;
ld const EPS=0.00000001;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define endl '\n'
#define sz(a) (int)a.size()
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int par[1005],state[1005],n,m;
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
n=N;
m=M;
for(ll i=0;i<n;i++)
{
  par[i]=P[i];
}
for(ll i=0;i<m;i++)
{
  state[i]=A[i];
}
return;
}
int count_ways(int L, int R) {
  ll l=L;
  ll r=R;
  l-=n;
  r-=n;
  for(ll i=l;i<=r;i++)
  {
    state[i]^=1;
  }
  int ans=0;
  for(ll i=0;i<m;i++){
    if(state[i]==1){
      ans++;
    }
  }
  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