Submission #424202

#TimeUsernameProblemLanguageResultExecution timeMemory
424202OttoTheDinoStations (IOI20_stations)C++17
0 / 100
1 ms760 KiB
#include "stations.h" #include <bits/stdc++.h> using namespace std; #define rep(i,s,e) for (int i = s; i <= e; ++i) #define pb push_back typedef vector<int> vi; const int mxn = 2e4; int id, res[mxn]; vi neibs[mxn]; void dfs (int u, int prev) { for (int v : neibs[u]) { if (v==prev) continue; dfs (v, u); } res[u]=id++; } vi label (int n, int k, vi u, vi v) { rep (i,0,n-2) { neibs[u[i]].pb(v[i]); neibs[v[i]].pb(u[i]); } dfs (0,-1); vi L(n); rep (i,0,n-1) L[i] = res[i]; return {-1}; //return L; } int find_next_station (int s, int t, vi c) { sort(c.begin(), c.end()); for (int v : c) if (v>=t) return v; return c.back(); }
#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...