# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
959513 | AkibAzmain | Vision Program (IOI19_vision) | C++17 | 12 ms | 1680 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 "vision.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void construct_network(int h, int w, int k)
{
auto gv = [&] (int x, int y)
{
return x * w + y;
};
auto fa = [] (int a, int b, int x)
{
return make_pair (add_xor ({ a, b, x }),
add_or ({ add_and ({ a, b }),
add_and ({ b, x }),
add_and ({ x, a }) }));
};
int nl = add_and ({ gv (0, 0), add_not (gv (0, 0)) });
int ob = add_not (nl);
vector < vector < int > > a;
a.push_back ({ nl });
for (int i = 0; i < h; ++i)
{
vector < int > xa (w + 1);
for (int j = 0; j < w; ++j) xa[j] = gv (i, j);
xa[w] = a.back ()[0];
a.push_back ({ add_xor (xa) });
}
for (int j = 0; j < w; ++j)
Compilation message (stderr)
# | 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... |