# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
617885 | Minindu2006 | Vision Program (IOI19_vision) | C++14 | 0 ms | 0 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;
void construct_network(int H, int W, int K)
{
vector<int> allops;
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
vector<int> kDis;
for (int x = 0; x < H; x++)
{
for (int y = 0; y < W; y++)
{
if (abs(x - i) + abs(y - i) == K)
kDis.push_back(x * W + y);
}
}
if(!allpos.empty())
allops.push_back(add_and({i * W + j, add_or(kDis)}));
}
}
add_or(allops);
}