# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
883759 | MilosMilutinovic | Towns (IOI15_towns) | 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.
vector<int> vec;
while (ids.size() > 1) {
vector<int> new_ids;
for (int i = 0; i + 1 < (int) ids.size(); i += 2) {
if (Diff(ids[i], ids[i + 1])) {
// ...
} else {
Merge(ids[i], ids[i + 1]);
new_ids.push_back(ids[i]);
}
}
swap(ids, new_ids);
}
if (ids.empty()) {
return true;
}
int e = ids.back();
iota(par.begin(), par.end(), 0);
sz = vector<int>(n, 1);
for (int i = 0; i < n; i++) {
if (i != Get(i) || i == Get(e)) {
continue;
}
if (!Diff(i, e)) {
Merge(i, e);
}
}
return *max_element(sz.begin(), sz.end()) <= n / 2;