# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
542831 | CasperWong | Stations (IOI20_stations) | C++17 | 2386 ms | 2097152 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>
using namespace std;
typedef long long ll;
vector<ll>vec[1500];
vector<int>lab;
ll tim;
void dfs(ll x,ll p){
lab[x]=tim++;
for(auto i:vec[x]) if(i!=p){
dfs(i,x);
}
}
vector<int>label(int n,int k,vector<int>u,vector<int>v){
for(int i=0;i<n-1;i++){
vec[u[i]].push_back(v[i]);
vec[v[i]].push_back(u[i]);
}
for(int i=0;i<n;i++) lab.push_back(0);
dfs(0,-1);
/*cout<<"lab: ";
for(auto i:lab) cout<<i<<" ";
cout<<endl;*/
return lab;
}
int find_next_station(int s,int t,vector<int>c){
/*cout<<"c: ";
for(auto i:c) cout<<i<<" ";
cout<<endl;
cout<<s<<" "<<t<<endl;*/
if(s<=t){
ll len=c.size();
for(int i=len-1;i>=0;i--) if(c[i]<=t){
//cout<<"return "<<c[i]<<endl;
return c[i];
}
}else{
for(auto i:c) if(i>=t){
//cout<<"return "<<i<<endl;
return i;
}
}
}
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... |