Submission #1108330

#	Time	Username	Problem	Language	Result	Execution time	Memory
1108330		LucaLucaM	Digital Circuit (IOI22_circuit)	C++17	0 / 100	3065 ms	1616 KiB

circuit

#ifdef LOCAL
#include "grader.h"
#else
#include "circuit.h"
#endif
#include <vector>

using ll = long long;

const int NMAX = 2e5;
const int mod = 1e9 + 2022;

int depth[NMAX];
int p2[NMAX];
std::vector<int> a;
int n, m;

void init(int N, int M, std::vector<int> parent, std::vector<int> A) {
  n = N;
  m = M;
  a = A;
  p2[0] = 1;
  for (int i = 1; i <= n + m; i++) {
    p2[i] = p2[i - 1] * 2 % mod;
  }
  for (int i = 1; i < n + m; i++) {
    depth[i] = 1 + depth[parent[i]];
  }
} 

int count_ways(int L, int R) {
  L -= n, R -= n;
  for (int i = L; i <= R; i++) {
    a[i] ^= 1;
  }
  ll answer = 0;
  for (int i = 0; i < m; i++) {
    if (a[i]) {
      answer += p2[depth[i + n]];
    }
  }
  return answer % mod;
}

• 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