Submission #307092

#TimeUsernameProblemLanguageResultExecution timeMemory
307092phathnvFinding Routers (IOI20_routers)C++14
74.40 / 100
1 ms384 KiB
#include "routers.h" #include <bits/stdc++.h> using namespace std; vector <int> find_routers(int l, int n, int q){ vector <int> res; res.push_back(0); int cur = 0; for(int i = 1; i < n; i++){ int mid = cur + 1; while (use_detector(min(l, mid + 128)) == i - 1) mid = min(l, mid + 128); for(int j = 6; j >= 0; j--){ if (mid + (1 << j) > l) continue; if (use_detector(mid + (1 << j)) == i - 1) mid += (1 << j); } int nxt = 2 * mid - cur; res.push_back(nxt); cur = nxt; } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...