Submission #1231635

#	Time	Username	Problem	Language	Result	Execution time	Memory
1231635		santi3223	Digital Circuit (IOI22_circuit)	C++20	2 / 100	1518 ms	1564 KiB

circuit

#include <bits/stdc++.h>
#include "circuit.h"
using namespace std;
#define ll long long
#define vb vector<bool>
#define pb push_back
#define ff(aa, bb, cc) for(ll aa = bb; aa < cc; aa++)
#define vl vector<ll>
#define pll pair<ll, ll>
#define fi first
#define se second
#define ed "\n"
#define all(aaa) aaa.begin(), aaa.end()
#define rall(aaa) aaa.rbegin(), aaa.rend()
ll MOD = 1e9+7;

ll n, m;
vl a;

void init(int N, int M, vector<int> P, vector<int> A){
	n = N;
	m = M;
	ff(i, 0, m){
		a.pb(A[i]);
	}
}

int count_ways(int l, int r){
	l -= n;
	r -= n;
	ll ans = 0;
	ff(i, 0, m){
		if(l <= i && i <= r){
			a[i] = (a[i]+1)%2;
		}
		ans += a[i];
	}
	return ans;
}
/*
int main() {
  int N, M, Q;
  assert(3 == scanf("%d %d %d", &N, &M, &Q));
  std::vector<int> P(N + M), A(M);
  for (int i = 0; i < N + M; ++i) {
    assert(1 == scanf("%d", &P[i]));
  }
  for (int j = 0; j < M; ++j) {
    assert(1 == scanf("%d", &A[j]));
  }
  init(N, M, P, A);

  for (int i = 0; i < Q; ++i) {
    int L, R;
    assert(2 == scanf("%d %d", &L, &R));
    printf("%d\n", count_ways(L, R));
  }
  return 0;
}
*/

• 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