# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
871325 | andrei_boaca | Stations (IOI20_stations) | C++17 | 586 ms | 940 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>
#include <vector>
//#include "stub.cpp"
using namespace std;
vector<int> muchii[1005];
bool use[1005];
int n,k;
vector<int> ord;
void dfs(int nod)
{
use[nod]=1;
ord.push_back(nod);
for(int i:muchii[nod])
if(!use[i])
dfs(i);
}
std::vector<int> label(int N, int K, std::vector<int> u, std::vector<int> v)
{
n=N;
k=K;
vector<int> L;
L.resize(n);
for(int i=0;i<u.size();i++)
{
int a=u[i];
int b=v[i];
muchii[a].push_back(b);
muchii[b].push_back(a);
}
int root=0;
for(int i=0;i<n;i++)
if(muchii[i].size()==1)
{
root=i;
break;
}
dfs(root);
for(int i=0;i<ord.size();i++)
L[ord[i]]=i;
return L;
}
int find_next_station(int s, int t, std::vector<int> c)
{
if(s<t)
{
int maxim=-1;
for(int i:c)
maxim=max(maxim,i);
return maxim;
}
if(s>t)
{
int minim=1e9;
for(int i:c)
minim=min(minim,i);
return minim;
}
}
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... |