#include "bits/stdc++.h"
using namespace std;
vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
vector<int> lab(n);
for (int i = 0; i < n; i++)
lab[i] = i + 1;
return lab;
}
int find_next_station(int s, int t, vector<int> c)
{
int target = t - 1;
for (int x : c)
{
int v = x - 1;
int cur = target;
while (true)
{
if (cur == v)
return x;
if (cur == 0)
break;
cur /= 2;
}
}
for (int x : c)
{
if ((x - 1) == (s - 1) / 2)
return x;
}
return c[0];
}
| # | 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... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |