| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 385639 | taulant | Finding Routers (IOI20_routers) | C++17 | 3 ms | 512 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<bits/stdc++.h>
using namespace std;
int use_detector(int);
vector<int> find_routers(int l, int n, int q){
vector<int> ret(n); // ret[0] = 0
for(int i = 1; i < n; ++i){
int lo = ret[i-1], hi = l;
while(lo < hi){
int mid = (lo + hi + 1) / 2;
int x = use_detector(mid);
if(x < i) lo = mid;
else hi = mid - 1;
}
ret[i] = lo + lo - ret[i-1];
}
return ret;
}
| # | 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... | ||||
