| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1252043 | 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 last=use_detector(1),f=1;
for(int i=2;i<=l && f<n;){
int curr=use_detector(i);
if(curr==last+1){
p[f]=2*(i-1)-p[f-1];
i=p[f]+1;
f++;
}
else{i++;}
last=curr;
}
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... | ||||
