Submission #245524

#	Time	Username	Problem	Language	Result	Execution time	Memory
245524		vioalbert	Vision Program (IOI19_vision)	C++14	100 / 100	75 ms	7540 KiB

vision

#include <bits/stdc++.h>
#include "vision.h"
using namespace std;
typedef long long ll;

const int D = 405;
int h, w;
vector<int> diagL[D], diagR[D], prefL, prefR, ans;

void reset() {
	prefL.clear();
	prefR.clear();
	ans.clear();
}

int solve(int k) {
	reset();
	for(int i = k; i <= h+w-2; i++) {
		prefL.push_back(add_or(diagL[i-k]));
		ans.push_back(add_and({add_or(prefL), add_or(diagL[i])}));
		prefR.push_back(add_or(diagR[i-k]));
		ans.push_back(add_and({add_or(prefR), add_or(diagR[i])}));
	}
	return add_or(ans);
}

void construct_network(int H, int W, int K) {
	h = H, w = W;
	for(int i = 0; i < h; i++) {
		for(int j = 0; j < w; j++) {
			diagL[i+j].push_back(i*w+j);
			diagR[i+(w-j-1)].push_back(i*w+j);
		}
	}
	if(H+W-2 == K) 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