Submission #614012

#TimeUsernameProblemLanguageResultExecution timeMemory
614012Dan4LifeStations (IOI20_stations)C++17
0 / 100
1 ms324 KiB
#include "stations.h" #include <bits/stdc++.h> using namespace std; #define pb push_back vector<int> adj[1001], col; int lab = 0; void dfs(int s, int p=-1){ col[s]=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,0); lab = 0; col.clear(); for(int i = 0; i < n; i++) adj[i].clear(); for (int i = 0; i < n-1; 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) continue; dfs(i); return col; } } int find_next_station(int s, int t, vector<int> c){ if(c.size()==1)return c[0]; if(s<t) return c[1]; return c[0]; }

Compilation message (stderr)

stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:25:1: warning: control reaches end of non-void function [-Wreturn-type]
   25 | }
      | ^
#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...