Submission #170722

#	Time	Username	Problem	Language	Result	Execution time	Memory
170722		youngyojun	Vision Program (IOI19_vision)	C++17	100 / 100	36 ms	3704 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
using namespace std;

int dp1or[405], dp1xor[405];
int dp2or[405], dp2xor[405];

void construct_network(int H, int W, int K) {
	for(int key = 0; key <= H+W-2; key++) {
		vector<int> V;
		for(int i = 0, j = key; i < H; i++, j--)
			if(0 <= j && j < W) V.eb(i*W + j);
		dp1or[key] = 1 == sz(V) ? V[0] : add_or(V);
		dp1xor[key] = 1 == sz(V) ? V[0] : add_xor(V);

		V.clear();
		for(int i = 0, j = key-H+1; i < H; i++, j++)
			if(0 <= j && j < W) V.eb(i*W + j);
		dp2or[key] = 1 == sz(V) ? V[0] : add_or(V);
		dp2xor[key] = 1 == sz(V) ? V[0] : add_xor(V);
	}

	auto make = [&]() -> int {
		vector<int> AV, OV;
		for(int i = K; i <= H+W-2; i++)
			AV.eb(add_and({dp1or[i-K], dp1or[i]}));
		for(int i = 0; i < H+W-2; i++) {
			vector<int> V;
			for(int j = min(i+K, H+W-2); i < j; j--) V.eb(dp2or[j]);
			V.eb(add_not(dp2xor[i]));
			OV.eb(add_and({dp2or[i], add_or(V)}));
		}
		return add_and({add_or(AV), add_or(OV)});
	};

	int ret = make();
	for(int i = 0; i < 405; i++) {
		swap(dp1or[i], dp2or[i]);
		swap(dp1xor[i], dp2xor[i]);
	}
	add_or({ret, make()});
}

• 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