Submission #1227136

#	Time	Username	Problem	Language	Result	Execution time	Memory
1227136		brinton	Digital Circuit (IOI22_circuit)	C++20	2 / 100	2668 ms	3868 KiB

circuit

#include "circuit.h"

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



vector<vector<int>> child;
vector<long long> tot;
vector<long long> mul;
int N,M;
vector<int> A;
void init(int iN, int iM, vector<int> P, vector<int> iA) {
  N = iN,M = iM;
  A = iA;
  child.resize(N);
  for(int i = 1;i < P.size();i++){
    child[P[i]].push_back(i);
  }

  tot = vector<long long>(N+M,1);
  for(int i = N-1;i >= 0;i--){
    tot[i] = child[i].size();
    for(auto c:child[i]){
      tot[i] = tot[i]*tot[c]%MOD;
    }
  }

  mul.resize(M);
  function<void(int,long long)> dfs = [&](int cur,long long cval){
    if(cur >= N){
      mul[cur-N] = cval;
      return;
    }
    vector<long long> suf;
    for(auto nxt:child[cur]){
      suf.push_back(tot[nxt]);
    }
    for(int i = suf.size()-2;i >= 0;i--) suf[i] = suf[i]*suf[i+1]%MOD;
    long long pref = 1;
    for(int i = 0;i < child[cur].size();i++){
      int nxt = child[cur][i];
      if(i+1 < child[cur].size()) dfs(nxt,cval*pref%MOD*suf[i+1]%MOD);
      else dfs(nxt,cval*pref%MOD);
      pref = pref*tot[nxt]%MOD;
    }
  };
  dfs(0,1LL);
  // for(auto &i:mul) cout << i << " ";cout << endl;
}

int count_ways(int L, int R) {
  L -= N, R -= N;
  for(int i = L;i <= R;i++){
    A[i] = 1-A[i];
  }
  long long ans = 0;
  for(int i = 0;i < M;i++){
    ans = ans+(A[i]*mul[i])%MOD;
  }
  return ans;
}
/*
62: precalculate size, multiply it, range flip
*/

• 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