| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1251942 | alwaus424 | Finding Routers (IOI20_routers) | C++20 | 0 ms | 324 KiB |
#include "routers.h"
using namespace std;
std::vector<int> find_routers(int l, int n, int q) {
std::vector<int> ans(n,0);
if(n ==1) return ans;
int lo = 2,hi = l;
if(hi & 1) hi--;
while (lo<= hi) {
int mid = (lo+hi)/2;
if(mid & 1) mid--;
int res = use_detector(mid);
if(res ==0) lo = mid+2;
else hi = mid-2;
}
ans[1] = lo;
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... | ||||
