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 "routers.h"
using namespace std;
// l is length
// n is number of routers
// q is max uses of detector
vector<int> find_routers(int l, int n, int q)
{
vector<int> ans(n); // distance of each router i to the origin
if (n == 2)
{
// find position of switch (first point where i = 1) using binary search
int min = 2;
int max = (l / 2) + 1;
while (max - min > 0)
{
int k = (max + min) / 2;
int i = use_detector(k);
if (i == 0)
{
min = k + 1;
}
else
{
max = k;
}
}
ans[1] = min + max - 2;
}
return ans;
}
# | 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... |