Submission #600861

#	Time	Username	Problem	Language	Result	Execution time	Memory
600861		SeDunion	Vision Program (IOI19_vision)	C++17	8 / 100	1 ms	304 KiB

vision

#include "vision.h"
#include<algorithm>
#include<iostream>
#include<vector>
#include<cmath>

using namespace std;

int dist(int x, int y, int i, int j) {
	return abs(x - i) + abs(y - j);
}

void construct_network(int H, int W, int K) {
	vector<int>Ne;
	vector<int>res;
	for (int x = 0 ; x < H ; ++ x) {
		for (int y = 0 ; y < W ; ++ y) {
			if (x || y) break;
			Ne.clear();
			for (int i = 0 ; i < H ; ++ i) {
				for (int j = 0 ; j < W ; ++ j) {
					if (dist(i, j, x, y) == K) {
						Ne.emplace_back(i * W + j);
					}
				}
			}
			if (Ne.empty()) continue;
			int a = add_or(Ne);
			int b = add_and({x * W + y, a});
			res.emplace_back(b);
		}
	}
	add_or(res);
}

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