# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
697354 | FEDIKUS | 디지털 회로 (IOI22_circuit) | C++17 | 1064 ms | 35588 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>
#include <vector>
using namespace std;
typedef long long ll;
const int maxn=2e5+10;
const int mod=1e9+2022;
int n,m;
vector<int> g[maxn];
vector<int> p,a;
int add(int a,int b){
return (a+b)%mod;
}
int mul(int a,int b){
return ll(a)*ll(b)%mod;
}
int bruk[maxn];
int power[maxn];
void dfs(int node){
bruk[node]=1;
# | 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... |