Submission #385626

#TimeUsernameProblemLanguageResultExecution timeMemory
385626Ahmadsm2005Stations (IOI20_stations)C++14
0 / 100
2150 ms2097156 KiB
#include<bits/stdc++.h> #include "stations.h" using namespace std; int C; vector<vector<int>>edges(1001); vector<int>labels; void DFS(int v,int u=-1){ labels[v]=C; C++; for(int i=0;i<edges[v].size();i++) if(edges[v][i]!=u) DFS(edges[v][i],v); } vector<int>label(int n,int k,vector<int>u,vector<int>v){ labels.clear(); labels.resize(n); for(int i=0;i<n;i++){ edges[u[i]].push_back(v[i]),edges[v[i]].push_back(u[i]); } DFS(0); C=0; edges.clear(); return labels; } int find_next_station(int s, int t,vector<int>c){ if(s<t){ int L=0,R=c.size(),mid,BEST=INT_MIN; while(L<R){ mid=(L+R)/2; if(c[mid]<=t) L=mid+1,BEST=max(BEST,mid); else R=mid-1; } return c[BEST]; } return c[0]; }

Compilation message (stderr)

stations.cpp: In function 'void DFS(int, int)':
stations.cpp:10:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 | for(int i=0;i<edges[v].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...