| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1200450 | aykhn | Finding Routers (IOI20_routers) | C++20 | 1 ms | 328 KiB |
#include "routers.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_routers(int L, int n, int q)
{
vector<int> res = {0};
while (res.size() < n)
{
int l = 0, r = L - res.back();
while (l < r)
{
int mid = (l + r + 1) >> 1;
if (use_detector(res.back() + mid) == (int)res.size() - 1) l = mid;
else r = mid - 1;
}
res.push_back(res.back() + 2 * l);
}
return res;
}
| # | 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... | ||||
