제출 #1195237

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1195237		nikulid	Vision Program (IOI19_vision)	C++20	0 / 100	1 ms	328 KiB

vision

#include "vision.h"
#include <math.h>
#include <vector>

using namespace std;

int dist(int a, int b, int w){
	int ra, ca, rb, cb;
	ra = a%w;
	rb = b%w;
	ca = a/w;
	cb = b/w;
	return abs(ra-rb)+abs(ca-cb);
}

void construct_network(int H, int W, int K) {
	vector<int> ns;
	vector<int> bigns(0);
	int lastindex = H*W-2;

	// lemma 2: brute force is not sigma. 

	int n=H*W;
	for(int i=0; i<n; i++){
		ns = {i};
		lastindex++;
		add_or(ns); // this is @ lastindex now :p
		for(int j=0; j<n; j++){
			if(j>i && dist(i,j,W)==K){
				ns.push_back(j);
			}
		}
		add_or(ns); // this is @ lastindex+1 :p
		ns = {lastindex, lastindex+1};
		add_and(ns); // this is @ lastindex+2 :P

		bigns.push_back(lastindex+2);
		lastindex+=3;
	}
	add_or(bigns);

}

• 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