Submission #1216579

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216579		brinton	Vision Program (IOI19_vision)	C++20	44 / 100	125 ms	3004 KiB

vision

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

using namespace std;
void construct_network(int H, int W, int K) {

	auto id = [&](int i,int j){
		return i*W+j;
	};
	auto dist = [](int i1,int i2,int j1,int j2){
		return abs(i1-i2)+abs(j1-j2);
	};
	vector<int> good;
	for(int i = 0;i < H;i++){
		for(int j = 0;j < W;j++){
			vector<int> cur;
			for(int pi = 0;pi < H;pi++){
				for(int pj = 0;pj < W;pj++){
					if(dist(i,pi,j,pj) == K){
						cur.push_back(id(pi,pj));
					}
				}
			}
			if(!cur.empty()){
				int a = add_or(cur);
				good.push_back(add_and({a,id(i,j)}));
			}
		}
	}
	if(good.size() > 1) add_or(good);
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19