Submission #424788

#TimeUsernameProblemLanguageResultExecution timeMemory
424788schseVision Program (IOI19_vision)C++17
0 / 100
2 ms332 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)
{
	assert(H == 1 || W == 1);
	vector<int> lr;
	for (int i = 0; i < H * W - K; i++)
	{
		lr.push_back(add_and({i, i + K}));
	}
	add_not(add_and(lr));
}
#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...