| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1202573 | mii_sunset | Finding Routers (IOI20_routers) | C++20 | 2096 ms | 328 KiB |
#include "routers.h"
using namespace std;
std::vector<int> find_routers(int l, int n, int q) {
//int idx = use_detector(0);
std::vector<int> ans;
int low=0,high=l,mid=(low+high)/2;
for(;low<=high;){
mid=(low+high)/2;
int k=use_detector(mid);
if(k==1){
high=mid-1;
}
else if(k==0) low=mid+1;
//cout<<mid;
}
ans.push_back(0);
ans.push_back(high*2);
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
