# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
836419 | unnick | City Mapping (NOI18_citymapping) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "minerals.h"
#include <iostream>
#include <vector>
using namespace std;
int baseline = 0;
bool cpair(int i) {
int tmp = Query(i);
bool tmp2 = tmp == baseline;
baseline = tmp;
return tmp2;
}
vector<int> fst;
vector<int> snd;
void search(bool filled, int l, int h, vector<int> v) {
if (h-l == 1) {
Answer(fst[l], v[0]);
return;
}
int m = (l+h)/2;
vector<int> lv;
vector<int> hv;
for (int i = l; i < m; i++) cpair(fst[i]);
for (int i = 0; i < h-l; i++) {
if (lv.size() == m-l) {
hv.push_back(v[i]);
} else if (hv.size() == h-m) {
lv.push_back(v[i]);
} else if (cpair(v[i]) != filled) {
lv.push_back(v[i]);
} else {
hv.push_back(v[i]);
}
}
search(!filled, l, m, lv);
search(filled, m, h, hv);
}
void Solve(int N) {
int prev = 0;
for (int i = 1; i <= N*2; i++) {
if (cpair(i)) fst.push_back(i);
}
for (int i = 1, j = 0; i <= N*2; i++) {
if (j<N && i == fst[j]) {
j++;
continue;
}
snd.push_back(i);
}
search(true, 0, N, snd);
}