# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
432223 | Amylopectin | Stations (IOI20_stations) | C++14 | 915 ms | 1092 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 <iostream>
#include <vector>
#include "stations.h"
//#include "stub.cpp"
using namespace std;
const int mxn = 2010;
vector <int> pa[mxn] = {};
int clab[mxn] = {},ru = 0;
int re(int cn,int sta,int be)
{
int i,fn;
if(sta == 0)
{
clab[cn] = ru;
ru ++;
}
for(i=0; i<pa[cn].size(); i++)
{
fn = pa[cn][i];
if(fn == be)
{
continue;
}
re(fn,(sta+1)%2,cn);
}
if(sta == 1)
{
clab[cn] = ru;
ru ++;
}
return 0;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
int i,j,f,t;
vector<int> lab(n);
ru = 0;
for(i=0; i<=n; i++)
{
pa[i].clear();
}
for(i=0; i<n-1; i++)
{
f = u[i];
t = v[i];
pa[f].push_back(t);
pa[t].push_back(f);
}
re(0,0,-1);
for (i = 0; i < n; i++)
{
lab[i] = clab[i];
}
return lab;
}
int find_next_station(int s, int t, vector<int> c)
{
int i,j,n = c.size();
if(s == 0)
{
for(i=0; i<n; i++)
{
if(t <= c[i])
{
return c[i];
}
}
return c[n-1];
}
if(s < c[0])
{
if(t < s)
return c[n-1];
for(i=0; i<n-1; i++)
{
if(t <= c[i])
{
return c[i];
}
}
return c[n-1];
}
if(t > s)
return c[0];
for(i=n-1; i>0; i--)
{
if(t >= c[i])
{
return c[i];
}
}
return c[0];
}
//int main()
//{
// cout << "Hello world!" << endl;
// return 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... |