# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305000 | Pajaraja | Stations (IOI20_stations) | C++17 | 1228 ms | 1280 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 <bits/stdc++.h>
#define MAXN 1007
using namespace std;
static int lb[MAXN],t;
static vector<int> g[MAXN];
void dfs(int s,int f,int d)
{
if(!d) lb[s]=t++;
for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) dfs(g[s][i],s,d^1);
if(d) lb[s]=t++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
for(int i=0;i<n-1;i++) g[u[i]].push_back(v[i]);
for(int i=0;i<n-1;i++) g[v[i]].push_back(u[i]);
dfs(0,0,0); t=0;
for(int i=0;i<n;i++) g[i].clear();
std::vector<int> labels(n);
for (int i = 0; i < n; i++) labels[i] = lb[i];
return labels;
}
int find_next_station(int s, int t, std::vector<int> c)
{
if(s<c[0])
{
sort(c.begin(),c.end());
vector<int> aux;
for(int i=0;i+1<c.size();i++) aux.push_back(c[i]);
if(c.size()==1) return c[0];
if(s==0) aux.push_back(c[c.size()-1]);
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... |