# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
873598 | andrei_boaca | Vision Program (IOI19_vision) | C++17 | 93 ms | 9832 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>
//#include "grader.cpp"
using namespace std;
vector<int> lins,cols;
vector<int> dlin[505],dcol[505];
int d1[505],d2[505],ind;
void construct_network(int H, int W, int K)
{
if(min(H,W)==1)
{
H=max(H,W);
vector<int> v;
int cnt=0;
for(int i=0;i+K<H;i++)
{
v={i,i+K};
add_and(v);
cnt++;
}
v.clear();
for(int i=H;i<H+cnt;i++)
v.push_back(i);
assert(v.size()==cnt);
add_or(v);
return;
}
ind=H*W-1;
vector<int> cand;
int cnt=0;
for(int i=0;i<H;i++)
for(int j=0;j<W;j++)
{
vector<int> v;
for(int l=0;l<H;l++)
{
int need=K-abs(l-i);
if(need<0)
continue;
int c=j+need;
if(c>=0&&c<W)
v.push_back(l*W+c);
c=j-need;
if(c>=0&&c<W&&need!=0)
v.push_back(l*W+c);
}
if(cnt<9997&&!v.empty())
{
ind++;
add_or(v);
cnt++;
vector<int> t={ind,i*W+j};
add_and(t);
cnt++;
ind++;
cand.push_back(ind);
}
}
add_or(cand);
}
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... |