# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
839149 | jasmin | Digital Circuit (IOI22_circuit) | C++17 | 3089 ms | 13648 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 "circuit.h"
#include<bits/stdc++.h>
using namespace std;
const long long MOD=1e9+2022;
//const int INF = INT_MAX;
vector<vector<int> > adi;
vector<int> par;
vector<int> state;
vector<vector<long long> > pos;
void update_node(int v){
int s=adi[v].size()+1;
vector<long long> cnt(s);
cnt[0] = 1;
for(auto u: adi[v]){
for(int i=s-1; i>=0; i--){
cnt[i] *= pos[u][0];
cnt[i]%=MOD;
if(0<i){
long long add = cnt[i-1]*pos[u][1];
add%=MOD;
# | 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... |