# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
784913 | Boas | Finding Routers (IOI20_routers) | C++17 | 1 ms | 276 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 "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;
}
}
if (1 >= ans.size() || 1 < 0)
throw;
ans[1] = min + max - 2;
}
else
{
for (int i = 1; i < n; i++)
{
if (i - 1 >= ans.size() || i - 1 < 0)
throw;
int locMin = ans[i - 1] + 2;
int locMax = l - (2 * (n - 1 - i));
if (locMin == locMax)
{
ans[i] = locMin;
continue;
}
int sMin = locMin;
int sMax = ((ans[i - 1] + locMax) / 2) + 1;
while (sMax - sMin > 0)
{
int k = (sMax + sMin) / 2;
int diff = sMax - sMin;
k = sMin + 0.2 * diff; // alternative
int detectorIndex = use_detector(k);
if (detectorIndex == i - 1)
{
sMin = k + 1;
}
else
{
sMax = k;
}
}
int mid = sMin - 1;
ans[i] = mid + (mid - ans[i - 1]);
}
}
return ans;
}
Compilation message (stderr)
# | 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... |