# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1095966 | Newtonabc | Stations (IOI20_stations) | C++14 | 627 ms | 684 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;
const int N=1e3+10;
int tmpcase1,cnt=0,root;
vector<int> adj[N],lb;
void dfs(int u,int p){
for(int i=0;i<adj[u].size();i++){
int v=adj[u][i];
if(v!=p) dfs(v,u);
}
lb[u]=cnt++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
lb.resize(n);
cnt=0;
for(int i=0;i<n-1;i++){
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
dfs(0,-1);
for(int i=0;i<n;i++) adj[i].clear();
/*for(int i=0;i<lb.size();i++) cout<<lb[i] <<" ";
cout<<"\n\n\n";*/
return lb;
}
int find_next_station(int s, int t, vector<int> c) {
//for(int i=0;i<c.size();i++) cout<<c[i] <<" ";
//cout<<c.size();
//cout<<"\n";
int ind=lower_bound(c.begin(),c.end(),t)-c.begin();
if(ind==c.size()) ind--;
return c[ind];
}
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... |