Submission #1311964

#TimeUsernameProblemLanguageResultExecution timeMemory
1311964aaaaaaaaStations (IOI20_stations)C++20
0 / 100
392 ms544 KiB
#include <bits/stdc++.h> #include "stations.h" using namespace std; const int mxN = 1005; vector<int> adj[mxN]; int first = -1; bool dfs(int u = 1, int t = -1, int par = -1){ if(u == t) return 1; for(auto it : adj[u]){ if(u ^ it){ if(dfs(it, t, u)) { first = it; return 1; } } } return 0; } std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) { std::vector<int> labels(n); for (int i = 0; i < n; i++) { labels[i] = i; } for(int i = 0; i < (int) u.size(); ++i){ adj[u[i]].push_back(v[i]); adj[v[i]].push_back(u[i]); } return labels; } int find_next_station(int s, int t, std::vector<int> c) { dfs(s, t, -1); return first; }
#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...