제출 #75937

#제출 시각아이디문제언어결과실행 시간메모리
75937VasiljkoNetwork (BOI15_net)C++14
100 / 100
622 ms152764 KiB
#include <bits/stdc++.h> using namespace std; const int N = 5e5+10; vector<int>leaf; vector<int>v[N]; void dfs(int s,int p){ if(v[s].size()==1){ leaf.push_back(s); } for(int i=0;i<v[s].size();i++){ if(v[s][i]!=p){ dfs(v[s][i],s); } } } int main() { ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr); int n,x,y; cin>>n; for(int i=0;i<n-1;i++){ cin>>x>>y; v[x].push_back(y); v[y].push_back(x); } dfs(1,-1); int k=(int)leaf.size(); if(k%2==0){ cout<<k/2<<"\n"; for(int i=0;i<k/2;i++){ cout<<leaf[i]<<" "<<leaf[i+k/2]<<"\n"; } }else{ cout<<k/2+1<<"\n"; for(int i=0;i<k/2;i++){ cout<<leaf[i]<<" "<<leaf[i+k/2+1]<<"\n"; } cout<<leaf[k/2]<<" "<<1; } return 0; }

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

net.cpp: In function 'void dfs(int, int)':
net.cpp:11:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<v[s].size();i++){
              ~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...