Submission #1063690

#	Time	Username	Problem	Language	Result	Execution time	Memory
1063690		aaaaaarroz	Vision Program (IOI19_vision)	C++17	14 / 100	20 ms	3672 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K) {
	map<pair<int, int>, int> numero;
	int pos = 0;
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			numero[{i, j}] = pos;
			pos++;
		}
	}
	vector<int>filas_or;
	int filas_xor;
	for (int i = 0; i < H; i++) {
		vector<int>prueba;
		for (int j = 0; j < W; j++) {
			prueba.push_back(numero[{i,j}]);
		}
		filas_or.push_back(add_or(prueba));
	}
	filas_xor=add_xor(filas_or);
	vector<int>columnas_or;
	int columnas_xor;
	for (int j = 0; j < W; j++) {
		vector<int>prueba;
		for (int i = 0; i < H; i++) {
			prueba.push_back(numero[{i,j}]);
		}
		columnas_or.push_back(add_or(prueba));
	}
	columnas_xor=add_xor(columnas_or);
	vector<int>fin;
	for(int i=0;i<H-1;i++){
		fin.push_back({add_and({filas_or[i],filas_or[i+1],columnas_xor})});
	}
	for(int i=0;i<W-1;i++){
		fin.push_back({add_and({columnas_or[i],columnas_or[i+1],filas_xor})});
	}
	add_or(fin);
	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