제출 #415655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
415655		AmineTrabelsi	Vision Program (IOI19_vision)	C++14	12 / 100	66 ms	1140 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K) {
	// add_and(vector);
	// add_or(vector);
	// add_xor(vector);
	// add_not(int);
	auto cell = [&](int x,int y) -> int {
		return x*W+y;
	};
	vector<int> que;
	for(int i=0;i<H;i++){
		for(int j=0;j<W;j++){
			for(int x=0;x<=K ;x++){
				int a = x,b = K-x;
				if(i+a < H && j+b < W){
					int ni = i+a, nj = j+b;
					cerr<<cell(i,j)<<"::"<<cell(ni,nj)<<'\n';
					que.push_back(add_and({cell(i,j),cell(ni,nj)}));
				}else if(i+a < H && j-b >= 0){
					int ni = i+a, nj = j-b;
					cerr<<cell(i,j)<<"::"<<cell(ni,nj)<<'\n';
					que.push_back(add_and({cell(i,j),cell(ni,nj)}));
				}else if(i-a >= 0 && j+b < W){
					int ni = i-a, nj = j+b;
					cerr<<cell(i,j)<<"::"<<cell(ni,nj)<<'\n';
					que.push_back(add_and({cell(i,j),cell(ni,nj)}));
				}
			}
		}
	}
	//cerr<<que.size() << '\n';
	add_or(que);

}

• 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