Submission #719352

#TimeUsernameProblemLanguageResultExecution timeMemory
719352mseebacherStations (IOI20_stations)C++17
0 / 100
758 ms668 KiB
#include "stations.h" #include <bits/stdc++.h> using namespace std; #define MAXI (int)1e3+10 vector<int> ad[MAXI]; vector<int> labels; int tiefe = 0; void dfs(int x,int e){ labels[x] = tiefe++; for(auto s: ad[x]){ if(s == e) continue; dfs(s,x); } } vector<int> label(int n, int k, vector<int> u, vector<int> v) { labels.assign(n,0); for(int i = 0;i<MAXI;i++) ad[i].clear(); for(int i = 0;i<n-1;i++){ ad[u[i]].push_back(v[i]); ad[v[i]].push_back(u[i]); } for(int i = 0;i<n;i++){ if(ad[i].size() == 1) { dfs(i,-1); break; } } vector<int> dummy = labels; return dummy; } int find_next_station(int s, int t, std::vector<int> c) { if(s > t || !s) return c[0]; return c[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...