제출 #330592

#제출 시각아이디문제언어결과실행 시간메모리
330592Sho10Network (BOI15_net)C++14
100 / 100
537 ms52984 KiB
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10 #define ll long long #define double long double #pragma GCC optimize("O3") #pragma GCC optimize("Ofast") #define all(a) (a).begin(), (a).end() #define f first #define s second #define pb push_back #define mp make_pair #define pi pair #define rc(s) return cout<<s,0 #define endl '\n' #define mod (10*10*10*10*10*10*10*10*10+7) #define PI 3.14159265359 #define MAXN 100005 #define INF 1000000005 #define LINF 1000000000000000005ll #define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); using namespace std; ll n; vector<ll>g[500005]; vector<ll>leaf; void dfs(ll node,ll par){ if(g[node].size()==1){ leaf.pb(node); } for(auto it : g[node]){ if(it==par){ continue; }else { //cnt++; dfs(it,node); } } } int32_t main(){ CODE_START; cin>>n; for(ll i=1;i<=n-1;i++) { ll x,y; cin>>x>>y; g[x].pb(y); g[y].pb(x); } ll cnt=0; for(ll i=1;i<=n;i++) { if(g[i].size()!=1){ dfs(i,0); break; } } cout<<(leaf.size()+1)/2<<endl; for(ll i=0;i<leaf.size()/2;i++) { cout<<leaf[i]<<' '<<leaf[i+leaf.size()/2]<<endl; } if(leaf.size()%2){ cout<<leaf[0]<<' '<<leaf.back()<<endl; } }

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

net.cpp: In function 'int32_t main()':
net.cpp:56:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 | for(ll i=0;i<leaf.size()/2;i++)
      |            ~^~~~~~~~~~~~~~
net.cpp:47:4: warning: unused variable 'cnt' [-Wunused-variable]
   47 | ll cnt=0;
      |    ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...