제출 #144788

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
144788		Just_Solve_The_Problem	Vision Program (IOI19_vision)	C++17	44 / 100	13 ms	2416 KiB

vision

#include "vision.h"
// #include "grader.cpp"

using namespace std;

int h, w, k;

int get(int x, int y) {
	return x * w + y;
}

bool check(int x, int y) {
	return (0 <= x && x < h && 0 <= y && y < w);
}

void construct_network(int H, int W, int K) {
	h = H; w = W; k = K;
	vector <int> v;
	for (int i = 0; i < h; i++) {
		for (int j = 0; j < w; j++) {
			vector <int> vec;
			int x, y;
			x = i;
			y = j + k;
			while (y != j) {
				if (check(x, y))
					vec.push_back(get(x, y));
				x++;
				y--;
			}
			while (x != i) {
				if (check(x, y))
					vec.push_back(get(x, y));
				x--;
				y--;
			}
			if (vec.empty()) continue;
			v.push_back(add_and({add_or(vec), get(i, j)}));
		}
	}
	add_or(v);
}

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