Submission #705321

#	Time	Username	Problem	Language	Result	Execution time	Memory
705321		anha3k25cvp	Network (BOI15_net)	C++14	0 / 100	1 ms	212 KiB

net

#include <bits/stdc++.h>
#define ll long long
#define dl double
#define st first
#define nd second
#define II pair <int, int>

using namespace std;

const int N = 1 + 1e5;
const int inf = 7 + 1e9;

vector <int> h;
vector <vector <int>> g;

void dfs(int u) {
    for (int v : g[u])
        if (!h[v]) {
            h[v] = h[u] + 1;
            dfs(v);
        }
}

int main() {
#define TASKNAME ""
    ios_base :: sync_with_stdio (0);
    cin.tie (0);
    if ( fopen( TASKNAME".inp", "r" ) ) {
        freopen( TASKNAME".inp", "r", stdin );
        freopen( TASKNAME".out", "w", stdout );
    }
    int n;
    cin >> n;
    g.resize(n + 1);
    for (int i = 1; i < n; i ++) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    h.assign(n + 1, 0);
    h[1] = 1;
    dfs(1);
    vector <II> q;
    q.push_back({1, 1});
    for (int i = 2; i <= n; i ++)
        if (g[i].size() == 1)
            q.push_back({h[i], i});
    sort(q.begin(), q.end());
    int m = q.size();
    vector <II> ans;
    for (int i = 0; i < m / 2; i ++)
    ans.push_back({q[i].nd, q[(m / 2) + i].nd});
    if (m & 1)
        ans.push_back({1, q.back().nd});
    cout << ans.size() << '\n';
    for (auto z : ans)
        cout << z.st << ' ' << z.nd << '\n';
    return 0;
}

Compilation message (stderr)

net.cpp: In function 'int main()':
net.cpp:29:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         freopen( TASKNAME".inp", "r", stdin );
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
net.cpp:30:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |         freopen( TASKNAME".out", "w", stdout );
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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