제출 #1149440

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1149440		njoop	Network (BOI15_net)	C++17	0 / 100	1 ms	2628 KiB

net

#include <bits/stdc++.h>

using namespace std;

int n, s, t, l, r;
vector<int> g[100010];
vector<pair<int, int>> leaf;

void dfs(int no, int pa, int di) {
    if(g[no].size() == 1) {
        leaf.push_back({di, no});
        return;
    }
    for(auto i: g[no]) {
        if(i == pa) continue;
        dfs(i, no, di+1);
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for(int i=1; i<n; i++) {
        cin >> s >> t;
        g[s].push_back(t);
        g[t].push_back(s);
    }
    for(int i=1; i<=n; i++) {
        if(g[i].size() > 1) {
            dfs(i, -1, 0);
            break;
        }
    }
    cout << leaf.size()/2 + leaf.size()%2 << "\n";
    l=0, r=leaf.size()-1;
    while(l <= r) {
        if(l == r) cout << leaf[0].second << " " << leaf[l].second << "\n";
        else cout << leaf[l].second << " " << leaf[r].second << "\n";
        l++;
        r--;
    }
    return 0;
}

• Subtask 1: 0 / 18
• Subtask 2: 0 / 45
• Subtask 3: 0 / 37