Submission #767382

#	Time	Username	Problem	Language	Result	Execution time	Memory
767382		t6twotwo	디지털 회로 (IOI22_circuit)	C++17	18 / 100	3019 ms	3928 KiB

circuit

#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int mod = 1000002022;
int add(int x, int y) {
    int z = x + y;
    if (z >= mod) {
        z -= mod;
    }
    return z;
}
int sub(int x, int y) {
    int z = x - y;
    if (z < 0) {
        z += mod;
    }
    return z;
}
int mul(int x, int y) {
    return (ll)x * y % mod;
}
int N, M;
vector<int> P, A;
void init(int n, int m, vector<int> p, vector<int> a) {
    N = n, M = m;
    P = p, A = a;
}
int count_ways(int L, int R) {
    vector dp(N, vector{1});
    vector<int> on(N + M), off(N + M), tot(N + M, 1);
    for (int i = L; i <= R; i++) {
        A[i - N] ^= 1;
    }
    for (int i = N + M - 1; i >= 0; i--) {
        if (i >= N) {
            on[i] = A[i - N];
            off[i] = tot[i] - on[i];
        } else {
            int sum = 0;
            for (int j = dp[i].size() - 1; j; j--) {
                sum = add(sum, dp[i][j]);
                on[i] = add(on[i], sum);
            }
            tot[i] = mul(tot[i], (int)dp[i].size() - 1);
            off[i] = sub(tot[i], on[i]);
        }
        if (i) {
            int K = dp[P[i]].size();
            dp[P[i]].resize(K + 1);
            for (int j = K; j; j--) {
                dp[P[i]][j] = add(mul(dp[P[i]][j], off[i]), mul(dp[P[i]][j - 1], on[i]));
            }
            dp[P[i]][0] = mul(dp[P[i]][0], off[i]);
            tot[P[i]] = mul(tot[P[i]], tot[i]);
        }
    }
    return on[0];
}

• 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