제출 #612336

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

vision

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

using namespace std;

void construct_network(int H, int W, int K) {

	int mx = W*H-1;
	
	vector<vector<bool>> visited(H, vector<bool>(W, 0));
	
	int ni = 0;
	
	for(int i = 0; i < H; i++){
		for(int j = 0; j < W; j++){
			int curr = i*W+j;
			
			for(int a = 0; a <= K; a++){
				int b = K-a;
				
				int pos1 = (i+a)*W+(j+b);
				int pos2 = (i-a)*W+(j+b);
				int pos3 = (i+a)*W+(j-b);
				int pos4 = (i-a)*W+(j-b);
				
				map<int, bool> tested;
				if(pos1 >= 0 && pos1 <= mx && !tested[pos1]) add_and(vector<int>{curr, pos1}), tested[pos1] = true, ni++;
				if(pos2 >= 0 && pos2 <= mx && !tested[pos2]) add_and(vector<int>{curr, pos2}), tested[pos2] = true, ni++;
				if(pos3 >= 0 && pos3 <= mx && !tested[pos3]) add_and(vector<int>{curr, pos3}), tested[pos3] = true, ni++;
				if(pos4 >= 0 && pos4 <= mx && !tested[pos4]) add_and(vector<int>{curr, pos4}), tested[pos4] = true, ni++;
				
				
				
			}
			
			// come trovo le posizioni di distanza K da cord
		}
		
	}
	
	vector<int> OR;
	for(int i = W*H; i < W*H+ni; i++){
		OR.push_back(i);
	}
	
	if(OR.size() != 0)
		add_or(OR);
	else add_not(1);
	
	
}

• 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