| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 402137 | victoriad | Finding Routers (IOI20_routers) | C++14 | 1 ms | 332 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "routers.h"
using namespace std;
std::vector<int> find_routers(int l, int n, int q) {
std::vector<int> ans(n);
ans[0]=0;
vector<bool>p(n,false);
p[0]=true;
int x=0;
int c=0;
for (int i = 1; i <= l; i++) {
int y=use_detector(i);
if(y!=x){
p[y]=true;
ans[c+1]=i-ans[c]+1;
c++;
if(y==n-1)break;
}
}
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... | ||||
