| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1252047 | nabeul001 | Finding Routers (IOI20_routers) | C++20 | 1 ms | 320 KiB |
#include "routers.h"
using namespace std;
std::vector<int> find_routers(int l, int n, int q) {
std::vector<int> ans(n,-1);
std::vector<bool> seen(n,false);
int counter=0;
int call = 0;
for(int i = 0; i <= l && counter<n && call < q; i+=2)
{
int pos = use_detector(i);
call++;
int idx = pos-1;
if(!seen[idx])
{
seen[idx] =true;
ans[idx] = i;
counter++;
}
}
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... | ||||
