| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 791168 | Pablo_No | Stations (IOI20_stations) | C++17 | 769 ms | 676 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 <algorithm>
#include <vector>
using namespace std;
vector<int> col;
vector<vector<int>> g;
int tim = 0;
int dfsfd(int v, int p, int d)
{
if(g[v].size() == d)
{
return v;
}
for(int u : g[v]) if(u != p)
{
int x = dfsfd(u, v, d);
if(x != -1)
{
return x;
}
}
return -1;
}
void dfs(int v, int p, int d)
{
col[v] = tim;
tim++;
for(int u : g[v]) if(u != p)
{
dfs(u, v, d);
}
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v)
{
tim = 0;
g.assign(n, vector<int>(0));
col.resize(n);
for(int i = 0; i < n-1; i++)
{
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
dfs(dfsfd(1, -1, 1), -1, -1);
return col;
}
int find_next_station(int s, int t, std::vector<int> c) {
sort(c.begin(), c.end());
if(c.size() == 1)
return c[0];
if(t > s)
return c[1];
return c[0];
}
Compilation message (stderr)
| # | 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... | ||||
