Submission #305333

#TimeUsernameProblemLanguageResultExecution timeMemory
305333daniel920712Stations (IOI20_stations)C++14
0 / 100
2 ms448 KiB
#include "stations.h" #include <vector> using namespace std; vector < int > Next[1005]; int con[1005]={0}; bool use[1005]={0}; vector<int> labels; void F(int here,int con) { labels[here]=con; use[here]=1; for(auto i:Next[here]) { if(!use[i]) F(i,con+1); } } vector<int> label(int n, int k, vector<int> u, vector<int> v) { int i; for(i=0;i<n;i++) labels.push_back(0); for(int i=1;i<n;i++) { con[u[i]]++; con[v[i]]++; Next[u[i]].push_back(v[i]); Next[v[i]].push_back(u[i]); } for(i=0;i<n;i++) { if(con[i]==1) { F(i,0); break; } } return labels; } int find_next_station(int s, int t, vector<int> c) { if(s<t) return s+1; else return s-1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...