| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 831380 | Trumling | Stations (IOI20_stations) | C++14 | 0 ms | 0 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 "stations.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
typedef long long ll;
#define pb push_back
#define INF 9999999999999999
vector<vector<int>>g;
ll nn;
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
/*
g.assign(n,vector<int>());
for (int i = 0; i < n-1; i++) {
g[u[i]].pb(v[i]);
g[v[i]].pb(u[i]);
}
*/
nn =n;
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)
{
ll mini=INF;
for(auto x:c)
mini=min(x,mini);
if(t<s)
return mini;
queue<int>q;
q.push(s);
int tf=-1;
while(!q.empty())
{
ll curr=q.front();
q.pop();
if(curr*2+1 ==t)
{
tf=0;
break;
}
if(curr*2+2 ==t)
{
tf=1;
break;
}
if(curr*2+1<t)
q.push(curr*2+1);
if(curr*2+2<t)
q.push(curr*2+2);
}
if(tf==-1)
return mini;
if(tf==0)
return s*2+1;
else
return s*2+2;
}