Submission #418492

#	Time	Username	Problem	Language	Result	Execution time	Memory
418492		Azimjon	Vision Program (IOI19_vision)	C++17	33 / 100	254 ms	1480 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>

using namespace std;

void construct_network(int H, int W, int K) {
	auto f = [&](int i, int j) { return i * W + j; };

	set<pair<int, int>> st;
	vector<int> v;
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			for (int ii = 0; ii < H; ii++) {
				for (int jj = 0; jj < W; jj++) {
					if (abs(ii - i) + abs(jj - j) != K)
						continue;

					if (st.count({f(i, j), f(ii, jj)})
						|| st.count({f(ii, jj), f(i, j)}))
						continue;

					int x = add_and({f(i, j), f(ii, jj)});

					st.insert({f(i, j), f(ii, jj)});

					v.push_back(x);
				}
			}
		}
	}

	while ((v.size() & (v.size() - 1)) != 0) {
		v.push_back(v.back());
	}

	while (v.size() > 1) {
		vector<int> b;
		for (int i = 0; i < (int)v.size(); i += 2) {
			b.push_back(add_or({v[i], v[i + 1]}));
		}

		v = b;
	}
}

• 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