제출 #228524

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
228524		maximath_1	Vision Program (IOI19_vision)	C++17	100 / 100	77 ms	7412 KiB

vision

#include"vision.h"
#include<bits/stdc++.h>
using namespace std;
int solve(int h, int w, int k){
	vector<int>diagL[400], diagR[400], prefL, prefR, ans;
	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-1-j)].push_back(i*w+j);
		}
	for(int d=k; d<h+w-1; d++){
		prefL.push_back(add_or(diagL[d-k]));
		prefR.push_back(add_or(diagR[d-k]));
		ans.push_back(add_and({add_or(diagL[d]), add_or(prefL)}));
		ans.push_back(add_and({add_or(diagR[d]), add_or(prefR)}));
	}
	return add_or(ans);
}
void construct_network(int h, int w, int k){
	if(k==h+w-2) solve(h, w, k);
	else add_and({solve(h, w, k), add_not(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