Submission #1195330

#	Time	Username	Problem	Language	Result	Execution time	Memory
1195330		clementine	Vision Program (IOI19_vision)	C++20	0 / 100	5 ms	1096 KiB

vision

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

int dist(int i, int j, int W, int H)
{
	int xi = i % W;
	int yi = i / W;
	int xj = j % W;
	int yj = j / W;

	return abs(xi - xj) + abs(yi - yj);
}

void construct_network(int H, int W, int K) 
{
	vector<int> Ns;
	int cur = 0;
	for(int i = 0; i < W; i ++)
	{
		Ns.clear();
		for(int j = 0; j < H; j ++)
		{
			Ns.push_back(j * W + i);
		}
		cur = add_xor(Ns);
	}
	Ns.clear();
	for(int i = H * W; i <= cur; i ++)
	{
		Ns.push_back(i);
	}
	int temp = add_or(Ns);
	int col_xor_res = add_not(temp);

	for(int i = H * W; i < temp - 1; i ++)
	{
		Ns.clear();
		Ns.push_back(i);
		Ns.push_back(i + 1);
		cur = add_and(Ns);
	}
	Ns.clear();
	for(int i = col_xor_res + 1; i <= cur; i ++)
	{
		Ns.push_back(i);
	}
	int col_pair_and_res = add_or(Ns);
	for(int i = 0; i < H; i ++)
	{
		Ns.clear();
		for(int j = 0; j < W; j ++)
		{
			Ns.push_back(i * W + j);
		}
		cur = add_xor(Ns);
	}
	Ns.clear();
	for(int i = col_pair_and_res + 1; i <= cur; i ++)
	{
		Ns.push_back(i);
	}
	int temp3 = add_or(Ns);
	int row_xor_res = add_not(temp3);
	int row_xor_end = cur;
	Ns.clear();
	for(int i = col_pair_and_res + 1; i < row_xor_end; i ++)
	{
		Ns.clear();
		Ns.push_back(i);
		Ns.push_back(i + 1);
		cur = add_and(Ns);
	}
	Ns.clear();
	for(int i = row_xor_res + 1; i <= cur; i ++)
	{
		Ns.push_back(i);
	}
	int row_and_pair_res = add_or(Ns);
	
	Ns.clear();
	Ns.push_back(row_and_pair_res);
	Ns.push_back(col_xor_res);
	int neardone = add_and(Ns);
	Ns.clear();
	Ns.push_back(col_pair_and_res);
	Ns.push_back(row_xor_res);
	int neardone2 = add_and(Ns);
	Ns.clear();
	Ns.push_back(neardone);
	Ns.push_back(neardone2);
	add_or(Ns);
}

• 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