제출 #1038819

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1038819		DorostWef	Vision Program (IOI19_vision)	C++17	100 / 100	30 ms	4700 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>

using namespace std;

void construct_network(int H, int W, int K) {
	int n = H + W - 1;
	vector <int> a;
	for (int s = 0; s < n; s++) {
		vector <int> v;
		for (int i = 0; i < H; i++) {
			int j = (s - i);
			if (j < 0 || j >= W)
				continue;
			v.push_back((i * W) + j);
		}
		a.push_back (add_or (v));
	}
	int k = K;
	vector <int> w;
	for (int i = 0; i < n - k; i++) {
		w.push_back(add_and ({a[i], a[i + k]}));
	}
	int aa = add_or (w);
	w.clear();
	for (int i = 0; i < n; i++) {
		vector <int> v;
		for (int j = 0; j < n; j++) {
			if (abs(i - j) > k) {
				v.push_back(a[j]);
			}
		}
		if (v.empty())
			continue;
		w.push_back(add_and ({a[i], add_or (v)}));
	}
	w.push_back(add_and ({0, add_not (0)}));
	int ab = add_or (w);
	ab = add_not (ab);
	a.clear();
	// wefwef
	for (int s = 0; s < n; s++) {
		int ss = s - (W - 1);
		vector <int> v;
		for (int i = 0; i < H; i++) {
			int j = (i - ss);
			if (j < 0 || j >= W)
				continue;
			v.push_back((i * W) + j);
		}
		a.push_back (add_or (v));
	}
	w.clear();
	for (int i = 0; i < n - k; i++) {
		w.push_back(add_and ({a[i], a[i + k]}));
	}
	int ba = add_or (w);
	w.clear();
	for (int i = 0; i < n; i++) {
		vector <int> v;
		for (int j = 0; j < n; j++) {
			if (abs(i - j) > k) {
				v.push_back(a[j]);
			}
		}
		if (v.empty())
			continue;
		w.push_back(add_and ({a[i], add_or (v)}));
	}
	w.push_back(add_and ({0, add_not (0)}));
	int bb = add_or (w);
	bb = add_not (bb);
	int c = add_or ({aa, ba});
	add_and ({c, ab, bb});
}

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