| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1251975 | alwaus424 | Finding Routers (IOI20_routers) | C++20 | 1 ms | 328 KiB |
#include "routers.h"
using namespace std;
std::vector<int> find_routers(int l, int n, int q) {
std::vector<int> ans(n,0);
for(int i = 1;i<n;i++){
int lo =1,hi = l;
while(lo<hi){
int mid = (lo+hi)/2;
int idx = use_detector(mid);
if(idx == 1) hi = mid;
else lo = mid+1;
}
int k = (lo-i)*2;
ans[i] = k;
}
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... | ||||
