제출 #169007

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
169007		_qVp_	Network (BOI15_net)	C++14	100 / 100	559 ms	59556 KiB

net

#include <bits/stdc++.h>

using namespace std;

const int md = 1e6 + 10;

vector < int > adj[md];
vector < int > leaves;
int n;

void dfs(int u, int par) {
    if (adj[u].size() == 1)
        leaves.push_back(u);
    for(auto v : adj[u]) {
        if (v != par)
            dfs(v, u);
    }
}

int main() {
    //freopen("test.in", "r", stdin);
    ios_base::sync_with_stdio(0);
    cin >> n;
    for(int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    dfs(1, -1);
    int len = leaves.size();
    cout << (len + 1) / 2 << '\n';
    for(int i = 0; i < (len + 1) / 2; i++) 
        cout << leaves[i] << " " << leaves[i + len / 2] << '\n';
    return 0;
}

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