Submission #783764

#TimeUsernameProblemLanguageResultExecution timeMemory
783764Abrar_Al_SamitVision Program (IOI19_vision)C++17
33 / 100
140 ms1064 KiB
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

void construct_network(int H, int W, int K) {
	vector<int>Ns;

	int cnt = 0;
	for(int i=0; i<H; ++i) {
		for(int j=0; j<W; ++j) {
			for(int k=0; k<H; ++k) {
				for(int l=0; l<W; ++l) {
					if(abs(i-k) + abs(j-l)==K) {
						if(make_pair(i, j) < make_pair(k, l)) {
							++cnt;
							Ns = {i * W + j, k * W + l};
							add_and(Ns);
						}
					}
				}
			}
		}
	}
	Ns = {};
	for(int i=H*W; i<H*W+cnt; ++i) {
		Ns.push_back(i);
	}
	add_or(Ns);
}
#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...