# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1058416 | Huseyn123 | Digital Circuit (IOI22_circuit) | C++17 | 744 ms | 35812 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "circuit.h"
#define MAX 200001
using namespace std;
typedef long long ll;
int n,m;
const int mod=1000002022;
vector<vector<int>> g;
long long dp[MAX],dp1[MAX];
void dfs(int v){
if(v>=n){
dp[v]=1;
return;
}
dp[v]=(int)g[v].size();
for(auto x:g[v]){
dfs(x);
dp[v]*=dp[x];
dp[v]%=mod;
}
}
void dfs1(int v){
if(v>=n){
return;
}
int sz=(int)g[v].size();
vector<ll> pref(sz),suf(sz);
for(int i=0;i<sz;i++){
pref[i]=dp[g[v][i]];
if(i){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |