Submission #1258932

#TimeUsernameProblemLanguageResultExecution timeMemory
1258932tamzidFinding Routers (IOI20_routers)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h> #include "routers.h" using namespace std; using ll = long long; std::vector<int> find_routers(int l, int n, int q) { vector<int> ans; ans.push_back(0); for(int i=0;i<n-1;++i) { int low = ans.back() + 1, high = l, cc = -1; while(low <= high) { int m = (low + high) / 2; if(use_detector(m) == i) { low = m + 1; } else { cc = m; high = m - 1; } } int dis = ans.back() - cc; --dis; ans.push_back(ans.back() + (dis * 2)); } 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...