# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
380952 | Iwanttobreakfree | Finding Routers (IOI20_routers) | C++17 | 2 ms | 384 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 "routers.h"
#include <vector>
using namespace std;
vector<int> find_routers(int lon, int n, int q) {
vector<int> ans(n);
ans[0]=0;
int l=0,r,encontrados=1;
for(int i=0;i<n-1;i++){
r=lon-(n-encontrados)*2;
int sol;
while(l<=r){
int mid=(r-l)/2+l;
int cerc=use_detector(mid);
if(cerc<i+1){
l=mid+1;
sol=mid;
}
else{
r=mid-1;
}
}
ans[i+1]=2*sol-ans[i];
encontrados++;
l=ans[i+1];
}
return ans;
}
Compilation message (stderr)
# | 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... |