제출 #544653

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
544653		sliviu	Vision Program (IOI19_vision)	C++17	100 / 100	26 ms	3456 KiB

vision

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

using namespace std;

void construct_network(int h, int w, int k) {
	vector<vector<int>> d_(h + w - 1), dd_(h + w - 1);
	vector<int> d, dd, p, pp, p_, pp_;
	for (int i = 0; i < h; ++i)
		for (int j = 0; j < w; ++j)
			d_[i + j].emplace_back(i * w + j), dd_[i + w - 1 - j].emplace_back(i * w + j);
	for (int i = 0; i < h + w - 1; ++i) {
		d.emplace_back(add_or(d_[i])), dd.emplace_back(add_or(dd_[i]));
		p_.emplace_back(d.back()), pp_.emplace_back(dd.back());
		p.emplace_back(add_or(p_)), pp.emplace_back(add_or(pp_));
	}
	auto solve = [&](int k) {
		vector<int> ans;
		for (int i = 0; i + k < h + w - 1; ++i)
			ans.emplace_back(add_and({p[i],d[i + k]})), ans.emplace_back(add_and({pp[i],dd[i + k]}));
		return add_or(ans);
	};
	if (k == h + w - 2)
		solve(k);
	else
		add_and({solve(k),add_not(solve(k + 1))});
}

• 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