제출 #381074

#제출 시각아이디문제언어결과실행 시간메모리
381074BlancaHMFinding Routers (IOI20_routers)C++14
0 / 100
1 ms512 KiB
#include <iostream> #include <vector> #include "routers.h" using namespace std; vector<int> find_routers(int l, int n, int q) { vector<int> positions(n, -1); // Vamos buscando los routers uno a uno positions[0] = 0; if (l&1) l--; int lo, hi, mid, k; for (int i = 1; i < n; i++) { lo = positions[i-1] + 2; hi = l; k = lo; while(lo <= hi) { mid = lo + (hi-lo)/2; if (use_detector(mid) == i-1) { k = mid; lo = mid+1; } else hi = mid-1; } positions[i] = k*2; } return positions; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...