Submission #198725

#	Time	Username	Problem	Language	Result	Execution time	Memory
198725		Akashi	Vision Program (IOI19_vision)	C++14	0 / 100	9 ms	1908 KiB

vision

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

using namespace std;

struct point{
	int x, y, k;
};

point a, b;

void bin_search(int st, int dr, int n, int m){
	if(st == dr){
		point c;
		c.x = st / m; 
		c.y = st % m;
		c.k = 1;
		
		if(a.k == 0) a = c;
		else b = c;
		
		return ;
	}
	
	int mij = (st + dr) / 2;
	vector <int> left, right;
	
	for(int i = st; i <= mij ; ++i) left.push_back(i);
	for(int i = mij + 1; i <= dr ; ++i) right.push_back(i);
	
	int am_left = add_or(left);
	int am_right = add_or(right);
	
	if(am_left) bin_search(st, mij, n, m);
	if(am_right) bin_search(mij + 1, dr, n, m);
}

void construct_network(int H, int W, int K) {
	bin_search(0, H * W - 1, H, W);

	if(abs(a.x - b.x) + abs(a.y - b.y) == K){
		vector <int> v;
		v.push_back(a.x * W + a.y);
		add_or(v);
	}
	else add_not(a.x * W + a.y);
	

	return ;
}

• 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