제출 #429499

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
429499		lakshith_	Vision Program (IOI19_vision)	C++14	0 / 100	25 ms	2324 KiB

vision

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

#define checker(a) cout << "checker reached " << a << "\n"

using namespace std;

int h,w;

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

int getDis(pair<int,int> p1,pair<int,int> p2){
	return abs(p1.first-p2.first)+abs(p1.second-p2.second);
}

void construct_network(int H, int W, int k) {
	h=H,w=W;
	vector<vector<int>> ro,col;
	for(int i=0;i<h;i++){
		ro.push_back(vector<int>());
		for(int j=0;j<w;j++)
			ro[i].push_back(getPos(i,j));
	}
	for(int i=0;i<w;i++){
		col.push_back(vector<int>());
		for(int j=0;j<h;j++)
			col[i].push_back(getPos(j,i));
	}
	
	vector<int> Xor;
	for(vector<int> vec:ro)
		Xor.push_back(add_xor(vec));
	for(vector<int> vec:col)
		Xor.push_back(add_xor(vec));
	
	vector<int> Not;
	for(int a:Xor)
		Not.push_back(add_not(a));
	Xor.clear();
	
	vector<int> Or;
	for(vector<int> vec:ro)
		Or.push_back(add_or(vec));
	for(vector<int> vec:col)
		Or.push_back(add_or(vec));
	
	vector<int> And;
	for(size_t i=0;i<Or.size();i++)
		And.push_back(add_and((vector<int>){Or[i],Not[i]}));
		
	add_or(And);
}

• 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: 0 / 14
• Subtask 8: 0 / 19