Submission #738212

#TimeUsernameProblemLanguageResultExecution timeMemory
738212NeroZeinVision Program (IOI19_vision)C++17
0 / 100
1 ms212 KiB
#include "vision.h"
#include <bits/stdc++.h> 
using namespace std; 

int n, m;

void construct_network(int H, int W, int K) {
	cin >> n >> m; 
	vector<pair<int, int>> pairs; 
	auto dis = [&](int i, int j, int ii, int jj) {
		return ii - i + jj - j;
	};
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			for (int ii = i; ii < n; ++ii) {
				for (int jj = j; jj < m; ++jj) {
					if (dis(i, j, ii, jj) == K) {
						pairs.push_back({i * m + j, ii * m + jj});
					}
				}
			}
		}
	}
	int cur = n * m;
	vector<int> ask; 
	for (int i = 0; i < (int) pairs.size(); ++i) {
		add_and(vector<int> ({pairs[i].first, pairs[i].second})); 
		ask.push_back(cur++); 
	}
	if (ask.empty()) {
		ask = vector<int> ({0, 0}); 
		add_xor(ask);
	}
	else {
		add_or(ask); 
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...