제출 #569270

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
569270		pavement	Vision Program (IOI19_vision)	C++17	12 / 100	9 ms	1200 KiB

vision

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

#define pb push_back

int or_row[205], or_col[205], can_row[205], can_col[205];

void construct_network(int H, int W, int K) {
	int cnt = H * W;
	for (int i = 0; i < H; i++) {
		vector<int> tmp;
		for (int j = 0; j < W; j++)
			tmp.pb(i * W + j);
		add_or(tmp);
		or_row[i] = cnt++;
	}
	for (int j = 0; j < W; j++) {
		vector<int> tmp;
		for (int i = 0; i < H; i++)
			tmp.pb(i * W + j);
		add_or(tmp);
		or_col[j] = cnt++;
	}
	for (int ver = 0; ver <= K; ver++) {
		if (ver >= H || K - ver >= W) continue;
		int ocnt = cnt, tmpp = 0;
		for (int i = 0; i + ver < H; i++) {
			vector<int> tmp = {or_row[i], or_row[i + ver]};
			tmpp++;
			add_and(tmp);
			cnt++;
		}
		vector<int> tmp;
		for (int i = 0; i < tmpp; i++)
			tmp.pb(ocnt + i);
		add_or(tmp);
		can_row[ver] = cnt++;
	}
	for (int hor = 0; hor <= K; hor++) {
		if (hor >= W || K - hor >= H) continue;
		int ocnt = cnt, tmpp = 0;
		for (int i = 0; i + hor < W; i++) {
			vector<int> tmp = {or_col[i], or_col[i + hor]};
			tmpp++;
			add_and(tmp);
			cnt++;
		}
		vector<int> tmp;
		for (int i = 0; i < tmpp; i++)
			tmp.pb(ocnt + i);
		add_or(tmp);
		can_col[hor] = cnt++;
	}
	vector<int> tot;
	for (int ver = 0; ver <= K; ver++) {
		int hor = K - ver;
		if (ver < H && hor < W) {
			vector<int> tmp = {can_row[ver], can_col[hor]};
			add_and(tmp);
			tot.pb(cnt++);
		}
	}
	add_or(tot);
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 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