Submission #602768

#	Time	Username	Problem	Language	Result	Execution time	Memory
602768		Clan328	Vision Program (IOI19_vision)	C++17	33 / 100	7 ms	1104 KiB

vision

#include <bits/stdc++.h>

using namespace std;

#define pb push_back

int add_and(std::vector<int> Ns);

int add_or(std::vector<int> Ns);

int add_xor(std::vector<int> Ns);

int add_not(int N);

int transformCoords(int W, int i, int j) {
	return i*W+j;
}

bool isValid(int H, int W, int i, int j) {
	if (i < 0 || j < 0 || i >= H || j >= W) return false;
	return true;
}

void construct_network(int H, int W, int K) {
	vector<int> Ns;
	int idx = 0;
	for (int x = 0; x < H; x++) {
		for (int y = 0; y < W; y++) {
			for (int i = 0; i <= K; i++) {
				if (isValid(H, W, i+x, K-i+y)) {
					add_and({transformCoords(W, x, y), transformCoords(W, i+x, K-i+y)});
					Ns.pb(H*W+idx);
					idx++;
				}
				if (isValid(H, W, x-i, K-i+y) && x-i != i+x) {
					add_and({transformCoords(W, x, y), transformCoords(W, x-i, K-i+y)});
					Ns.pb(H*W+idx);
					idx++;
				}
			}
		}
	}

	// for (int i = 0; i < Ns.size(); i++) {
	// 	cout << Ns[i] << " x ";
	// }
	// cout << endl;

	add_or(Ns); 
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19