# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
768047 | 3RR0R404 | 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 <bits/stdc++.h>
using namespace std;
vector<int> child(1000,0);
vector<int> label(int n,int k,vector<int> u,vector<int> v)
{
vector<vector<int>> v(n);
vector<int> L(n,0);
int l=0;
set<int> visited;
int dfs(int node,int d)
{
visited.insert(node)
L[node] = l
l++;
int b=0;
for(auto p: v[node])
{
if(viseted.contains(p))
{
continue;
}
child[d] += dfs(p,l)
}
return child[d]+1;
}
for(auto i: v)
{
if(i.size() == 1)
dfs(i,0)
break;
}
return L
}
int find_next_station(int s, int t, vector<int> c)
{
sort(c.begin(),c.end());
if(s+child[s]<t)
{
return c[0];
}
if(s>t)
{
return c[0];
}
return *(upper_bound(c.begin(),c.end(),t)-1);
}