# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
306597 | chubyxdxd | Stations (IOI20_stations) | C++14 | 961 ms | 760 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 <iostream>
#include <vector>
using namespace std;
vector<int> label(int n, int k,vector<int> u,vector<int> v) {
int in[n+10];
for(int i=0;i<n;i++)in[i]=0;
for(int i=0;i<n;i++){
in[v[i]]++;
in[u[i]]++;
}
int piv=0;
for(int i=0;i<n;i++){
if(in[i]==1){
piv=i;
break;
}
}
//cout<<piv<<endl;
vector<int> gg;
gg.push_back(piv);
for(int i=0;i<n-1;i++){
for(int j=0;j<u.size();j++){
if(u[j]==piv){
gg.push_back(v[j]);
piv=v[j];
break;
}
}
}
if(gg.size()==1){
for(int i=0;i<n-1;i++){
for(int j=0;j<u.size();j++){
if(v[j]==piv){
gg.push_back(u[j]);
piv=u[j];
break;
}
}
}
}
//for(auto i:gg)cout<<i<<" ";
//cout<<endl;
vector<int> labels(n);
for(int i=0;i<n;i++){
//cout<<gg[i]<<" ";
labels[gg[i]]=i;
}
//cout<<endl;
return labels;
}
int find_next_station(int s, int t,vector<int> c) {
if(t<s)return s-1;
else return s+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... |