제출 #422055

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
422055		pliam	Vision Program (IOI19_vision)	C++14	44 / 100	493 ms	37640 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
#define MAXH 205
#define MAXW 205

int h,w,k;
set<pair<int,int>> used;
vector<int> diag;
vector<int> answers;

int id(int x,int y){//x in 0..h-1, y in 0..w-1
	return x*w+y;
}

bool inbounds(int x,int y){
	return 0<=x&&x<h&&0<=y&&y<w;
}

void ins(int x,int y,int dx,int dy){
	int x_=x+dx;
	int y_=y+dy;
	if(inbounds(x_,y_)&&!used.count({id(x,y),id(x_,y_)})){
		diag.push_back(id(x_,y_));
		used.insert({id(x,y),id(x_,y_)});
		used.insert({id(x_,y_),id(x,y)});
	}
}

void construct_network(int H, int W, int K) {
	h=H;
	w=W;
	k=K;
	used.clear();
	for(int x=0;x<h;x++){
		for(int y=0;y<w;y++){
			diag.clear();
			for(int i=0;i<=k;i++){
				ins(x,y,i,k-i);
				ins(x,y,-i,k-i);
				ins(x,y,i,-k+i);
				ins(x,y,-i,-k+i);
			}
			if(diag.size()>0){
				int ans_or=add_or(diag);
				int ans_and=add_and({id(x,y),ans_or});
				answers.push_back(ans_and);
			}
		}
	}
	add_or(answers);
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19