Submission #622443

#	Time	Username	Problem	Language	Result	Execution time	Memory
622443		TimDee	Vision Program (IOI19_vision)	C++17	0 / 100	1 ms	212 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

void _p7(int h, int w) {

	for (int i=0; i<h; ++i) {
		for (int j=0; j<w; ++j) {

		}
	}

}

void _p3(int h, int w, int k) {

	vector<int> use;
	for (int i=0; i<h; ++i) {
		for (int j=0; j<w; ++j) {
			//if (i+k>=h && j+k>=w) continue;
			vector<int> xored;
			for (int x=0; x<=k; ++x) {
				int y=k-x;
				if (j+y<w && i+x<h) xored.push_back((i+x)*w+j+y);
				if (j-y>=0 && i+x<h) xored.push_back((i+x)*w+j-y);
			}
			if (!xored.size()) continue;
			int xorpos=add_xor(xored);
			int andpos=add_and({i*w+j,xorpos});
			use.push_back(andpos);
		}
	}
	add_or(use);

}

void construct_network(int h, int w, int k) {

	if (max(h,w)<=30) {
		_p3(h,w,k);
		return;
	}
	if (min(h,w)==1) {
		vector<int> use;
		for (int i=0; i+k<h*w; ++i) {
			int pos=add_and({i,i+k});
			use.push_back(pos);
		}
		add_or(use);
		return;
	}
	vector<int> use;
	for (int x=0; x<=k; ++x) use.push_back(x*w+k-x);
	add_xor(use);

}

• 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