제출 #241147

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

vision

#include"vision.h"
#include<bits/stdc++.h>
using namespace std;
vector<int>diagL[405], diagR[405], prefL, prefR, ans;
void reset(){
	for(int i=0; i<405; i++)
		diagL[i].clear(), diagR[i].clear();
	prefL.clear(); prefR.clear(); ans.clear();
}
int h, w;
int solve(int k){
	reset();
	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 dst=k; dst<=h+w-2; dst++){
		prefL.push_back(add_or(diagL[dst-k]));
		ans.push_back(add_and({add_or(diagL[dst]), add_or(prefL)}));
		prefR.push_back(add_or(diagR[dst-k]));
		ans.push_back(add_and({add_or(diagR[dst]), add_or(prefR)}));
	}
	return add_or(ans);
}
void construct_network(int H, int W, int K){
	h=H; w=W;
	if(K==H+W-2) 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