| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1296066 | lukaye_19 | Stations (IOI20_stations) | C++20 | 0 ms | 0 KiB |
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
vector<int>labels(n);
for (int i = 0; i < n; i++)
{
labels[i] = i;
}
return labels;
}
int find_next_station(int s, int t, vector <int> c)
{
vector<int>q;
q.push_back(s);
while (!q.empty())
{
int t = q.front();
q.pop_front();
int i1 = (t - 1);
int c1 = i1 / 2;
int i2 = (t * 2);
int c2 = i2 + 1;
for (int i = 0; i < c.size(); i++)
{
if (c[i] == c1 || c[i] == c2)
{
return c[i];
}
}
q.push_back(c1);
q.push_back(c2);
}
}
