Submission #723976

#	Time	Username	Problem	Language	Result	Execution time	Memory
723976		GrandTiger1729	Vision Program (IOI19_vision)	C++17	33 / 100	8 ms	1736 KiB

vision

#include "vision.h"
#ifndef EVAL
#include "grader.cpp"
#endif

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

const int C = 10000;
void construct_network(int n, int m, int K){
	auto valid = [&](int i, int j) -> int {
		return 0 <= i && i < n && 0 <= j && j < m;
	};
	auto idx = [&](int i, int j) -> int {
		return i * m + j;
	};
	vector<pair<int, int>> res;
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++){
			for (int k = 0; k <= K; k++){
				if (k != K && valid(i + (K - k), j - k))
					res.emplace_back(idx(i, j), idx(i + (K - k), j - k));
				if (k != 0 && valid(i + (K - k), j + k))
					res.emplace_back(idx(i, j), idx(i + (K - k), j + k));
			}
		}
	}
	vector<int> qry;
	random_shuffle(res.begin(), res.end());
	for (int i = 0; i < min((int)res.size(), C - 1); i++)
		qry.push_back(add_and({res[i].first, res[i].second}));
	add_or(qry);
}

• 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