Submission #612346

#	Time	Username	Problem	Language	Result	Execution time	Memory
612346		l_reho	Vision Program (IOI19_vision)	C++14	0 / 100	2 ms	1104 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;
	vector<int> positions;
	
	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]) positions.push_back(add_and(vector<int>{curr, pos1})), tested[pos1] = true, ni++;
				if(pos2 >= 0 && pos2 <= mx && !tested[pos2]) positions.push_back(add_and(vector<int>{curr, pos2})), tested[pos2] = true, ni++;
				if(pos3 >= 0 && pos3 <= mx && !tested[pos3]) positions.push_back(add_and(vector<int>{curr, pos3})), tested[pos3] = true, ni++;
				if(pos4 >= 0 && pos4 <= mx && !tested[pos4]) positions.push_back(add_and(vector<int>{curr, pos4})), tested[pos4] = true, ni++;
				
				
				
			}
			
			// come trovo le posizioni di distanza K da cord
		}
		
	}
	
	add_or(positions);
	
	
	
}

• 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