Submission #831540

#	Time	Username	Problem	Language	Result	Execution time	Memory
831540		NeroZein	Digital Circuit (IOI22_circuit)	C++17	18 / 100	75 ms	8448 KiB

circuit

#include "circuit.h"
#include "bits/stdc++.h"

using namespace std;

const int MAX_N = 2003;
const int md = 1000002022;

inline int add(int x, int y) {
  x += y;
  if (x >= md) x -= md;
  return x;
}

inline int mul(int x, int y) {
  return (int) ((long long) x * y % md); 
}

int n, m;
int win[MAX_N];
int lose[MAX_N];
vector<int> a;
vector<int> g[MAX_N];

int dp[MAX_N][MAX_N]; 
vector<array<int, 2>> dps;
int knapsack(int ind, int k) {
  if (ind == (int) dps.size()) {
    return k == 0;
  }
  if (k < 0) {
    return 0;
  }
  int& ret = dp[ind][k];
  if (ret != -1) {
    return ret;
  }
  ret = add(mul(knapsack(ind + 1, k), dps[ind][0]), mul(knapsack(ind + 1, k - 1), dps[ind][1]));
  return ret;
}

void dfs(int v) {
  if (v >= n) {
    lose[v] = (a[v - n] == 0);
    win[v] = (a[v - n] == 1);
    return; 
  }
  for (int u : g[v]) {
    dfs(u); 
  }
  for (int u : g[v]) {
    dps.push_back({lose[u], win[u]});
  }
  int ch_num = g[v].size(); 
  for (int i = 0; i < ch_num; ++i) {
    for (int j = 0; j <= ch_num; ++j) {
      dp[i][j] = -1;
    }
  }
  for (int k = 0; k <= ch_num; ++k) {
    int x = knapsack(0, k); 
    win[v] = add(win[v], mul(k, x));
    lose[v] = add(lose[v], mul((ch_num - k), x));
  }
  dps.clear(); 
}

void init(int N, int M, std::vector<int> P, std::vector<int> A) {
  for (int i = 1; i < N + M; ++i) {
    g[P[i]].push_back(i); 
  }
  n = N; 
  m = M;
  a = A;
}

int count_ways(int L, int R) {
  for (int i = L; i <= R; ++i) {
    a[i - n] ^= 1; 
  }
  fill(win, win + n, 0);
  fill(lose, lose + n, 0); 
  dfs(0);
  return win[0];
}

• Subtask 1: 2 / 2
• Subtask 2: 7 / 7
• Subtask 3: 9 / 9
• Subtask 4: 0 / 4
• Subtask 5: 0 / 12
• Subtask 6: 0 / 27
• Subtask 7: 0 / 28
• Subtask 8: 0 / 11