제출 #653112

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

circuit

#include "circuit.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxn = 2010;
const int mod = 1000002022;
int n, m, p[maxn], a[maxn];
vector<int> g[maxn];
int dp[maxn][2]; // dp[u][flag] = #ways I can be flag

void sol(int u) {
    if(u >= n) {
        dp[u][0] = dp[u][1] = 0;
        dp[u][a[u-n]] = 1;
        // cout << u << " " <<  dp[u][0] << " " << dp[u][1] << endl;
        return;
    }
    vector<int> qtd; // qtd[x] = # Ways I can have exactly x on
    for(int i = 0; i <= (int) g[u].size(); i++) {
        qtd.pb(0);
    }
    qtd[0] = 1;
    for(auto v : g[u]) {
        sol(v);
        for(int i = (int) g[u].size(); i >= 0; i--) {
            qtd[i] = qtd[i]*dp[v][0]+(i == 0 ? 0 : qtd[i-1])*dp[v][1];
            qtd[i]%= mod;
        }
    }

    dp[u][0] = dp[u][1] = 0;
    for(int i = 0; i <= (int) g[u].size(); i++) {
        dp[u][0]+= qtd[i]*((int) g[u].size() - i); dp[u][0]%= mod;
        dp[u][1]+= qtd[i]*i; dp[u][1]%= mod;
    }
    // cout << u << " " <<  dp[u][0] << " " << dp[u][1] << endl;

}

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

int32_t count_ways(int32_t L, int32_t R) {
    for(int i = L; i <= R; i++) a[i-n]^=1;
    sol(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