제출 #915219

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
915219		Namkhing	디지털 회로 (IOI22_circuit)	C++17	0 / 100	371 ms	3400 KiB

circuit

#include "circuit.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int Max = 2e5 + 1;
const int Mod = 1e9 + 2022;
ll n, m, dp[Max][2];

void build(int node, int left, int right, vector<int>& A) {
    if (left == right) {
        dp[node][A[left]] = 1;
        return;
    }

    int mid = (left + right) / 2;

    int l = node * 2 + 1;
    int r = node * 2 + 2;

    build(l, left, mid, A);
    build(r, mid + 1, right, A);

    dp[node][0] = dp[l][1] * dp[r][0] % Mod + dp[l][0] * dp[r][1] % Mod + dp[l][0] * dp[r][0] % Mod;
    dp[node][1] = dp[l][1] * dp[r][0] % Mod + dp[l][0] * dp[r][1] % Mod + 2 * dp[l][1] * dp[r][1] % Mod;

    dp[node][0] %= Mod;
    dp[node][1] %= Mod;
}

void update(int node, int left, int right, int idx) {
    if (left > idx || right < idx) return;
    if (left == idx && right == idx) {
        swap(dp[node][0], dp[node][1]);
        return;
    }

    int mid = (left + right) / 2;

    int l = node * 2 + 1;
    int r = node * 2 + 2;

    update(l, left, mid, idx);
    update(r, mid + 1, right, idx);

    dp[node][0] = dp[l][1] * dp[r][0] % Mod + dp[l][0] * dp[r][1] % Mod + 2 * dp[l][0] * dp[r][0] % Mod;
    dp[node][1] = dp[l][1] * dp[r][0] % Mod + dp[l][0] * dp[r][1] % Mod + 2 * dp[l][1] * dp[r][1] % Mod;

    dp[node][0] %= Mod;
    dp[node][1] %= Mod;
}

void init(int N, int M, vector<int> P, vector<int> A) {
    n = N, m = M;
    build(0, 0, M - 1, A);
}

int count_ways(int L, int R) {
    update(0, 0, m - 1, L - n);
    return dp[0][1]; 
}

• Subtask 1: 0 / 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