제출 #316474

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
316474		amunduzbaev	Vision Program (IOI19_vision)	C++14	0 / 100	4 ms	1148 KiB

vision

//#include "grader.cpp"

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 40005;
int d, h, w;
void fun(int xx,int yy){
	vector<int>v;
	for(int i=0;i<d;i++){
		int x = xx+i, y = yy+(d-i);
		if(x>=0&&x<=h&&y>=0&&y<=w)
			v.push_back((x*h)+y);
	}
	for(int i=0;i<d;i++){
		int x = xx-i, y = yy+(d-i);
		if(x>=0&&x<=h&&y>=0&&y<=w)
			v.push_back((x*h)+y);
	}
	for(int i=0;i<d;i++){
		int x = xx+i, y = yy-(d-i);
		if(x>=0&&x<=h&&y>=0&&y<=w)
			v.push_back((x*h)+y);
	}
	for(int i=0;i<d;i++){
		int x = xx-i, y = yy-(d-i);
		if(x>=0&&x<=h&&y>=0&&y<=w)
			v.push_back((x*h)+y);
	}
	add_and(v);
}
void construct_network(int H, int W, int k) {
	d=k, h=H, w=W;
	for(int i=0;i<h;i++){
		for(int j=0;j<w;j++){
			fun(i,j);
		}
	}
	vector<int> v;
	for(int i=0;i<h*w;i++){
		v.push_back(i+(w*h));
	}
	add_or(v);
}

/*

2 3 3 
0 5
2 3

*/

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