Submission #221270

#	Time	Username	Problem	Language	Result	Execution time	Memory
221270		galca	Vision Program (IOI19_vision)	C++14	26 / 100	18 ms	1664 KiB

vision

#include <vision.h>
#include <vector>
using namespace std;

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

	positions2.push_back(0);
	positions2.push_back(0);

	for (int i = 0; i < W; i++) {
		positions.push_back(i);
	}
	for (int j = 0; j < H; j++) {
		add_xor(positions);
		for (int i = 0; i < W; i++) {
			positions[i] += W;
		}
	}

	positions.erase(positions.begin(), positions.end());
	for (int i = 0; i < H; i++) {
		positions.push_back(i*W);
	}
	for (int j = 0; j < W; j++) {
		add_xor(positions);
		for (int i = 0; i < H; i++) {
			positions[i] += 1;
		}
	}

	vector<int> positions_final_or;

	// starting from W*H + H + W, put xor of all positions

	positions.erase(positions.begin(), positions.end());
	// get 0
	for (int i = 0; i < H; i++) {
		positions.push_back(W*H + i);
		add_xor(positions);
	}

	positions.erase(positions.begin(), positions.end());
	for (int i = 0; i < W; i++) {
		positions.push_back(W*H + H + i);
		add_xor(positions);
	}

	
	for (int j = 1; j < K; j++) {
		
		int options_y = H - j;
		int options_x = W - (K - j);

		if ((options_y > 0) && (options_x > 0)) {
			vector<int> positions_or_y;
			vector<int> positions_or_x;

			for (int i = 0; i < options_y; i++) {
				vector<int> positions_and_y;

				// ((i-1) xor (i)) and ((i+j) xor (i+j-1))
				positions2[0] = H*W + W + H + (i > 0 ? i - 1 : H - 1);
				positions2[1] = H*W + W + H + i;
				positions_and_y.push_back(add_xor(positions2));

				positions2[0] = H*W + W + H + i + j;
				positions2[1] = H*W + W + H + i + j - 1;
				positions_and_y.push_back(add_xor(positions2));

				positions_or_y.push_back(add_and(positions_and_y));
			}
			int pos1 =add_or(positions_or_y);
		

			for (int i = 0; i < options_x; i++) {
				vector<int> positions_and_x;
				// ((i-1) xor (i)) and ((i+j) xor (i+j-1))
				positions2[0] = H*W + W + H + H + i > 0 ? i - 1 : W - 1;
				positions2[1] = H*W + W + H + H + i;
				positions_and_x.push_back(add_xor(positions2));

				positions2[0] = H*W + W + H + H + i + (K-j);
				positions2[1] = H*W + W + H + H + i + (K-j) - 1;
				positions_and_x.push_back(add_xor(positions2));

				positions_or_x.push_back(add_and(positions_and_x));
			}
			int pos2 = add_or(positions_or_x);
			positions2[0] = pos1;
			positions2[1] = pos2;

			positions_final_or.push_back(add_and(positions2));
		}
	}

	positions2.push_back(0);

	positions.erase(positions.begin(), positions.end());
	for (int i = 0; i < W; i++) {
		positions.push_back(H*W + H + i);
	}

	int pos1 = add_not(add_or(positions));

	positions.erase(positions.begin(), positions.end());
	for (int i = 0; i < H; i++) {
		positions.push_back(H*W + i);
	}

	int pos2 = add_not(add_or(positions));

	// 0-K and K-0
	for (int j = 0; j < H - K; j++) {
		positions2[0] = H*W + j;
		positions2[1] = H*W + j + K;
		positions2[2] = pos1;
		positions_final_or.push_back(add_and(positions2));
	}
	for (int j = 0; j < W - K; j++) {
		positions2[0] = H*W + H + j;
		positions2[1] = H*W + H + j + K;
		positions2[2] = pos2;
		positions_final_or.push_back(add_and(positions2));
	}

	add_or(positions_final_or);
}

• 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: 14 / 14
• Subtask 8: 0 / 19