Submission #401116

#TimeUsernameProblemLanguageResultExecution timeMemory
401116dxz05기지국 (IOI20_stations)C++14
0 / 100
1053 ms652 KiB
#include "stations.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 1011; vector<int> g[MAXN]; int tin[MAXN], timer = 0; void dfs(int v, int p){ tin[v] = timer++; for (int u : g[v]){ if (u != p) dfs(u, v); } } vector<int> label(int n, int k, vector<int> U, vector<int> V) { for (int i = 0; i < n; i++) g[i].clear(); timer = 0; for (int i = 0; i < n - 1; i++){ g[U[i]].push_back(V[i]); g[V[i]].push_back(U[i]); } dfs(0, -1); vector<int> labels(n, 0); for (int i = 0; i < n; i++){ labels[i] = tin[i]; } return labels; } int find_next_station(int s, int t, vector<int> c) { return c[0]; int ans = c[0]; for (int x : c){ if (x <= t && x > ans) ans = x; } return ans; }
#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...