Submission #1252013

#TimeUsernameProblemLanguageResultExecution timeMemory
1252013aritro_Finding Routers (IOI20_routers)C++20
70.13 / 100
1 ms328 KiB
#include "routers.h" #include<bits/stdc++.h> using namespace std; /*int use_detector(int x){ int tem; cout<<x; cin>>tem; return tem; }*/ vector<int> find_routers(int mx, int n, int q){ //call with: use_detector(x); vector<int> ans; ans.push_back(0); for(int i=1;i<n;i++){ int cur=0; int l=ans[i-1]+1,r=mx,mid; while(l<=r){ mid=(l+r)/2; int tem=use_detector(mid); if(i<=tem) r=mid-1; else{ if(tem==i-1) cur=mid; l=mid+1; } } ans.push_back((cur*2)-ans[i-1]); //ans.push_back(cur+1); } 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...