제출 #989290

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
989290		PagodePaiva	Vision Program (IOI19_vision)	C++17	14 / 100	5 ms	1256 KiB

vision

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

using namespace std;

void construct_network(int h, int w, int k) {
	vector <int> linha;
	for(int i = 0;i < h;i++){
		vector <int> v;
		for(int j = 0;j < w;j++){		
			v.push_back(i*w+j);
		}
		linha.push_back(add_xor(v));
	}
	vector <int> coluna;
	for(int j = 0;j < w;j++){
		vector <int> v;
		for(int i = 0;i < h;i++){
			v.push_back(i*w+j);
		}
		coluna.push_back(add_xor(v));
	}
	int l = add_not(add_or(linha));
	int c = add_not(add_or(coluna));
	vector <int> aux;
	for(int i = 0;i < w-1;i++){
		aux.push_back(add_and({coluna[i], coluna[i+1]}));
	}
	int ll = (aux.size() == 0 ? -1 : add_or(aux));
	aux.clear();
	for(int i = 0;i < h-1;i++){
		aux.push_back(add_and({linha[i], linha[i+1]}));
	}
	int cc = (aux.size() == 0 ? -1 : add_or(aux));
	if(ll == -1) add_and({c, cc});
	else if(cc == -1) add_and({l, ll});
	else add_or({add_and({l, ll}), add_and({c, cc})});
	return;
}

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