Submission #633053

#	Time	Username	Problem	Language	Result	Execution time	Memory
633053		tutis	Digital Circuit (IOI22_circuit)	C++17	34 / 100	3046 ms	16060 KiB

circuit

#include "circuit.h"
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000002022;
vector<pair<ll, ll>>a;

vector<int>P;
vector<int>A;
vector<vector<int>>c;
int N, M;
vector<bool> F(200009, false);
vector<int> L, R;
void calc(int i)
{
    int d = c[i].size();
    vector<ll> k(d + 2, 0ll);
    ll v = 1;
    a[i] = {0ll, 0ll};
    for (int j : c[i])
    {
        int v0 = a[j].first;
        int v1 = a[j].second;
        if (F[j])
            swap(v0, v1);
        ll a1_ = 0;
        ll a0_ = 0;
        a1_ = a[i].second * (v0 + v1) + v * v1;
        a0_ = a[i].first * (v0 + v1) + v * v0;
        a[i].first = a0_;
        a[i].second = a1_;
        v *= (v0 + v1);
        a[i].first %= mod;
        a[i].second %= mod;
        v %= mod;
    }
}
void init(int N_, int M_, vector<int> P_, vector<int> A_) {
    P = P_;
    A = A_;
    N = N_;
    M = M_;
    a = vector<pair<ll, ll>>(N + M);
    c = vector<vector<int>>(N + M);
    L = vector<int>(N + M);
    R = vector<int>(N + M);
    for (int i = 1; i < N + M; i++)
        c[P[i]].push_back(i);
    for (int i = N + M - 1; i >= N; i--)
    {
        if (A[i - N] == 1)
            a[i] = {0, 1};
        else
            a[i] = {1, 0};
        L[i] = R[i] = i;
    }
    for (int i = N - 1; i >= 0; i--)
    {
        calc(i);
        L[i] = N + M + 5;
        R[i] = -1;
        for (int j : c[i])
        {
            L[i] = min(L[i], L[j]);
            R[i] = max(R[i], R[j]);
        }
    }
}

void count_ways(int X)
{
    function<void(int)>f = [&](int i)->void
    {
        if (R[i] < X)
            return;
        if (X <= L[i])
        {
            F[i] = F[i] ^ true;
        }
        else
        {
            for (int j : c[i])
            {
                F[j] = F[j] ^ F[i];
                f(j);
            }
            calc(i);
            F[i] = false;
        }
    };
    f(0);
}
int count_ways(int X, int Y) {
    count_ways(X);
    count_ways(Y + 1);
    if (F[0])
        return (int)a[0].first;
    return (int)a[0].second;
}

• Subtask 1: 2 / 2
• Subtask 2: 7 / 7
• Subtask 3: 9 / 9
• Subtask 4: 4 / 4
• Subtask 5: 12 / 12
• Subtask 6: 0 / 27
• Subtask 7: 0 / 28
• Subtask 8: 0 / 11