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