제출 #738222

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
738222		NeroZein	Vision Program (IOI19_vision)	C++17	33 / 100	377 ms	1048576 KiB

vision

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

int n, m;

void construct_network(int H, int W, int K) {
	n = H, m = W; 
	vector<pair<int, int>> pairs; 
	auto dis = [&](int i, int j, int ii, int jj) {
		return abs(ii - i) + abs(jj - j);
	};
	vector<vector<int>> vis(n * m, vector<int>(n * m)); 
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			for (int ii = 0; ii < n; ++ii) {
				for (int jj = 0; jj < m; ++jj) {
					if (dis(i, j, ii, jj) == K) {
						int left = i * m + j;
						int right = ii * m + jj;
						if (left > right) swap(left, right); 
						if (!vis[left][right]) {
							pairs.push_back({left, right});
							vis[left][right] = true; 
						}
					}
				}
			}
		}
	}
	int cur = n * m;
	vector<int> ask; 
	for (int i = 0; i < (int) pairs.size(); ++i) {
		vector<int> v; 
		v.push_back(pairs[i].first);
		v.push_back(pairs[i].second); 
		add_and(v); 
		ask.push_back(cur++); 
	}
	if (ask.empty()) {
		ask = vector<int> ({0, 0}); 
		add_xor(ask);
	}
	else {
		add_or(ask); 
	}
}

• 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