Submission #598526

#	Time	Username	Problem	Language	Result	Execution time	Memory
598526		yutabi	Vision Program (IOI19_vision)	C++14	44 / 100	16 ms	2892 KiB

vision

#include "vision.h"


#include <bits/stdc++.h>
using namespace std;


#define pb push_back


int h;
int w;


bool valid(int y, int x)
{
	if(y>=0 && x>=0 && y<h && x<w)
	{
		return 1;
	}

	return 0;
}


void construct_network(int H, int W, int K)
{
	bool flag=0;

	if(h*w>1000)
	{
		flag=1;
	}

	int last;

	vector <int> fnl;

	h=H;
	w=W;

	for(int i=0;i<h;i++)
	{
		for(int j=0;j<w;j++)
		{
			vector <int> nums;

			for(int k=0;k<K;k++)
			{
				int y=i+K-k;
				int x=j+k;

				if(valid(y,x))
				{
					nums.pb((y*w+x));
				}

				y=i-k;
				x=j+K-k;

				if(valid(y,x))
				{
					nums.pb((y*w+x));
				}

				y=i-K+k;
				x=j-k;

				if(valid(y,x))
				{
					nums.pb((y*w+x));
				}

				y=i+k;
				x=j-K+k;

				if(valid(y,x))
				{
					nums.pb((y*w+x));
				}
			}

			if(nums.size())
			{
				last=add_or(nums);
				last=add_and({last,i*w+j});

				fnl.pb(last);
			}

			if(flag)
			{
				return;
			}

		}
	}

	/*printf("\n\n");

	for(int i=0;i<fnl.size();i++)
	{
		printf("%d     ",fnl[i]);
	}

	printf("\n");*/

	add_or(fnl);
}

• 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