# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
480000 | stefantaga | Stations (IOI20_stations) | C++14 | 1047 ms | 660 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 <cstdio>
#include <cassert>
#include <map>
#include <vector>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int viz[1505],nr;
vector <int> gr[1505];
void dfs(int x,int tata)
{
viz[x]=nr;
nr++;
for (int i=0;i<gr[x].size();i++)
{
if (gr[x][i]!=tata)
{
dfs(gr[x][i],x);
}
}
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
std::vector<int> labels(n);
for (int i=0;i<n;i++)
{
viz[i]=0;
gr[i].clear();
}
for (int i=0;i<n-1;i++)
{
gr[u[i]].push_back(v[i]);
gr[v[i]].push_back(u[i]);
}
nr=0;
dfs(0,-1);
for (int i=0;i<n;i++)
{
labels[i]=viz[i];
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if (c.size()==1)
{
return c[0];
}
for (int i=0;i<c.size();i++)
{
cout<<c[i]<<" ";
}
cout<<'\n';
int i;
if (s==0)
{
for (i=0;i<c.size()-1;i++)
{
if (c[i]<=t&&t<c[i+1])
{
return c[i];
}
}
return c[c.size()-1];
}
else
{
if (!(c[1]<=t&&t<=c[c.size()-1]))
{
return c[0];
}
for (i=1;i<c.size()-1;i++)
{
if (c[i]<=t&&t<c[i+1])
{
return c[i];
}
}
return 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... |