| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1068389 | mc061 | Highway Tolls (IOI18_highway) | C++17 | 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 <bits/stdc++.h>
using namespace std;
#define int long long
int m;
long long ask(const std::vector<int> &w);
long long get(const vector<int>& busy) {
vector<int> q(m, 0);
for (int i : busy) q[i] = 1;
return ask(q);
}
void answer(int s, int t);
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
m = U.size();
vector<int> v(U.size());
iota(v.begin(), v.end(), 0);
vector<vector<int>> full;
int path_le = get(v) / B;
auto rec = [&] (auto&& self, vector<int> now) -> void {
long long here = get(now);
if (here == 1ll*path_le*A) return;
if (here == 1ll*now.size()*B + 1ll*(path_le-now.size())*A) {
full.push_back(now);
return;
}
random_shuffle(now.begin(), now.end());
vector<int> left, right;
for (int i = 0; i < now.size()/2; ++i) {
left.push_back(now[i]);
}
for (int i = now.size()/2; i < now.size(); ++i) {
right.push_back(now[i]);
}
self(self, left);
self(self, right);
};
rec(rec, v);
map<int, int> c;
for (auto& x : full) {
for (int j : x) {
c[U[j]]++;
c[V[j]]++;
}
}
vector<int> vs;
for (auto [x, y] : c) {
if (y == 1) vs.push_back(x);
}
answer(vs[0], vs[1]);
}