| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1345244 | dyedhue | Finding Routers (IOI20_routers) | C++20 | 1 ms | 344 KiB |
#include "routers.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_routers(int len, int n, int q)
{
vector<int> ans(n, 0);
for(int i = 1; i < n; i++)
{
int l = ans[i-1], r = len-1;
int bestin;
while(l <= r)
{
int mid = (l+r)/2;
int x = use_detector(mid);
if(x == i-1)
{
bestin = mid;
l = mid + 1;
}
else
{
r = mid -1;
}
}
ans[i] = bestin + bestin - ans[i-1];
}
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... | ||||
