Submission #1243279

#TimeUsernameProblemLanguageResultExecution timeMemory
1243279Zbyszek99Digital Circuit (IOI22_circuit)C++20
100 / 100
344 ms41664 KiB
#include "circuit.h" #include <bits/stdc++.h> #define ll long long #define ld long double #define ull unsigned long long #define ff first #define ss second #define pii pair<int,int> #define pll pair<long long, long long> #define vi vector<int> #define vl vector<long long> #define pb push_back #define rep(i, b) for(int i = 0; i < (b); ++i) #define rep2(i,a,b) for(int i = a; i <= (b); ++i) #define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c) #define count_bits(x) __builtin_popcountll((x)) #define all(x) (x).begin(),(x).end() #define siz(x) (int)(x).size() #define forall(it,x) for(auto& it:(x)) using namespace std; const int INF = 1e9+50; const ll INF_L = 1e18+40; const ll MOD = 1000002022; const int tree_siz = 1024*512-1; ll sum[tree_siz+1]; ll rev_sum[tree_siz+1]; int oper[tree_siz+1]; void spych(int v) { if(oper[v]) { swap(sum[v*2],rev_sum[v*2]); swap(sum[v*2+1],rev_sum[v*2+1]); oper[v*2] ^= 1; oper[v*2+1] ^= 1; oper[v] = 0; } } void change_seg(int akt, int p1, int p2, int s1, int s2) { if(p2 < s1 || p1 > s2) return; if(p1 >= s1 && p2 <= s2) { swap(sum[akt],rev_sum[akt]); oper[akt] ^= 1; return; } spych(akt); change_seg(akt*2,p1,(p1+p2)/2,s1,s2); change_seg(akt*2+1,(p1+p2)/2+1,p2,s1,s2); sum[akt] = sum[akt*2] + sum[akt*2+1]; sum[akt] %= MOD; rev_sum[akt] = rev_sum[akt*2] + rev_sum[akt*2+1]; rev_sum[akt] %= MOD; } vi graph[200001]; ll ways[200001]; ll ans_ways[200001]; int n; void dfs(ll v) { ways[v] = max(1,siz(graph[v])); forall(it,graph[v]) { dfs(it); ways[v] *= ways[it]; ways[v] %= MOD; } } void dfs_ans(int v, ll w) { ans_ways[v] = w; vl pref(siz(graph[v])); vl suf(siz(graph[v])); ll cur = 1; rep(i,siz(graph[v])) { cur *= ways[graph[v][i]]; cur %= MOD; pref[i] = cur; } cur = 1; for(int i = siz(graph[v])-1; i >= 0; i--) { cur *= ways[graph[v][i]]; cur %= MOD; suf[i] = cur; } rep(i,siz(graph[v])) { ll w2 = w; if(i != 0) { w2 *= pref[i-1]; w2 %= MOD; } if(i != siz(graph[v])-1) { w2 *= suf[i+1]; w2 %= MOD; } dfs_ans(graph[v][i],w2); } } void init(int N, int M, vi P, vi A) { n = N; rep(i,N+M) if(P[i] != -1) graph[P[i]].pb(i); dfs(0); dfs_ans(0,1); rep2(i,tree_siz/2+1,tree_siz/2+M) { int v = N + i - (tree_siz/2+1); if(A[v-N] == 1) sum[i] = ans_ways[v]; else rev_sum[i] = ans_ways[v]; } for(int i = tree_siz/2; i >= 1; i--) { sum[i] = (sum[i*2]+sum[i*2+1]) % MOD; rev_sum[i] = (rev_sum[i*2]+rev_sum[i*2+1]) % MOD; } } int count_ways(int L, int R) { change_seg(1,0,tree_siz/2,L-n,R-n); return sum[1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...