Submission #423703

#	Time	Username	Problem	Language	Result	Execution time	Memory
423703		KoD	Vision Program (IOI19_vision)	C++17	100 / 100	13 ms	1840 KiB

vision

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

template <class T> using Vec = std::vector<T>;

template <class... Args>
Vec<int> vec(Args&&... args) {
	return Vec<int>{std::forward<Args>(args)...};
}

void construct_network(int H, int W, int K) {
	const auto cell = [&](const int i, const int j) {
		return i * W + j;
	};
	const int L = H + W - 1;
	Vec<Vec<int>> Xs(L), Ys(L);
	for (int i = 0; i < H; ++i) {
		for (int j = 0; j < W; ++j) {
			Xs[i + j].push_back(cell(i, j));
			Ys[i - j + W - 1].push_back(cell(i, j));
		}
	}
	Vec<int> row(L), col(L), rowcum(L), colcum(L);
	for (int i = 0; i < L; ++i) {
		row[i] = add_or(Xs[i]);
		col[i] = add_or(Ys[i]);
		if (i == 0) {
			rowcum[i] = row[i];
			colcum[i] = col[i];
		} else {
			rowcum[i] = add_or(vec(rowcum[i - 1], row[i]));
			colcum[i] = add_or(vec(colcum[i - 1], col[i]));
		}
	}
	const auto calc = [&](const int D) {
		Vec<int> memo;
		for (int i = 0; i < L; ++i) {
			if (i - D >= 0) {
				memo.push_back(add_and(vec(row[i], rowcum[i - D])));
				memo.push_back(add_and(vec(col[i], colcum[i - D])));
			}
		}
		return add_or(memo);
	};
	const int cand = calc(K);
	if (K + 1 != L) {
		add_xor(vec(cand, calc(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