# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
972150 | grafff | Digital Circuit (IOI22_circuit) | C++17 | 1217 ms | 3388 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 ll int
#define all(x) x.begin(), x.end()
#define x_c first
#define y_c second
using namespace std;
ll n, m, MOD = 1000002022;
vector <ll> p, a;
vector <bool> flag(9);
vector <vector <ll>> gr;
int group_1(int l, int r)
{
for(int i = l; i <= r; i++)
{
a[i] = 1 - a[i];
}
ll col = 0;
for(int i = 0; i < m; i++)
{
col += a[i];
}
return col;
}
int count_ways(int L, int R)
{
# | 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... |