Submission #1068889

#	Time	Username	Problem	Language	Result	Execution time	Memory
1068889		beaconmc	Digital Circuit (IOI22_circuit)	C++17	2 / 100	447 ms	8280 KiB

circuit

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

typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)

const ll maxn = 100005;

vector<ll> edges[maxn];
ll sub[maxn];
ll realsub[maxn];
ll par[maxn];



void dfs(ll a){
    if (edges[a].size()==0) sub[a] = 1;
    else sub[a] = 0;
    realsub[a] = 0;
    for (auto&i : edges[a]){
        dfs(i);
        sub[a] += sub[i];
        if (edges[i].size()!=0) realsub[a] += sub[i];
    }
}

ll cache[maxn];

ll dp(ll a){
    if (cache[a] != -1) return cache[a];
    if (a==0) return 1;
    if (edges[a].size()==0) cache[a] = dp(par[a]) * max((ll)1,(realsub[par[a]] - realsub[a])) % 1000002022;
    else cache[a] = dp(par[a]) * max((ll)1,(realsub[par[a]] - sub[a])) % 1000002022;
    return cache[a]% 1000002022;
}
ll states[maxn];

ll ans = 0;

void init(int N, int M, std::vector<int> P, std::vector<int> A) {
    FOR(i,0,maxn) cache[i] = -1;
    par[0] = -1;
    FOR(i,1,N+M){
        edges[P[i]].push_back(i);
        par[i] = P[i];
    }
    dfs(0);

    FOR(i,0,M){
        states[N+i] = A[i];
        if (A[i]==1) ans += dp(N+i);
        ans %= 1000002022;
    }



}

int count_ways(int L, int R) {

    FOR(i,L,R+1){
        if (states[i]==1){
            states[i] = 0;
            ans -= dp(i);
        }else{
            states[i] = 1;
            ans += dp(i);
        }
        ans %= 1000002022;
    }
    return (ans+1000002022)%1000002022;
}

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