Submission #936579

#	Time	Username	Problem	Language	Result	Execution time	Memory
936579		GrindMachine	Digital Circuit (IOI22_circuit)	C++17	46 / 100	3030 ms	5720 KiB

circuit

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
edi

*/

const int MOD = 1000002022;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "circuit.h"

vector<ll> adj[N];
vector<ll> sub_ways(N);

void dfs1(ll u){
    sub_ways[u] = max((ll)sz(adj[u]),1ll);
    trav(v,adj[u]){
        dfs1(v);
        sub_ways[u] = sub_ways[u]*sub_ways[v]%MOD;
    }
}

ll n,m;
vector<int> a;
vector<ll> contrib;

void dfs2(ll u, ll val){
    auto children = adj[u];
    if(children.empty()){
        contrib[u-n] = val;
        return;
    }

    ll siz = sz(children);
    children.insert(children.begin(),0);
    vector<ll> pref(siz+5), suff(siz+5);
    pref[0] = 1, suff[siz+1] = 1;
    rep1(i,siz){
        ll v = children[i];
        pref[i] = pref[i-1]*sub_ways[v]%MOD;
    }
    rev(i,siz,1){
        ll v = children[i];
        suff[i] = suff[i+1]*sub_ways[v]%MOD;
    }

    rep1(i,siz){
        ll v = children[i];
        ll new_val = val*pref[i-1]%MOD*suff[i+1]%MOD;
        dfs2(v,new_val);
    }
}

void init(int n_, int m_, std::vector<int> P, std::vector<int> A) {
    n = n_, m = m_;
    a = A;
    contrib = vector<ll>(m);

    rep(i,n+m){
        if(P[i] != -1){
            adj[P[i]].pb(i);
        }
    }

    dfs1(0);
    dfs2(0,1);
}

int count_ways(int l, int r) {
    l -= n, r -= n;
    for(int i = l; i <= r; ++i){
        a[i] ^= 1;
    }

    ll ans = 0;
    rep(i,m){
        if(a[i]){
            ans += contrib[i];
            ans %= MOD;
        }
    }

    return ans;
}

• 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: 28 / 28
• Subtask 8: 0 / 11