제출 #1185324

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1185324		anmattroi	디지털 회로 (IOI22_circuit)	C++17	18 / 100	6 ms	1260 KiB

circuit

#include "circuit.h"
#include <bits/stdc++.h>
#define maxn 1005
#define fi first
#define se second
using namespace std;
using ii = pair<int, int>;

constexpr int mod = 1'000'002'022;

inline constexpr void add(int &x, const int &y) {x += y; if (x >= mod) x -= mod;}

int a[maxn], n, m;
vector<int> adj[maxn];
int dp[maxn+maxn][2], f[maxn], c[maxn];
ii lis[maxn];

void pfs(int u) {
    if (u >= n) {
        c[u] = 0;
        return;
    }
    c[u] = 1;
    for (int v : adj[u]) {
        pfs(v);
        if (v < n) c[u] = 1LL * c[u] * c[v] % mod;
    }
    c[u] = 1LL * c[u] * int(adj[u].size()) % mod;
}

void init(int N, int M, vector<int> P, vector<int> A) {
    for (int i = 1; i < N+M; i++) adj[P[i]].emplace_back(i);
    for (int i = 0; i < M; i++) a[i+1] = A[i];
    n = N;
    m = M;
    pfs(0);
}

void dfs(int u) {
    if (u >= n) {
        dp[u][a[u-n+1]] = 1;
        dp[u][1-a[u-n+1]] = 0;
        return;
    }
    for (int v : adj[u]) {
        dfs(v);
    }
    int sz = 0;
    for (int v : adj[u]) {
        lis[++sz] = ii{dp[v][0], dp[v][1]};
    }
    for (int i = 0; i <= sz; i++) f[i] = 0;
    f[0] = 1;
    for (int i = 1; i <= sz; i++) {
        for (int j = sz; j >= 1; j--)
            f[j] = (1LL * f[j] * lis[i].fi + 1LL * f[j-1] * lis[i].se) % mod;
        f[0] = 1LL * f[0] * lis[i].fi % mod;
    }
    int sum = 0;
    dp[u][0] = dp[u][1] = 0;
    for (int i = sz; i >= 1; i--) {
        add(sum, f[i]);
        add(dp[u][1], sum);
    }
    dp[u][0] = (c[u]-dp[u][1]+mod)%mod;
}

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

• 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