# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078710 | Gromp15 | Digital Circuit (IOI22_circuit) | C++17 | 3052 ms | 4184 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>
#define ll long long
#define sz(x) (int)x.size()
#define ar array
#include "circuit.h"
using namespace std;
const int mod = int(1e9) + 2022;
void fadd(int &a, int b) {
a += b;
if (a >= mod) a -= mod;
}
void fsub(int &a, int b) {
a -= b;
if (a < 0) a += mod;
}
vector<int> p, a, sub, sub2, val;
vector<vector<int>> adj;
int n, m;
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
n = N, m = M;
p = P, a = A;
adj.resize(N), sub.resize(N+M, 1), sub2.resize(N+M, 1);
for (int i = 1; i < N + M; i++) adj[P[i]].emplace_back(i);
for (int i = N-1; i >= 0; i--) {
sub[i] = sz(adj[i]);
int cur = sz(adj[i]);
vector<int> pref(cur), suff(cur);
for (int j = 0; j < cur; j++) {
# | 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... |