# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1095708 | Newtonabc | Stations (IOI20_stations) | C++14 | 571 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;
bool case1;
vector<int> adj[N],lb;
void labelcase1(int u,int p){
lb[u]=cnt++;
for(int i=0;i<adj[u].size();i++){
if(adj[u][i]!=p) labelcase1(adj[u][i],u);
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
lb.resize(n);
case1=true;
for(int i=0;i<n-1;i++){
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
for(int i=0;i<n;i++){
if(adj[i].size()>2) case1=false;
if(adj[i].size()==1) tmpcase1=i;
}
if(case1){
labelcase1(tmpcase1,-1);
}
/*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) {
sort(c.begin(),c.end());
if(s<t) return c[1];
return c[0];
}
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... |