Submission #674143

#TimeUsernameProblemLanguageResultExecution timeMemory
674143Essa2006Stations (IOI20_stations)C++14
0 / 100
950 ms636 KiB
#include<bits/stdc++.h> using namespace std; vector<int>Vis, new_; vector<vector<int>>A; int time_=0; void dfs(int ind){ Vis[ind]=1, new_[ind]=time_++; for(int i=0;i<A[ind].size();i++) if(!Vis[A[ind][i]]) dfs(A[ind][i]); } vector<int> label(int n, int k, vector<int> u, vector<int> v) { Vis.clear(), A.clear(), new_.clear(); Vis.resize(n), A.resize(n), new_.resize(n); time_=0; for(int i=0;i<n-1;i++) A[u[i]].push_back(v[i]), A[v[i]].push_back(u[i]); for(int i=0;i<n;i++){ if(A[i].size()==1){ dfs(i); break; } } return new_; } int find_next_station(int s, int t, vector<int> c) { return c[(t>s)]; }

Compilation message (stderr)

stations.cpp: In function 'void dfs(int)':
stations.cpp:8:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for(int i=0;i<A[ind].size();i++)
      |                 ~^~~~~~~~~~~~~~
#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...