제출 #431217

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
431217		_fractal	Vision Program (IOI19_vision)	C++14	32 / 100	6 ms	1736 KiB

vision

#include "vision.h"
#include <cassert>
#include <iostream>
using namespace std;

const int dx[] = {+1, +1};
const int dy[] = {+1, -1};


void construct_network(int H, int W, int K) {
	int sz = H * W, cur = H * W - 1;
	vector<int> ask, ksa, is(K + 1, 0), si(K + 1, 0);
	vector<int> kek[K + 1], lol[K + 1];
	for (int i = 0; i < H; ++i) {
		ask.clear();
		for (int j = 0; j < W; ++j)
			ask.push_back(i * W + j);
		add_or(ask);
	}
	for (int j = 0; j < W; ++j) {
		ask.clear();
		for (int i = 0; i < H; ++i)
			ask.push_back(i * W + j);
		add_or(ask);
	}
	sz = H * W, cur = H * W + H + W - 1;
	ask.clear();
	for (int i = 0; i < H; ++i) {
		ask.push_back(sz + i);
		for (int j = 1; i + j < H && j <= K; ++j) {
			add_and({sz + i, sz + i + j});
			cur++;
			kek[j].push_back(cur);
		}
	}
	add_xor(ask);
	cur++;
	kek[0].push_back(cur);
	sz = H * W + H;
	ask.clear();
	for (int i = 0; i < W; ++i) {
		ask.push_back(sz + i);
		for (int j = 1; i + j < W && j <= K; ++j) {
			add_and({sz + i, sz + i + j});
			cur++;
			lol[j].push_back(cur);
		}
	}
	add_xor(ask);
	cur++;
	lol[0].push_back(cur);
	for (int i = 0; i <= K; ++i) {
		if (kek[i].empty())
			add_xor({0, 0});
		else
			add_or(kek[i]);
		cur++;
		is[i] = cur;
	}
	for (int i = 0; i <= K; ++i) {
		if (lol[i].empty())
			add_xor({0, 0});
		else
			add_or(lol[i]);
		cur++;
		si[i] = cur;
	}
	ask.clear();
	for (int i = 0; i <= K; ++i) {
		add_and({is[i], si[K - i]});
		cur++;
		ask.push_back(cur);
	}
	assert(cur <= 10000);
	add_or(ask);
	return;
}

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