# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
286379 | NONAME | Highway Tolls (IOI18_highway) | C++14 | 224 ms | 262148 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 "highway.h"
int m;
int res[2];
std::vector <int> w;
std::vector <std::pair <int, int> > g[(int)(1e5)], vec;
void dfs(int ve, int pr) {
for (auto to : g[ve]) {
if (to.first == pr)
continue;
vec.push_back(to);
dfs(to.first, ve);
}
}
int poisk(long long total, long long B) {
int l = 0, r = (int)(vec.size()) - 1;
while (l < r) {
int md = (l + r) >> 1;
for (int i = 1; i < (int)(vec.size()); ++i)
w[vec[i].second] = (i <= md);
if (ask(w) == total * B) r = md;
else l = md + 1;
}
return l;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |