Submission #1230167

#TimeUsernameProblemLanguageResultExecution timeMemory
1230167lioowFinding Routers (IOI20_routers)C++20
0 / 100
1 ms324 KiB
#include "routers.h" #include <vector> #include <cassert> #include <cstdio> #include <algorithm> using namespace std; std::vector<int> find_routers(int le, int n, int q) { vector<int>ans(n); ans[0]=0; for(int i=1;i<=n-1;i++){ int l=ans[i-1]+1; int r=le-1; int an=-1; int lol=-1; while(l<=r){ int mid=(l+r)/2; int nw=use_detector(mid); if(nw>=i){ an=mid; r=mid-1; } else { l=mid+1; } } ans[i]=an; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...