oj.uz

Submission #330589

# Submission time Handle Problem Language Result Execution time Memory
330589 2020-11-25T21:13:29 Z Sho10 Network (BOI15_net) C++14
0 / 100
 4 ms 4992 KB 
#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[200005];
vector<ll>leaf;
void dfs(ll node,ll par){
ll cnt=0;
for(auto it : g[node]){
    if(it==par){
        continue;
    }else {
    cnt++;
    dfs(it,node);
    }
}
if(cnt==0){
    leaf.pb(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);
}
dfs(1,0);
ll nr=0;
for(ll i=1;i<=n;i++)
{
    if(g[i].size()>=2){
        nr=i;
        break;
    }
}
if(g[1].size()==1){
    leaf.pb(1);
}
cout<<(leaf.size()+1)/2<<endl;
for(ll i=0;i<leaf.size();i+=2){
    if(i+1<leaf.size())
    cout<<leaf[i]<<' '<<leaf[i+1]<<endl;
}
if(leaf.size()%2)
cout<<leaf[leaf.size()-1]<<' '<<nr<<endl;
}

Compilation message

net.cpp: In function 'int32_t main()':
net.cpp:61: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]
   61 | for(ll i=0;i<leaf.size();i+=2){
      |            ~^~~~~~~~~~~~
net.cpp:62:11: 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]
   62 |     if(i+1<leaf.size())
      |        ~~~^~~~~~~~~~~~

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Incorrect 3 ms 4972 KB Breaking single line is causing network to disconnect.
3 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Incorrect 3 ms 4972 KB Breaking single line is causing network to disconnect.
3 Halted 0 ms 0 KB -

Subtask #3
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Incorrect 3 ms 4972 KB Breaking single line is causing network to disconnect.
3 Halted 0 ms 0 KB -