Submission #417005

#	Time	Username	Problem	Language	Result	Execution time	Memory
417005		Kevin_Zhang_TW	Vision Program (IOI19_vision)	C++17	0 / 100	30 ms	1872 KiB

vision

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
#include "vision.h"

const int MAX_N = 300010;

void construct_network(int H, int W, int K) {

	auto to_id = [&](pair<int,int> a) { 
		return a.first * W + a.second;
	};
	auto valid = [&](pair<int,int> a) {
		auto [i, j] = a;
		return i >= 0 && i < H && j >= 0 && j < H;
	};
	// I put self in it too
	auto dis_k_up = [&](int x, int y) {
		vector<int> res;
		auto upd = [&](int x, int y) {
			pair<int,int> a(x, y);
			if (valid(a)) res.pb(to_id(a));
		};
		for (int i = 0;i <= K;++i) {
			int j = K - i;
			upd(x-i, y+j);
			if (j) upd(x-i, y-j);
		}
		return res;
	};

	vector<int> res;
	for (int i = 0;i < H;++i) for (int j = 0;j < W;++j) {
		auto vec = dis_k_up(i, j);
		if (vec.empty()) continue;
		int a = add_or( vec );
		vector<int> ans {a, to_id(make_pair(i, j)) };
		res.pb(add_and(ans));
	}

	add_or(res);

//
//	std::vector<int> Ns;
//	Ns = {0, 1};
//	int a = add_and(Ns);
//	Ns = {0, a};
//	int b = add_or(Ns);
//	Ns = {0, 1, b};
//	int c = add_xor(Ns);
//	add_not(c);
}

• 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