Submission #1310911

#TimeUsernameProblemLanguageResultExecution timeMemory
1310911hmms127Stations (IOI20_stations)C++20
5 / 100
400 ms564 KiB
#include "stations.h" #include <vector> #include<bits/stdc++.h> #define pb push_back using namespace std; const int N=1e3+5; vector<int>labels; vector<vector<int>>adj; int cnt=0; void dfs(int node,int par){ labels[node]=cnt++; for(auto it:adj[node])if(it!=par)dfs(it,node); } std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { labels.resize(n); adj.assign(n,{}); cnt=0; for(int i=0;i<n-1;i++){ adj[u[i]].pb(v[i]); adj[v[i]].pb(u[i]); } for(int i=0;i<n;i++){ if(adj[i].size()!=1)continue; dfs(i,-1); break; } return labels; } int find_next_station(int s, int t, std::vector<int> c) { return(s<t ? c.back():c[0]); }
#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...