Submission #871163

#	Time	Username	Problem	Language	Result	Execution time	Memory
871163		hgmhc	Vision Program (IOI19_vision)	C++17	58 / 100	38 ms	5204 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;

int No() {
	return add_xor({0,0});
}
int Yes() {
	return add_not(add_xor({0,0}));
}

int solve(int H, int W, int K) {
	
	auto get1 = [&](int x) {
		int i, j;
		vi res;
		for (i=0, j=x; i<H; ++i, --j) {
			if (0 <= j && j < W) {
				res.push_back(i*W+j);
			}
		}
		return res;
	};
	
	auto get2 = [&](int x) {
		int i, j;
		vi res;
		for (i=0, j=W-1-x; i<H; ++i, ++j) {
			if (0 <= j && j < W) {
				res.push_back(i*W+j);
			}
		}
		return res;
	};
	
	vi candidate_conditions;
	
	for (int k = 0; k < H+W; ++k) {
		vi A = get1(k), B = get1(k+K);
		if (empty(A) || empty(B)) continue;
		
		int a = add_xor(A), b = add_xor(B);
		candidate_conditions.push_back(add_and({a,b}));
	}
	
	for (int k = 0; k < H+W; ++k) {
		vi A = get2(k), B = get2(k+K);
		if (empty(A) || empty(B)) continue;
		
		int a = add_xor(A), b = add_xor(B);
		candidate_conditions.push_back(add_and({a,b}));
	}
	
	if (empty(candidate_conditions)) return No();
	return add_or(candidate_conditions);
}

void construct_network(int H, int W, int K) {
	
	auto hor_box = [&] {
		vi res;
		for (int k=0; k+K<H; ++k) {
			vi box;
			for (int i=k; i<=k+K; ++i) {
				for (int j=0; j<W; ++j) {
					box.push_back(i*W+j);
				}
			}
			res.push_back( add_and({ add_or(box), add_not(add_xor(box)) }) );
		}
		if (empty(res)) return Yes();
		return add_or(res);
	};
	
	auto ver_box = [&] {
		vi res;
		for (int k=0; k+K<W; ++k) {
			vi box;
			for (int i=k; i<=k+K; ++i) {
				for (int j=0; j<H; ++j) {
					box.push_back(j*W+i);
				}
			}
			res.push_back( add_and({ add_or(box), add_not(add_xor(box)) }) );
		}
		if (empty(res)) return Yes();
		return add_or(res);
	};
	
	int condition1 = add_and({ ver_box(), hor_box() });
	int condition2 = solve(H,W,K);
	
	add_and({condition1,condition2});
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 0 / 8
• Subtask 7: 14 / 14
• Subtask 8: 0 / 19