Submission #1200534

#TimeUsernameProblemLanguageResultExecution timeMemory
1200534AlmontherFinding Routers (IOI20_routers)C++20
0 / 100
4 ms1092 KiB
#include<bits/stdc++.h> #include "routers.h" using namespace std; #define ll long long #define co cout<< // stuff // vector<int>points={0,2,6}; // ll use_detector(ll x){ // ll mn=1e18,ans; // for(int i=0;i<points.size();i++){ // ll dis=abs(x-points[i]); // if(dis<mn) mn=dis,ans=i; // } // return ans; // } std::vector<int> find_routers(int l, int n, int q){ ll point=0,idx=0; ll ans[n+5]={}; map<ll,ll>test; for(int i=0;i<n-1;i++){ ll l=point,r=1e5/2; while(l<r){ ll mid=(l+r+1)/2; test[mid]=use_detector(mid*2); if(test[mid]!=idx) r=mid-1; else l=mid; } point=l+1,idx=test[l+1]; ans[idx]=point*2; } vector<int>v; for(int i=0;i<n;i++) v.push_back(ans[i]); return v; } // int main(){ // if(find_routers(6, 3, 10)!=points) co "mehh"; // else co "yayy"; // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...