Submission #1057809

#	Time	Username	Problem	Language	Result	Execution time	Memory
1057809		aykhn	Digital Circuit (IOI22_circuit)	C++17	2 / 100	3040 ms	8404 KiB

circuit

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

using namespace std;

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

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

void dfs(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])
  {
    dfs(v);
    for (int i = sz; i >= 0; i--)
    {
      dp1[i] = (dp1[i] * dp[0][v]) % mod;
      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]);
    dp[1][a] = (dp[1][a] +  i * dp1[i]);
  }
}

void init(int N, int M, vector<int> P, vector<int> AA) 
{
  A = AA;
  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);
}

int count_ways(int L, int R) {
  for (int i = L; i <= R; i++) A[i] ^= 1;
  dfs(0);
  return dp[1][0];
}

• 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