Submission #1070442

#	Time	Username	Problem	Language	Result	Execution time	Memory
1070442		ArthuroWich	Vision Program (IOI19_vision)	C++17	33 / 100	165 ms	1772 KiB

vision

#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K) {
	vector<int> ans;
	map<pair<int, int>, int> mp;
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			for (int x = 0; x < H; x++) {
				for (int y = 0; y < W; y++) {
					if (abs(x-i)+abs(y-j) == K && !mp[{min(i*W+j, x*W+y), max(i*W+j, x*W+y)}]) {
						mp[{min(i*W+j, x*W+y), max(i*W+j, x*W+y)}] = 1;
						ans.push_back(add_and({i*W+j, x*W+y}));
					}
				}
			}
		}
	}
	add_or(ans);
}

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