제출 #1221425

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1221425		thangdz2k7	Vision Program (IOI19_vision)	C++20	100 / 100	44 ms	7360 KiB

vision

#include "vision.h"

#include <bits/stdc++.h>

using namespace std;

int solve(int h, int w, int k){ // distance >= k
	vector <vector <int>> diaL(h + w - 1), diaR(h + w - 1);

	for (int i = 0; i < h; ++ i){
		for (int j = 0; j < w; ++ j){
			diaL[i + j].push_back(i * w + j);
			diaR[i + w - 1 - j].push_back(i * w + j);
		}
	}

	vector <int> ans, prefL, prefR;

	for (int i = k; i < h + w - 1; ++ i){
		prefL.push_back(add_or(diaL[i - k]));
		prefR.push_back(add_or(diaR[i - k]));
		ans.push_back(add_and({add_or(prefL), add_or(diaL[i])}));
		ans.push_back(add_and({add_or(prefR), add_or(diaR[i])}));
	}

	return add_or(ans);
}

void construct_network(int h, int w, int k){
	if (k == h + w - 2) solve(h, w, k);
	else add_xor({solve(h, w, k), solve(h, w, 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