제출 #308333

#제출 시각아이디문제언어결과실행 시간메모리
308333chubyxdxdStations (IOI20_stations)C++17
0 / 100
901 ms768 KiB
#include "stations.h" #include <bits/stdc++.h> #include <vector> using namespace std; vector<vector<int>> G; vector<int> gg; void dfs(int node,int pad){ gg.push_back(node); for(auto i:G[node]){ if(i==pad)continue; dfs(i,node); } } vector<int> label(int n, int k,vector<int> u,vector<int> v) { G.clear(); G.assign(n+10,vector<int>()); for(int i=0;i<u.size();i++){ G[u[i]].push_back(v[i]); G[v[i]].push_back(u[i]); } int piv=0; for(int i=0;i<n;i++){ if(G[i].size()==1){ piv=i; break; } } dfs(piv,piv); vector<int> labels(n); for(int i=0;i<n;i++){ labels[gg[i]]=i; } return labels; } int find_next_station(int s, int t, std::vector<int> c) { if(t<s)return min(c[0],c[1]); else return max(c[0],c[1]); }

컴파일 시 표준 에러 (stderr) 메시지

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