제출 #1203103

#제출 시각아이디문제언어결과실행 시간메모리
1203103moha1111Finding Routers (IOI20_routers)C++20
100 / 100
1 ms584 KiB
#include "routers.h" #include "bits/stdc++.h" using namespace std; unordered_map<int , int> askd; int ask(int i) { if(askd.find(i) != askd.end()) return askd[i]; return askd[i] = use_detector(i); } vector<int> find_routers(int l, int n, int q) { vector<int> ans; ans.push_back(0); while(ans.size() < n) { int st = 0 , en = l , i; while(st <= en) { int mid = (st + en) / 2; if(ans.size() - 1 < ask(mid)) en = mid - 1; else st = mid + 1 , i = mid; } ans.push_back(2 * i - 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...