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 rep(i,n)for(int i=0;i<int(n);i++)
using namespace std;
typedef long long ll;
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
vector<vector<int>>E(n);
vector<int>deg(n);
rep(i,n-1){
E[u[i]].push_back(v[i]);
E[v[i]].push_back(u[i]);
deg[u[i]]++;
deg[v[i]]++;
}
int s=-1;
rep(i,n){
if(deg[i]==1){s=i;break;}
}
vector<int>vs;
vector<int>labels(n,-1);
rep(i,n){
vs.push_back(s);
labels[s]=i;
for(int u:E[s]){
if(labels[u]==-1){
s=u;break;
}
}
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
for(int u:c){
if((s-u>0)==(s-t>0))return u;
}
return -1;
}
# | 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... |