# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
832120 | Username4132 | Digital Circuit (IOI22_circuit) | C++17 | 3028 ms | 7540 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 <iostream>
#include <vector>
using namespace std;
using ll = long long;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define forsn(i, s, n) for(int i=s; i<(int)n; ++i)
#define PB push_back
const int MAXN = 100010;
int n, m, arr[MAXN];
int cal[MAXN][3];
int coef[MAXN];
vector<int> g[MAXN];
int crt(int x, int y, int z){
return (500001011LL*x + 143498048LL*y + 356502964LL*z)%1000002022;
}
ll ex(ll b, int e, int mod){
ll ret=1;
while(e>0){
if(e&1) ret=(ret*b)%mod;
b=(b*b)%mod;
e>>=1;
}
return ret;
}
void dfs(int v, int mod, int prod, int cnt, int ind){
# | 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... |