Submission #1076676

#	Time	Username	Problem	Language	Result	Execution time	Memory
1076676		Boas	Digital Circuit (IOI22_circuit)	C++17	0 / 100	19 ms	4816 KiB

circuit

#include "circuit.h"

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define loop(x, i) for (int i = 0; i < x; i++)
#define rev(x, i) for (int i = (int)x - 1; i >= 0; i--)
#define ALL(x) begin(x), end(x)
#define sz(x) (int)x.size()

typedef array<int, 2> ii;
typedef vector<ii> vii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vi> vvi;

constexpr int MOD = 1'000'002'022;

vvi children;
int n, m;
vb a;

void init(int N, int M, vi P, vi A)
{
  n = N;
  m = M;
  children = vvi(N);
  a = vb(M);
  loop(sz(P), i)
  {
    if (i == 0)
      continue;
    children[P[i]].pb(i);
  }
  loop(sz(A), i)
  {
    a[i] = A[i];
  }
}

ii calc(int i)
{
  if (i >= n)
  {
    if (a[i - n])
      return {0, 1};
    return {1, 0};
  }
  vii vs;
  for (int j : children[i])
  {
    vs.pb(calc(j));
  }
  assert(vs.size() == 2);
  int mid = vs[0][0] * vs[1][1] + vs[0][1] * vs[1][0];
  int r0 = vs[0][0] * vs[1][0] + mid, r1 = vs[0][1] * vs[1][1] + mid;
  return {r0, r1};
}

int count_ways(int L, int R)
{
  for (int i = L; i <= R; i++)
  {
    a[i].flip();
  }
  return calc(0)[1];
}

• Subtask 1: 0 / 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