| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1202631 | mii_sunset | Finding Routers (IOI20_routers) | C++20 | 1 ms | 580 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 ara[l+1],temp;
for(int i=0;i<=l;i++){
int k=use_detector(i);
ara[i]=k;
}
for(int i=0;i<=l;i++){
if(ara[i]==0 and ara[i+1]==1){
ans.push_back(i*2);
break;
}
}
for(int i=2;i<=l;i++){
if(ara[i]!=ara[i-1]){
ans.push_back(2*i-2-ans.at(ans.size()-1));
}
}
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... | ||||
