제출 #283127

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
283127		aymanrs	Vision Program (IOI19_vision)	C++14	33 / 100	78 ms	10232 KiB

vision

#include <iostream>
#include <set>
#include <vector>
#include "vision.h"
std::set<std::pair<std::pair<int,int>, std::pair<int, int>>> alreadyTried;
bool valid(int H, int W, int i, int j, int oI, int oJ){
	if(oI < i || (oI == i && oJ < j)){
		if(alreadyTried.find({{oI, oJ}, {i, j}}) != alreadyTried.end()){
			return false;
		} else {
			alreadyTried.insert({{oI, oJ}, {i, j}});
		}
	}  else {
		if(alreadyTried.find({{i, j}, {oI, oJ}}) != alreadyTried.end()){
			return false;
		} else {
			alreadyTried.insert({{i, j}, {oI, oJ}});
		}
	}
	return i >= 0 && i < H && j >= 0 && j < W;
}
void construct_network(int H, int W, int K){
	int ind = H*W, forbidden = -1;
	for(int i = 0;i < H;i++){
		for(int j = 0;j < W;j++){
			for(int x = -K + 1; x < K;x++){
				int y = K - abs(x);
				if(valid(H, W, i+y, j+x, i, j)){
					add_and({i*W+j, (i+y)*W + j+x});
					ind++;
				}
				y=-y;
				if(valid(H, W, i+y, j+x, i, j)){
					add_and({i*W+j, (i+y)*W + j+x});
					ind++;
				}
			}
			if(valid(H, W, i, j+K, i, j)){
				add_and({i*W+j, i*W + j+K});
				ind++;
			}
			if(valid(H, W, i, j-K, i, j)){
				add_and({i*W+j, i*W + j-K});
				ind++;
			}
			if(i == 0 && j == 0){
				std::vector<int> vec;
				for(int i = H*W;i < ind;i++){
					vec.push_back(i);
				}
				if(!vec.empty()){
					forbidden = ind;
					add_or(vec);
					ind++;
				}
			}
		}
	}
	std::vector<int> vec;
	for(int i = H*W;i < ind;i++){
		if(i != forbidden) vec.push_back(i);
	}
	add_or(vec);
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 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