# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
641845 | knon0501 | Finding Routers (IOI20_routers) | C++14 | 1 ms | 468 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 <bits/stdc++.h>;
using namespace std;
const int B=150;
int c[1005];
int b[200005];
std::vector<int> find_routers(int l, int n, int q) {
vector<int> ans={0};
// cout<<l<<" "<<n<<" "<<q<<endl;
int j=1;
int prv=0;
for(int i=B ; i<=l ; i+=B){
int x=use_detector(i);
for( ; j<x ; j++){
int lef=prv+1;
int rig=i-1;
if(rig-lef>5*B){
rig-=B;
lef+=B;
}
int k;
while(rig>=lef){
int mid=lef+rig>>1;
int y=use_detector(mid);
if(y<j){
k=mid;
lef=mid+1;
}
else{
rig=mid-1;
}
}
ans.push_back(2*k-ans[j-1]);
prv=ans[j];
}
}
for (; j <n; j++)
{
int lef = prv + 1;
int rig = l;
int k;
while (rig >= lef)
{
int mid = lef + rig >> 1;
int y = use_detector(mid);
if (y < j)
{
k = mid;
lef = mid + 1;
}
else
{
rig = mid - 1;
}
}
ans.push_back(2 * k - ans[j - 1]);
prv = ans[j];
}
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... |