Submission #402523

#TimeUsernameProblemLanguageResultExecution timeMemory
402523Dan4LifeStations (IOI20_stations)C++17
0 / 100
1265 ms700 KiB
#include "stations.h" #include <bits/stdc++.h> using namespace std; #define pb push_back vector<int> adj[1001], col(1001); int lab = 0; void dfs(int s, int p) { if(col[s]!=-1)return; col[s]=lab; lab++; for(auto u : adj[s]) if(u!=p) dfs(u, s); } vector<int> label(int n, int k, vector<int> a, vector<int> b) { col.resize(n); lab=0; for(int i = 0; i < 1001; i++) adj[i].clear(), col[i]=-1; for (int i = 0; i < n; i++) { adj[a[i]].pb(b[i]); adj[b[i]].pb(a[i]); } for(int i = 0; i < n; i++){ if(adj[i].size()==1){ dfs(i, -1); break; } } return col; } int find_next_station(int s, int t, vector<int> c) { if(c.size()==1)return c[0]; for(int i = 0; i < (int)c.size(); i++) if(c[i]==t)return c[i]; if(t<s)return c[0]; return c[1]; }
#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...