# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
478367 | blue | Vision Program (IOI19_vision) | C++17 | 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 <vector>
using namespace std;
int checkifgeq(int H, int W, int K_)
{
int K = K_;
vector<int> diag_res;
for(int V = 1; V <= 2; V++)
{
vector<int> diag1_list;
if(V == 1)
{
for(int d1 = 0; d1 <= H-1 + W-1; d1++)
{
vector<int> op;
for(int i = 0; i < H; i++)
{
for(int j = 0; j < W; j++)
{
if(i+j == d1) op.push_back(W*i + j);
}
}
diag1_list.push_back(add_or(op));
}
}
else
{
for(int d1 = 0-(W-1); d1 <= (H-1)-0; d1++)
{
vector<int> op;
for(int i = 0; i < H; i++)
{
for(int j = 0; j < W; j++)
{
if(i-j == d1) op.push_back(W*i + j);
}
}
diag1_list.push_back(add_or(op));
}
}
vector<int> diag1_comp_list;
for(int i = 0; i+K < (int)diag1_list.size(); i++)
{
diag1_comp_list.push_back(add_and(vector<int>{diag1_list[i], diag1_list[i+K]}));
}
diag_res.push_back(add_or(diag1_comp_list));
}
return add_and(diag_res);
}
void construct_network(int H, int W, int K)
{
if(K == 1)
checkifgeq(H, W, 1);
else
add_and(add_not(checkifgeq(H, W, K-1)), checkifgeq(H, W, K));
}