Submission #1327533

#TimeUsernameProblemLanguageResultExecution timeMemory
1327533nicolo_010Vision Program (IOI19_vision)C++20
0 / 100
0 ms332 KiB
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int dis(int i1, int j1, int i2, int j2) {
	return abs(i1-i2) + abs(j1-j2);
}

void construct_network(int H, int W, int k) {
	vector<int> Ns = {0};
	for (int i=0; i<H; i++) {
		for (int j=0; j<W; j++) {
			int id = i*W+j;
			if (dis(0, 0, i, j) == k) {
				Ns.push_back(id);
			}
		}
	}
	add_xor(Ns);
	add_not(H*W);
	add_or(Ns);
	vector<int> res = {H*W+1, H*W+2};
	add_or(res);
}
#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...