제출 #742288

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
742288		t6twotwo	Vision Program (IOI19_vision)	C++17	0 / 100	1 ms	212 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
void AND() {
	add_and(v);
	v.clear();
}
void XOR() {
	add_xor(v);
	v.clear();
}
void OR() {
	add_or(v);
	v.clear();
}
void construct_network(int H, int W, int K) {
	int T = H * W;
	auto get = [&](int x, int y) {
		return x * W + y;
	};
	vector<int> v;
	if (min(H, W) == 1) {
		if (H != 1) {
			swap(H, W);
		}
		for (int i = 0; i + K < W; i++) {
			add_and({i, i + K});
			v.push_back(T++);
		}
		OR();
		return;
	}
	if (K == 1) {
		vector<int> A(H);
		for (int i = 0; i < H; i++) {
			for (int j = 0; j < W; j++) {
				v.push_back(get(i, j));
			}
			A[i] = T++;
			OR();
		}
		vector<int> B(W);
		for (int j = 0; j < W; j++) {
			for (int i = 0; i < H; i++) {
				v.push_back(get(i, j));
			}
			B[j] = T++;
			OR();
		}
		vector<int> C(H - 1);
		for (int i = 0; i + 1 < H; i++) {
			C[i] = T++;
			add_and({A[i], A[i + 1]});
		}
		vector<int> D(W - 1);
		for (int i = 0; i + 1 < W; i++) {
			D[i] = T++;
			add_and({B[i], B[i + 1]});
		}
		for (int i = 0; i < H; i++) {
			v.push_back(A[i]);
		}
		int x = T++;
		XOR();
		for (int i = 0; i + 1 < W; i++) {
			v.push_back(D[i]);
		}
		int y = T++;
		OR();
		int z = T++;
		add_and({x, y});
		for (int i = 0; i < W; i++) {
			v.push_back(B[i]);
		}
		int a = T++;
		XOR();
		for (int i = 0; i + 1 < H; i++) {
			v.push_back(C[i]);
		}
		int b = T++;
		OR();
		int c = T++;
		add_and({a, b});
		add_or({z, c});
		return;
	}
	for (int i = 0; i <= K; i++) {
		if (i < H && K - i < W) {
			add_and({0, get(i, K - i)});
			v.push_back(T++);
		}
	}
	OR();
}

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