Submission #1074205

#TimeUsernameProblemLanguageResultExecution timeMemory
1074205NicolaikrobDigital Circuit (IOI22_circuit)C++17
18 / 100
3065 ms4440 KiB
#include "circuit.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<ll> vi; const ll mod = 1000002022; int n, m; vi Par, AA, SOA; vector<vi> G; void init(int N, int M, vector<int> P, vector<int> A) { n = N, m = M; Par.resize(n+m); for(int i = 0; i < n+m; i++) Par[i] = P[i]; AA.resize(n+m, 1); SOA.resize(n+m, 0); for(int i = 0; i < m; i++) SOA[n+i] = A[i]; G.resize(n); for(int i = 1; i < n+m; i++) G[Par[i]].push_back(i); for(int i = n-1; i >= 0; i--) { AA[i] = G[i].size(); for(auto x : G[i]) AA[i] = (AA[i]*AA[x])%mod; } } int count_ways(int L, int R) { for(int i = L; i <= R; i++) SOA[i] ^= 1; for(int i = n-1; i >= 0; i--) { ll c = G[i].size(); vi DP(c+1, 0); DP[0] = 1; for(auto x : G[i]) { for(int j = c; j > 0; j--) DP[j] = (DP[j]*(AA[x]-SOA[x]+mod)+DP[j-1]*SOA[x])%mod; DP[0] = DP[0]*(AA[x]-SOA[x]+mod)%mod; } SOA[i] = 0; for(int j = 0; j <= c; j++) SOA[i] = (SOA[i]+DP[j]*j)%mod; } return SOA[0]; }
#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...