Submission #1057832

#	Time	Username	Problem	Language	Result	Execution time	Memory
1057832		aykhn	Digital Circuit (IOI22_circuit)	C++17	22 / 100	3051 ms	13904 KiB

circuit

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

using namespace std;

#define int long long

const int MXN = 2e5 + 5;
const int mod = 1e9 + 2022;

int n, m;
vector<int> A, P;
vector<int> adj[MXN];
int dp[2][MXN];

void calc(int a)
{
  dp[0][a] = dp[1][a] = 0;
  if (adj[a].empty())
  {
    dp[0][a] = A[a] ^ 1;
    dp[1][a] = A[a];
    return;
  }
  int sz = adj[a].size();
  vector<int> dp1(sz + 1, 0);
  dp1[0] = 1;
  for (int &v : adj[a])
  {
    for (int i = sz; i >= 0; i--)
    {
      dp1[i] = (dp1[i] * dp[0][v]) % mod;
      if (i) dp1[i] = (dp1[i] + ((dp1[i - 1] * dp[1][v]) % mod)) % mod;
    }
  }
  for (int i = 0; i <= sz; i++)
  {
    dp[0][a] = (dp[0][a] + (((sz - i) * dp1[i]) % mod)) % mod;
    dp[1][a] = (dp[1][a] +  ((i * dp1[i]) % mod)) % mod;
  }
}

void dfs(int a)
{
  for (int &v : adj[a])
  {
    dfs(v);
  }
  calc(a);
}

void init(int32_t N, int32_t M, vector<int32_t> PP, vector<int32_t> AA) 
{
  for (int32_t &i : PP) P.push_back(i);
  for (int32_t &i : AA) A.push_back(i);
  reverse(A.begin(), A.end());
  A.resize(N + M, 0);
  reverse(A.begin(), A.end());
  for (int i = 1; i < N + M; i++) adj[P[i]].push_back(i);
  dfs(0);
}

int32_t count_ways(int32_t L, int32_t R) {
  for (int i = L; i <= R; i++) A[i] ^= 1;
  if (L == R)
  {
    while (L != -1)
    {
      calc(L);
      L = P[L];
    }
  }
  else dfs(0);
  return dp[1][0];
}

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