답안 #96021

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
96021 2019-02-05T09:39:56 Z popovicirobert Network (BOI15_net) C++14
100 / 100
819 ms 73436 KB
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44

using namespace std;

const int MAXN = (int) 5e5;

vector <int> g[MAXN + 1];
int weight[MAXN + 1];

void dfs(int nod, int par) {
    weight[nod] = (g[nod].size() == 1);
    for(auto it : g[nod]) {
        if(it != par) {
            dfs(it, nod);
            weight[nod] += weight[it];
        }
    }
}

int getCentroid(int nod, int par, int cnt) {
    for(auto it : g[nod]) {
        if(it != par && weight[it] > cnt / 2) {
            return getCentroid(it, nod, cnt);
        }
    }
    return nod;
}

vector < vector <int> > leaves;
priority_queue < pair <int, int> > pq;
int id[MAXN + 1];

void dfs1(int nod, int par, int cur) {
    int son = 0;
    for(auto it : g[nod]) {
        if(it != par) {
            dfs1(it, nod, cur);
            son++;
        }
    }
    if(son == 0) {
        leaves[cur].push_back(nod);
        id[nod] = cur;
    }
}

int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, n;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n;
    for(i = 1; i < n; i++) {
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    int root;
    for(i = 1; i <= n; i++) {
        if(g[i].size() > 1) {
            root = i;
            break;
        }
    }
    dfs(root, 0);
    root = getCentroid(root, 0, weight[root]);
    int sz = g[root].size();
    leaves.resize(sz);
    for(i = 0; i < sz; i++) {
        dfs1(g[root][i], root, i);
    }
    for(i = 0; i < sz; i++) {
        pq.push({leaves[i].size(), i});
    }
    vector < pair <int, int> > sol;
    int leaf = 0;
    while(pq.size() > 1) {
        int id1 = pq.top().second;
        pq.pop();
        int id2 = pq.top().second;
        pq.pop();
        sol.push_back({leaves[id1].back(), leaves[id2].back()});
        if(leaf == 0) {
            leaf = leaves[id1].back();
        }
        leaves[id1].pop_back();
        leaves[id2].pop_back();
        if(leaves[id1].size()) {
            pq.push({leaves[id1].size(), id1});
        }
        if(leaves[id2].size()) {
            pq.push({leaves[id2].size(), id2});
        }
    }
    if(pq.size()) {
        sol.push_back({leaf, leaves[pq.top().second].back()});
    }
    cout << sol.size() << "\n";
    for(auto it : sol) {
        cout << it.first << " " << it.second << "\n";
    }
    //cin.close();
    //cout.close();
    return 0;
}

Compilation message

net.cpp: In function 'int main()':
net.cpp:74:10: warning: 'root' may be used uninitialized in this function [-Wmaybe-uninitialized]
     root = getCentroid(root, 0, weight[root]);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 12152 KB Output is correct
2 Correct 10 ms 12152 KB Output is correct
3 Correct 10 ms 12024 KB Output is correct
4 Correct 10 ms 12024 KB Output is correct
5 Correct 10 ms 12152 KB Output is correct
6 Correct 10 ms 12152 KB Output is correct
7 Correct 10 ms 12152 KB Output is correct
8 Correct 10 ms 12024 KB Output is correct
9 Correct 9 ms 12024 KB Output is correct
10 Correct 10 ms 12152 KB Output is correct
11 Correct 10 ms 12024 KB Output is correct
12 Correct 11 ms 12152 KB Output is correct
13 Correct 10 ms 12024 KB Output is correct
14 Correct 10 ms 12024 KB Output is correct
15 Correct 12 ms 12024 KB Output is correct
16 Correct 15 ms 12152 KB Output is correct
17 Correct 12 ms 12024 KB Output is correct
18 Correct 12 ms 12152 KB Output is correct
19 Correct 12 ms 12128 KB Output is correct
20 Correct 12 ms 12100 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 12152 KB Output is correct
2 Correct 10 ms 12152 KB Output is correct
3 Correct 10 ms 12024 KB Output is correct
4 Correct 10 ms 12024 KB Output is correct
5 Correct 10 ms 12152 KB Output is correct
6 Correct 10 ms 12152 KB Output is correct
7 Correct 10 ms 12152 KB Output is correct
8 Correct 10 ms 12024 KB Output is correct
9 Correct 9 ms 12024 KB Output is correct
10 Correct 10 ms 12152 KB Output is correct
11 Correct 10 ms 12024 KB Output is correct
12 Correct 11 ms 12152 KB Output is correct
13 Correct 10 ms 12024 KB Output is correct
14 Correct 10 ms 12024 KB Output is correct
15 Correct 12 ms 12024 KB Output is correct
16 Correct 15 ms 12152 KB Output is correct
17 Correct 12 ms 12024 KB Output is correct
18 Correct 12 ms 12152 KB Output is correct
19 Correct 12 ms 12128 KB Output is correct
20 Correct 12 ms 12100 KB Output is correct
21 Correct 12 ms 12024 KB Output is correct
22 Correct 13 ms 12360 KB Output is correct
23 Correct 14 ms 12280 KB Output is correct
24 Correct 11 ms 12280 KB Output is correct
25 Correct 11 ms 12152 KB Output is correct
26 Correct 12 ms 12248 KB Output is correct
27 Correct 13 ms 12152 KB Output is correct
28 Correct 12 ms 12152 KB Output is correct
29 Correct 12 ms 12152 KB Output is correct
30 Correct 11 ms 12152 KB Output is correct
31 Correct 12 ms 12156 KB Output is correct
32 Correct 11 ms 12068 KB Output is correct
33 Correct 12 ms 12124 KB Output is correct
34 Correct 12 ms 12152 KB Output is correct
35 Correct 12 ms 12124 KB Output is correct
36 Correct 12 ms 12152 KB Output is correct
37 Correct 12 ms 12152 KB Output is correct
38 Correct 11 ms 12152 KB Output is correct
39 Correct 12 ms 12152 KB Output is correct
40 Correct 10 ms 12024 KB Output is correct
41 Correct 10 ms 12152 KB Output is correct
42 Correct 12 ms 12152 KB Output is correct
43 Correct 11 ms 12280 KB Output is correct
44 Correct 10 ms 12024 KB Output is correct
45 Correct 10 ms 12152 KB Output is correct
46 Correct 10 ms 12152 KB Output is correct
47 Correct 10 ms 12152 KB Output is correct
48 Correct 10 ms 12152 KB Output is correct
49 Correct 10 ms 12152 KB Output is correct
50 Correct 10 ms 12152 KB Output is correct
51 Correct 10 ms 12152 KB Output is correct
52 Correct 11 ms 12152 KB Output is correct
53 Correct 11 ms 12152 KB Output is correct
54 Correct 12 ms 12152 KB Output is correct
55 Correct 12 ms 12152 KB Output is correct
56 Correct 11 ms 12072 KB Output is correct
57 Correct 12 ms 12152 KB Output is correct
58 Correct 10 ms 12156 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 12152 KB Output is correct
2 Correct 10 ms 12152 KB Output is correct
3 Correct 10 ms 12024 KB Output is correct
4 Correct 10 ms 12024 KB Output is correct
5 Correct 10 ms 12152 KB Output is correct
6 Correct 10 ms 12152 KB Output is correct
7 Correct 10 ms 12152 KB Output is correct
8 Correct 10 ms 12024 KB Output is correct
9 Correct 9 ms 12024 KB Output is correct
10 Correct 10 ms 12152 KB Output is correct
11 Correct 10 ms 12024 KB Output is correct
12 Correct 11 ms 12152 KB Output is correct
13 Correct 10 ms 12024 KB Output is correct
14 Correct 10 ms 12024 KB Output is correct
15 Correct 12 ms 12024 KB Output is correct
16 Correct 15 ms 12152 KB Output is correct
17 Correct 12 ms 12024 KB Output is correct
18 Correct 12 ms 12152 KB Output is correct
19 Correct 12 ms 12128 KB Output is correct
20 Correct 12 ms 12100 KB Output is correct
21 Correct 12 ms 12024 KB Output is correct
22 Correct 13 ms 12360 KB Output is correct
23 Correct 14 ms 12280 KB Output is correct
24 Correct 11 ms 12280 KB Output is correct
25 Correct 11 ms 12152 KB Output is correct
26 Correct 12 ms 12248 KB Output is correct
27 Correct 13 ms 12152 KB Output is correct
28 Correct 12 ms 12152 KB Output is correct
29 Correct 12 ms 12152 KB Output is correct
30 Correct 11 ms 12152 KB Output is correct
31 Correct 12 ms 12156 KB Output is correct
32 Correct 11 ms 12068 KB Output is correct
33 Correct 12 ms 12124 KB Output is correct
34 Correct 12 ms 12152 KB Output is correct
35 Correct 12 ms 12124 KB Output is correct
36 Correct 12 ms 12152 KB Output is correct
37 Correct 12 ms 12152 KB Output is correct
38 Correct 11 ms 12152 KB Output is correct
39 Correct 12 ms 12152 KB Output is correct
40 Correct 10 ms 12024 KB Output is correct
41 Correct 10 ms 12152 KB Output is correct
42 Correct 12 ms 12152 KB Output is correct
43 Correct 11 ms 12280 KB Output is correct
44 Correct 10 ms 12024 KB Output is correct
45 Correct 10 ms 12152 KB Output is correct
46 Correct 10 ms 12152 KB Output is correct
47 Correct 10 ms 12152 KB Output is correct
48 Correct 10 ms 12152 KB Output is correct
49 Correct 10 ms 12152 KB Output is correct
50 Correct 10 ms 12152 KB Output is correct
51 Correct 10 ms 12152 KB Output is correct
52 Correct 11 ms 12152 KB Output is correct
53 Correct 11 ms 12152 KB Output is correct
54 Correct 12 ms 12152 KB Output is correct
55 Correct 12 ms 12152 KB Output is correct
56 Correct 11 ms 12072 KB Output is correct
57 Correct 12 ms 12152 KB Output is correct
58 Correct 10 ms 12156 KB Output is correct
59 Correct 619 ms 44136 KB Output is correct
60 Correct 652 ms 39280 KB Output is correct
61 Correct 13 ms 12152 KB Output is correct
62 Correct 11 ms 12152 KB Output is correct
63 Correct 529 ms 38888 KB Output is correct
64 Correct 14 ms 12664 KB Output is correct
65 Correct 26 ms 14456 KB Output is correct
66 Correct 251 ms 30544 KB Output is correct
67 Correct 745 ms 47744 KB Output is correct
68 Correct 793 ms 50712 KB Output is correct
69 Correct 20 ms 13944 KB Output is correct
70 Correct 159 ms 31300 KB Output is correct
71 Correct 604 ms 73436 KB Output is correct
72 Correct 579 ms 69640 KB Output is correct
73 Correct 140 ms 19508 KB Output is correct
74 Correct 533 ms 37184 KB Output is correct
75 Correct 49 ms 17396 KB Output is correct
76 Correct 566 ms 55892 KB Output is correct
77 Correct 537 ms 56784 KB Output is correct
78 Correct 53 ms 16376 KB Output is correct
79 Correct 819 ms 45428 KB Output is correct
80 Correct 13 ms 12536 KB Output is correct
81 Correct 147 ms 27468 KB Output is correct
82 Correct 660 ms 54372 KB Output is correct
83 Correct 517 ms 37264 KB Output is correct
84 Correct 702 ms 37796 KB Output is correct
85 Correct 667 ms 37676 KB Output is correct
86 Correct 649 ms 39536 KB Output is correct
87 Correct 576 ms 39536 KB Output is correct