Submission #426570

#TimeUsernameProblemLanguageResultExecution timeMemory
426570radaiosm7Finding Routers (IOI20_routers)C++17
0 / 100
1 ms332 KiB
#include <routers.h> #include <bits/stdc++.h> using namespace std; int i, lo, hi, mid; vector<int> find_routers(int l, int n, int q) { vector<int> ans(n); ans[0] = 0; for (i=1; i < n; ++i) { lo = ans[i-1]+2; hi = l; while (lo < hi) { mid = (lo+hi)/2; if (use_detector(mid) == i) { hi = mid; } else { lo = mid+1; } } ans[i] = 2*(mid-1)-ans[i-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...