Submission #316477

#TimeUsernameProblemLanguageResultExecution timeMemory
316477amunduzbaevVision Program (IOI19_vision)C++14
0 / 100
5 ms1148 KiB
//#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;
	v.push_back(xx*h+yy);
	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=1;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=1;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

*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...