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