Submission #1070267

#	Time	Username	Problem	Language	Result	Execution time	Memory
1070267		Unforgettablepl	Digital Circuit (IOI22_circuit)	C++17	16 / 100	1056 ms	7864 KiB

circuit

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

const long long modulo = 1e9+2022;

namespace {
    int N,M;
    vector<vector<int>> adj;
    vector<int> A,P;
    vector<pair<long long,long long>> DPtree;
    vector<int> updated;
    vector<bool> switchGreedy;
    int Q;
}

void init(int N,int M,vector<int> P,vector<int> A){
    ::N = N;
    ::M = M;
    ::A = A;
    ::P = P;
    Q = 0;
    switchGreedy = vector<bool>(N+M);
    updated = vector<int>(N+M);
    DPtree = vector<pair<long long,long long>>(N);
    adj = vector<vector<int>>(N);
    for(int i=1;i<N+M;i++)adj[P[i]].emplace_back(i);
    function<pair<long long,long long>(int)> dfs = [&](int x)->pair<long long,long long>{
        if(x>=N) {
            return {A[x-N],1};
        }
        long long tot_ways = adj[x].size();
        vector<long long> DP(adj[x].size()+1);
        DP[0]=1;
        for(int&i:adj[x]) {
            auto temp = dfs(i);
            tot_ways*=temp.second;
            tot_ways%=modulo;
            long long bad_ways = (temp.second-temp.first+modulo)%modulo;
            for(int j=adj[x].size();j>=0;j--) {
                DP[j]*=bad_ways;
                DP[j]%=modulo;
                if(j)DP[j]+=temp.first*DP[j-1];
                DP[j]%=modulo;
            }
        }
        long long ans = 0;
        for(long long i=1;i<=adj[x].size();i++) {
            ans+=DP[i]*i;
            ans%=modulo;
        }
        DPtree[x]={ans,tot_ways};
        return {ans,tot_ways};
    };
    dfs(0);
}

int count_ways(int L,int R){
    Q++;
    function<pair<long long,long long>(int)> dfs = [&](int x)->pair<long long,long long>{
        if(x>=N) {
            if(switchGreedy[x])return {A[x-N]^1,1};
            return {A[x-N],1};
        }
        if(updated[x]<Q) {
            if(switchGreedy[x])return {(DPtree[x].second-DPtree[x].first+modulo)%modulo,DPtree[x].second};
            return DPtree[x];
        }
        long long tot_ways = adj[x].size();
        vector<long long> DP(adj[x].size()+1);
        DP[0]=1;
        for(int&i:adj[x]) {
            auto temp = dfs(i);
            tot_ways*=temp.second;
            tot_ways%=modulo;
            long long bad_ways = (temp.second-temp.first+modulo)%modulo;
            for(int j=adj[x].size();j>=0;j--) {
                DP[j]*=bad_ways;
                DP[j]%=modulo;
                if(j)DP[j]+=temp.first*DP[j-1];
                DP[j]%=modulo;
            }
        }
        long long ans = 0;
        for(long long i=1;i<=adj[x].size();i++) {
            ans+=DP[i]*i;
            ans%=modulo;
        }
        DPtree[x]={ans,tot_ways};
        if(switchGreedy[x])return {(tot_ways-ans+modulo)%modulo,tot_ways};
        return {ans,tot_ways};
    };
    function<void(int)> set_good = [&](int x) {
        switchGreedy[x]=!switchGreedy[x];
        x = P[x];
        while(x>=0) {
            updated[x]=Q;
            x = P[x];
        }
    };
    while(L<=R) {
        if(L%2==0)set_good(L++);
        if(R&1)set_good(R--);
        if(R<L)break;
        L=(L-1)/2;
        R=(R-1)/2;
    }
    return dfs(0).first;
}

Compilation message (stderr)

circuit.cpp: In lambda function:
circuit.cpp:48:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for(long long i=1;i<=adj[x].size();i++) {
      |                           ~^~~~~~~~~~~~~~~
circuit.cpp: In lambda function:
circuit.cpp:85:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |         for(long long i=1;i<=adj[x].size();i++) {
      |                           ~^~~~~~~~~~~~~~~

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