제출 #815326

#제출 시각아이디문제언어결과실행 시간메모리
815326PagodePaivaVision Program (IOI19_vision)C++14
8 / 100
1 ms340 KiB
#include "vision.h"
#include<bits/stdc++.h>
#define fr first
#define sc second

using namespace std;

int dist(pair <int,int>a,pair<int,int>b){
	return abs(a.fr-b.fr)+abs(a.sc-b.sc);
}

void construct_network(int H, int W, int K) {
	// std::vector<int> Ns;
	// Ns = {0, 1};
	// int a = add_and(Ns);
	// Ns = {0, a};
	// int b = add_or(Ns);
	// Ns = {0, 1, b};
	// int c = add_xor(Ns);
	// add_not(c);

	int n = H, m = W, k = K;
	int r = n*m;

			for(int i1 = 0;i1 < n;i1++){
				for(int j1 = 0;j1 < m;j1++){
					if(dist({0, 0}, {i1, j1}) == k){
						r = add_and({0, i1*m+j1});
					}
				}
			}

	vector <int> aux;

	for(int i = n*m;i <= r;i++){
		aux.push_back(i);
	}	

	add_or(aux);

	return;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...