제출 #807251

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
807251		faruk	Vision Program (IOI19_vision)	C++17	44 / 100	1087 ms	1992 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
#define mp make_pair
#define all(a) a.begin(), a.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

int h, w;
int getidx(int i, int j) {return i*w+j;}

void construct_network(int H, int W, int K) {
	h = H, w = W;
	vector<int> fin;
	for (int i = 0; i < h; i++) {
		for (int j = 0; j < w; j++) {
			vector<int> dist;
			for (int k = 0; k < h; k++) 
				for (int l = 0; l < w; l++)
					if (abs(i - k) + abs(j - l) == K)
						dist.push_back(getidx(k, l));
			if (dist.empty() || (i + j != 0 and (H*W*3 + 1) > 10000))
				continue;
			int one = add_xor(dist);
			int two = add_or(vector<int>({getidx(i, j)}));
			fin.push_back(add_and(vector<int>({one, two})));
		}
	}
	if (fin.empty())
	{
		int a = add_not(0), b = add_not(a);
		add_and(vector<int>({a, b}));
	}
	else
		add_or(fin);
}
 

• 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