제출 #1159452

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1159452		gyg	Vision Program (IOI19_vision)	C++20	100 / 100	80 ms	7108 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
#define vec vector
#define pii pair<int, int>
#define fir first 
#define sec second

int n, m, k;

int id(int i, int j) { return i * m + j; }
vec<int> up(int x) {
	vec<int> ans;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			if (i + j == x) ans.push_back(id(i, j));
	return ans;
}
vec<int> dwn(int x) {
	vec<int> ans;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			if (i - j == x) ans.push_back(id(i, j));
	return ans;
}
vec<int> rng(int l, int r, map<int, int>& x) {
	vec<int> ans;
	for (int i = l; i <= r; i++) ans.push_back(x[i]);
	return ans;
}

void construct_network(int _n, int _m, int _k) {
	n = _n, m = _m, k = _k;
	int nm = n * m - 1;

	map<int, int> up1, dwn1, up2, dwn2;
	for (int x = 0; x <= n + m - 2; x++) {
		add_or(up(x)), nm++;
		up1[x] = nm;
	}
	for (int x = -m + 1; x <= n - 1; x++) {
		add_or(dwn(x)), nm++;
		dwn1[x] = nm;
	}
	for (int x = 0; x <= n + m - 2; x++) {
		add_xor(up(x)), nm++;
		add_xor({nm, up1[x]}), nm++;
		up2[x] = nm;
	}
	for (int x = -m + 1; x <= n - 1; x++) {
		add_xor(dwn(x)), nm++;
		add_xor({nm, dwn1[x]}), nm++;
		dwn2[x] = nm;
	}

	vec<int> a1, a2, a_up, a_dwn;
	int a_all = 0;
	for (int l = 0; l <= n + m - 2; l++) {
		int r = l + k;
		if (r > n + m - 2) continue;
		add_or(rng(l, r, up1)), nm++;
		a1.push_back(nm);
		add_or(rng(l, r, up2)), nm++;
		a2.push_back(nm);
		add_xor(rng(l, r, up1)), nm++;
		add_xor({a1.back(), nm}), nm++;
		add_or({a2.back(), nm}), nm++;
		a_up.push_back(nm);
	} 
	for (int l = -m + 1; l <= n - 1; l++) {
		int r = l + k;
		if (r > n - 1) continue;
		add_or(rng(l, r, dwn1)), nm++;
		a1.push_back(nm);
		add_or(rng(l, r, dwn2)), nm++;
		a2.push_back(nm);
		add_xor(rng(l, r, dwn1)), nm++;
		add_xor({a1.back(), nm}), nm++;
		add_or({a2.back(), nm}), nm++;
		a_dwn.push_back(nm);
	}
	add_or(a_up), nm++;
	add_or(a_dwn), nm++;
	add_and({nm - 1, nm}), nm++;
	a_all = nm;

	if (k == 1) return;

	vec<int> b1, b2, b_up, b_dwn;
	int b_all = 0;
	for (int l = 0; l <= n + m - 2; l++) {
		int r = l + k - 1;
		if (r > n + m - 2) continue;
		add_or(rng(l, r, up1)), nm++;
		b1.push_back(nm);
		add_or(rng(l, r, up2)), nm++;
		b2.push_back(nm);
		add_xor(rng(l, r, up1)), nm++;
		add_xor({b1.back(), nm}), nm++;
		add_or({b2.back(), nm}), nm++;
		b_up.push_back(nm);
	}
	for (int l = -m + 1; l <= n - 1; l++) {
		int r = l + k - 1;
		if (r > n - 1) continue;
		add_or(rng(l, r, dwn1)), nm++;
		b1.push_back(nm);
		add_or(rng(l, r, dwn2)), nm++;
		b2.push_back(nm);
		add_xor(rng(l, r, dwn1)), nm++;
		add_xor({b1.back(), nm}), nm++;
		add_or({b2.back(), nm}), nm++;
		b_dwn.push_back(nm);
	}
	add_or(b_up), nm++;
	add_or(b_dwn), nm++;
	add_and({nm - 1, nm}), nm++;
	b_all = nm;


	add_not(b_all), nm++;
	add_and({a_all, nm}), nm++;
}

• 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