Submission #970997

#	Time	Username	Problem	Language	Result	Execution time	Memory
970997		ALeonidou	Digital Circuit (IOI22_circuit)	C++17	2 / 100	2549 ms	1600 KiB

circuit

#include "circuit.h"
#include <vector>
#include <iostream>
using namespace std;

#define ll int
#define F first
#define S second
#define pb push_back
#define sz(x) (ll)x.size()
#define endl "\n"

typedef vector <ll> vi;
typedef pair <ll, ll> ii;
typedef vector <ii> vii;
  
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;
  
void printVct(vi &v){
    for (ll i =0; i<sz(v); i++){
      cout<<v[i]<<" ";
    }
    cout<<endl;
}

ll n,m;
vi p,a;
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
    n= N, m = M;
    p = P;
    a = A;
}

int count_ways(int L, int R) {
    ll l = L-n, r = R-n;
    ll curOn = 0;
    for (ll i =0; i<m; i++){
        if (i >= l && i <= r){
            a[i] = !a[i];
        }
        if (a[i]) curOn++;
    }
    return curOn;
}

/*
3 4 3
-1 0 1 2 1 1 0 1 0 1 0
3 4
4 5
3 6


*/

• 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