# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
390533 | qwerasdfzxcl | Vision Program (IOI19_vision) | C++14 | 3 ms | 1100 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>
typedef long long ll;
using namespace std;
void construct_network(int H, int W, int K) {
int r1=-1, r2=-1, rc=-1, w1=-1, w2=-1, wc=-1;
for (int i=0;i<H;i++){
vector<int> tmp;
for (int j=0;j<W;j++) tmp.push_back(i*W+j);
int val = add_or(tmp);
if (!val) rc=i;
else if (r1==-1) r1=i;
else r2=i;
}
for (int j=0;j<W;j++){
vector<int> tmp;
for (int i=0;i<H;i++) tmp.push_back(i*W+j);
int val = add_or(tmp);
if (!val) wc=j;
else if (w1==-1) w1=j;
else w2=j;
}
if (r2==-1) r2=r1;
if (w2==-1) w2=w1;
vector<int> tmp;
for (int j=0;j<W;j++) tmp.push_back(r1*W+j);
add_or(tmp);
if (abs(w2-w1)+abs(r2-r1)!=K){
int x = add_not(H*W+H+W);
assert(!x);
}
}
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... |