| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 831399 | 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
ll nn;
vector<vector<int>>g;
ll here=0;
vector<int>labels;
void dfs(int i,int id,int start,int pre)
{
label[start]=i*nn + id;
for(auto x:g[start])
if(pre!=x)
dfs(i,id+1,x,start);
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
nn=n;
g.assign(n,vector<int>());
labels.assign(n,0);
vector<bool>cnt(n,0);
for (int i = 0; i < n-1; i++) {
g[u[i]].pb(v[i]);
g[v[i]].pb(u[i]);
if(g[u[i]].size()>2)
here=u[i];
if(g[v[i]].size()>2)
here=v[i];
if(g[u[i]].size()==2)
cnt[u[i]]=1;
if(g[v[i]].size()==2)
cnt[v[i]]=1;
}
if(g[here].size()<=2)
for(int i=0;i<n;i++)
if(!cnt[i])
{
here=i;
break;
}
for(int i=0;i<g[here].size();i++)
dfs(i,0,g[here][i],0)
return labels;
}
int find_next_station(int s, int t, vector<int> c)
{
if(c.size()>2)
{
ll j=0;
while(t-(j+nn)+1)
j+=nn;
return j;
}
ll mini=INF;
for(auto x:c)
mini=min(x,mini);
if(t<s)
return mini;
ll j=0;
while(t-(j+nn)+1)
j+=nn;
ll i=0;
while(t-(i+nn)+1)
i+=nn;
if(i==j)
return s+1;
else
return mini;
}