Submission #725168

#	Time	Username	Problem	Language	Result	Execution time	Memory
725168		QwertyPi	Vision Program (IOI19_vision)	C++14	12 / 100	41 ms	5064 KiB

vision

#include "vision.h"

int H, W, K;
int id(int x, int y){
	return x * W + y;
}
int solve(int a[201], int b[201]){
	std::vector<int> v1;
	for(int i = 0; i <= (H + W - 2) - K; i++){
		v1.push_back(add_and({a[i], a[i + K]}));
	}
	int a1 = add_or(v1);

	std::vector<int> v2;
	for(int i = 0; i <= H + W - 2; i++){
		std::vector<int> v;
		for(int j = std::max(0, i - K); j <= std::min(H + W - 2, i + K); j++){
			if(j != i) v.push_back(b[j]);
		}
		v2.push_back(add_and({b[i], add_or(v)}));
		v.clear();
		for(int j = 0; j <= H + W - 2; j++){
			if(j != i) v.push_back(b[j]);
		}
		v2.push_back(add_xor({b[i], add_or(v)}));

	}
	int a2 = add_or(v2);

	return add_and({a1, a2});
}

void construct_network(int H, int W, int K) {
	::H = H, ::W = W, ::K = K;
	int a[H + W - 1], b[H + W - 1];
	std::vector<int> va[H + W - 1], vb[H + W - 1];
	for(int i = 0; i < H; i++){
		for(int j = 0; j < W; j++){
			va[i + j].push_back(id(i, j));
			vb[i + (W - 1 - j)].push_back(id(i, j));
		}
	}
	for(int i = 0; i <= H + W - 2; i++) a[i] = add_or(va[i]);
	for(int i = 0; i <= H + W - 2; i++) b[i] = add_or(vb[i]);
	int a1 = solve(a, b), a2 = solve(b, a);
	add_or({a1, a2});
}

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