Submission #424897

#TimeUsernameProblemLanguageResultExecution timeMemory
424897schseVision Program (IOI19_vision)C++17
33 / 100
117 ms1096 KiB
#include "vision.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;

void construct_network(int H, int W, int K)
{
	vector<int> lr;
	for (int r = 0; r < H; r++)
	{
		for (int c = 0; c < W; c++)
		{
			for (int rn = 0; rn < H; rn++)
			{
				for (int cn = 0; cn < W; cn++)
				{
					if (abs(c - cn) + abs(r - rn) == K)
					{
						lr.push_back(add_and({r * W + c, cn + rn * W}));
					}
				}
			}
		}
	}
	add_or(lr);
	return;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...