Submission #892913

#TimeUsernameProblemLanguageResultExecution timeMemory
892913Muhammad_AneeqVision Program (IOI19_vision)C++17
0 / 100
1044 ms109136 KiB
#include <vector>
#include <map>
#include "vision.h"
using namespace std;
int h,w;
int ind;
map<pair<int,int>,bool>d;
vector<int>g;
void check(int i,int j,int k,int l)
{
	if (i<0||i>=h||j<0||j>=w)
		return;
	int x=i*w+j;
	if (d[{x,k*w+l}]==1)
		return;
	d[{x,k*w+l}]=d[{k*w+l,x}]=1;
	g.push_back(x);
}
void check1(vector<int>z)
{
	add_or(z);
}
void construct_network(int H,int W,int K)
{
	h=H;w=W;
	ind = H*W;
	for (int i=0;i<H;i++)
		for (int j=0;j<W;j++)
		{
			g={};
			for (int k=0;k<=K;k++)
			{
				check(i+k,j+K-k,i,j);check(i+k,j-K+k,i,j);check(i-k,j-K+k,i,j);check(i-k,j+K-k,i,j);
			}
			if (g.size()&&i==0&&j==0)
			{
				ind+=2;
				add_and({add_or(g),i*w+j});
			}
		}
	vector<int>z;
	for (int i=H*W+1;i<ind;i+=2)
		z.push_back(i);
	check1(z);
}
#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...