제출 #1229357

#제출 시각아이디문제언어결과실행 시간메모리
1229357Rokas159기지국 (IOI20_stations)C++20
0 / 100
303 ms580 KiB
#include "stations.h" #include <vector> #include <bits/stdc++.h> using namespace std; vector<vector<int>> adj; vector<int> labels; vector<bool> vis; int cnt = 0; void dfs(int v) { vis[v] = true; for (int u : adj[v]) { if (!vis[u]) { dfs(u); } } labels[v] = cnt++; } std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { adj.assign(n, {}); labels.resize(n); vis.assign(n, false); cnt = 0; for (int i = 0; i < u.size(); i++) { adj[u[i]].push_back(v[i]); adj[v[i]].push_back(u[i]); } dfs(0); return labels; } int find_next_station(int s, int t, std::vector<int> c) { auto upper = lower_bound(c.begin(), c.end(), t); if (upper == c.end()) { upper--; } return *upper; }
#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...