Submission #1230090

#TimeUsernameProblemLanguageResultExecution timeMemory
1230090warrennFinding Routers (IOI20_routers)C++20
0 / 100
1 ms328 KiB
#include<bits/stdc++.h> #include "routers.h" using namespace std; vector<int> find_routers(int l, int n, int qu) { pair<int,int>simpan[n+1]; int lst=1; for(int q=0;q<n;q++){ int l=lst; int r=n; int hmm=-1; while(l<=r){ int mid=(l+r)/2; int idx=use_detector(mid); if(idx!=q){ r=mid-1; } else{ l=mid+1; hmm=mid; } } simpan[q]={lst,hmm}; lst=hmm+1; } vector<int>ans; ans.push_back(0); for(int q=1;q<n;q++){ pair<int,int>prev=simpan[q-1]; pair<int,int>cur=simpan[q]; int sblm=ans.back(); int hihi=cur.first-sblm+prev.second-1; ans.push_back(hihi); } 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...