Submission #1201619

#TimeUsernameProblemLanguageResultExecution timeMemory
1201619rayan_bdFinding Routers (IOI20_routers)C++20
100 / 100
3 ms584 KiB
#include <bits/stdc++.h> #include "routers.h" using namespace std; std::vector<int> find_routers(int l, int n, int q){ vector<int> ans={0}; map<int,int> seen; for(int i=0;i<n-1;++i){ int st=1,en=l,cmid=0; while(st<=en){ int mid=st+(en-st)/2; int curr=0; if(seen.count(mid)) curr=seen[mid]; else curr=seen[mid]=use_detector(mid); if(curr<=i){ st=mid+1; cmid=mid; }else{ en=mid-1; } } ans.push_back(cmid*2-ans.back()); } 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...