답안 #39842 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
39842	2018-01-20T21:53:51 Z	MladenP	Network (BOI15_net)	C++14	63 / 100	8 ms	13228 KB

#include<bits/stdc++.h>
#define STIZE(x) fprintf(stderr, "STIZE%d\n", x);
#define PRINT(x) fprintf(stderr, "%s = %d\n", #x, x);
#define NL(x) printf("%c", " \n"[(x)]);
#define lld long long
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF LLONG_MAX
#define INF INT_MAX
#define EPS 1e-9
using namespace std;
#define MAXN 200010
int n, root, centroid;
int deg[MAXN];
int brlist[MAXN];
set<int> leaf;
vector<int> adj[MAXN];
int dfs1(int cur, int pret) {
    if(brlist[cur] != 0) return brlist[cur];
    if(leaf.count(cur)) return brlist[cur] = 1;
    for(auto x : adj[cur]) {
        if(x != pret) brlist[cur] += dfs1(x, cur);
    }
    return brlist[cur];
}
int dfs2(int cur, int pret) {
    int maxi = 0;
    for(auto x : adj[cur]) {
        if(!leaf.count(x) && brlist[x] >= brlist[maxi] && x != pret) maxi = x;
    }
    if(brlist[maxi] > sz(leaf)-sz(leaf)/2) return dfs2(maxi, cur);
    else return cur;
}
int susedi;
vector<int> lisce[MAXN];
void dfs3(int cur, int pret) {
    if(leaf.count(cur)) {
        lisce[susedi].pb(cur);
        return;
    }
    for(auto x : adj[cur]) {
        if(x != pret) dfs3(x, cur);
        if(cur == centroid) susedi++;
    }
}
priority_queue<pii> pq;
int main() {
    scanf("%d", &n);
    if(n <= 2) return printf("1\n1 %d", n), 0;
    for(int i = 0; i < n-1; i++) {
        int x, y; scanf("%d%d", &x, &y);
        adj[x].pb(y);
        adj[y].pb(x);
        deg[x]++; deg[y]++;
    }
    for(int i = 1; i <= n; i++) {
        if(deg[i] == 1) leaf.insert(i);
        else root = i;
    }
    dfs1(root, 0);
    centroid = dfs2(root, 0);
    dfs3(centroid, 0);
    for(int i = 0; i < susedi; i++) {
        pq.push({sz(lisce[i]), i});
    }
    printf("%d\n", sz(leaf)-sz(leaf)/2);
    while(sz(pq) > 1) {
        pii vrh1 = pq.top(); pq.pop();
        pii vrh2 = pq.top(); pq.pop();
        int komp1 = vrh1.se, komp2 = vrh2.se;
        int rep1 = vrh1.fi, rep2 = vrh2.fi;
        printf("%d %d\n", lisce[komp1][--rep1], lisce[komp2][--rep2]);
        if(rep1) pq.push({rep1, komp1});
        if(rep2) pq.push({rep2, komp2});
    }
    if(pq.size() == 1) {
        int komp = pq.top().se;
        printf("%d %d\n", lisce[komp][0], centroid);
    }
    return 0;
}

Compilation message

net.cpp: In function 'int main()':
net.cpp:52:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
net.cpp:55:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int x, y; scanf("%d%d", &x, &y);
                                        ^

Subtask #1
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	12964 KB	Output is correct
2	Correct	1 ms	12964 KB	Output is correct
3	Correct	1 ms	12964 KB	Output is correct
4	Correct	0 ms	12964 KB	Output is correct
5	Correct	1 ms	12964 KB	Output is correct
6	Correct	7 ms	12964 KB	Output is correct
7	Correct	7 ms	12964 KB	Output is correct
8	Correct	0 ms	12964 KB	Output is correct
9	Correct	3 ms	12964 KB	Output is correct
10	Correct	0 ms	12964 KB	Output is correct
11	Correct	3 ms	12964 KB	Output is correct
12	Correct	0 ms	12964 KB	Output is correct
13	Correct	1 ms	12964 KB	Output is correct
14	Correct	0 ms	12964 KB	Output is correct
15	Correct	4 ms	12964 KB	Output is correct
16	Correct	3 ms	12964 KB	Output is correct
17	Correct	7 ms	12964 KB	Output is correct
18	Correct	0 ms	12964 KB	Output is correct
19	Correct	3 ms	12964 KB	Output is correct
20	Correct	0 ms	12964 KB	Output is correct

Subtask #2
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	12964 KB	Output is correct
2	Correct	1 ms	12964 KB	Output is correct
3	Correct	1 ms	12964 KB	Output is correct
4	Correct	0 ms	12964 KB	Output is correct
5	Correct	1 ms	12964 KB	Output is correct
6	Correct	7 ms	12964 KB	Output is correct
7	Correct	7 ms	12964 KB	Output is correct
8	Correct	0 ms	12964 KB	Output is correct
9	Correct	3 ms	12964 KB	Output is correct
10	Correct	0 ms	12964 KB	Output is correct
11	Correct	3 ms	12964 KB	Output is correct
12	Correct	0 ms	12964 KB	Output is correct
13	Correct	1 ms	12964 KB	Output is correct
14	Correct	0 ms	12964 KB	Output is correct
15	Correct	4 ms	12964 KB	Output is correct
16	Correct	3 ms	12964 KB	Output is correct
17	Correct	7 ms	12964 KB	Output is correct
18	Correct	0 ms	12964 KB	Output is correct
19	Correct	3 ms	12964 KB	Output is correct
20	Correct	0 ms	12964 KB	Output is correct
21	Correct	4 ms	12964 KB	Output is correct
22	Correct	0 ms	13228 KB	Output is correct
23	Correct	0 ms	13228 KB	Output is correct
24	Correct	3 ms	13228 KB	Output is correct
25	Correct	0 ms	13096 KB	Output is correct
26	Correct	2 ms	13096 KB	Output is correct
27	Correct	0 ms	13096 KB	Output is correct
28	Correct	8 ms	13096 KB	Output is correct
29	Correct	3 ms	13096 KB	Output is correct
30	Correct	0 ms	12964 KB	Output is correct
31	Correct	3 ms	13096 KB	Output is correct
32	Correct	1 ms	12964 KB	Output is correct
33	Correct	4 ms	12964 KB	Output is correct
34	Correct	3 ms	12964 KB	Output is correct
35	Correct	7 ms	12964 KB	Output is correct
36	Correct	1 ms	12964 KB	Output is correct
37	Correct	0 ms	12964 KB	Output is correct
38	Correct	2 ms	12964 KB	Output is correct
39	Correct	0 ms	12964 KB	Output is correct
40	Correct	1 ms	12964 KB	Output is correct
41	Correct	4 ms	12964 KB	Output is correct
42	Correct	1 ms	13096 KB	Output is correct
43	Correct	8 ms	13096 KB	Output is correct
44	Correct	0 ms	12964 KB	Output is correct
45	Correct	6 ms	12964 KB	Output is correct
46	Correct	1 ms	13096 KB	Output is correct
47	Correct	0 ms	12964 KB	Output is correct
48	Correct	3 ms	12964 KB	Output is correct
49	Correct	2 ms	13096 KB	Output is correct
50	Correct	0 ms	12964 KB	Output is correct
51	Correct	0 ms	12964 KB	Output is correct
52	Correct	1 ms	12964 KB	Output is correct
53	Correct	0 ms	12964 KB	Output is correct
54	Correct	0 ms	12964 KB	Output is correct
55	Correct	8 ms	12964 KB	Output is correct
56	Correct	7 ms	12964 KB	Output is correct
57	Correct	0 ms	13096 KB	Output is correct
58	Correct	1 ms	13096 KB	Output is correct

Subtask #3
0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	12964 KB	Output is correct
2	Correct	1 ms	12964 KB	Output is correct
3	Correct	1 ms	12964 KB	Output is correct
4	Correct	0 ms	12964 KB	Output is correct
5	Correct	1 ms	12964 KB	Output is correct
6	Correct	7 ms	12964 KB	Output is correct
7	Correct	7 ms	12964 KB	Output is correct
8	Correct	0 ms	12964 KB	Output is correct
9	Correct	3 ms	12964 KB	Output is correct
10	Correct	0 ms	12964 KB	Output is correct
11	Correct	3 ms	12964 KB	Output is correct
12	Correct	0 ms	12964 KB	Output is correct
13	Correct	1 ms	12964 KB	Output is correct
14	Correct	0 ms	12964 KB	Output is correct
15	Correct	4 ms	12964 KB	Output is correct
16	Correct	3 ms	12964 KB	Output is correct
17	Correct	7 ms	12964 KB	Output is correct
18	Correct	0 ms	12964 KB	Output is correct
19	Correct	3 ms	12964 KB	Output is correct
20	Correct	0 ms	12964 KB	Output is correct
21	Correct	4 ms	12964 KB	Output is correct
22	Correct	0 ms	13228 KB	Output is correct
23	Correct	0 ms	13228 KB	Output is correct
24	Correct	3 ms	13228 KB	Output is correct
25	Correct	0 ms	13096 KB	Output is correct
26	Correct	2 ms	13096 KB	Output is correct
27	Correct	0 ms	13096 KB	Output is correct
28	Correct	8 ms	13096 KB	Output is correct
29	Correct	3 ms	13096 KB	Output is correct
30	Correct	0 ms	12964 KB	Output is correct
31	Correct	3 ms	13096 KB	Output is correct
32	Correct	1 ms	12964 KB	Output is correct
33	Correct	4 ms	12964 KB	Output is correct
34	Correct	3 ms	12964 KB	Output is correct
35	Correct	7 ms	12964 KB	Output is correct
36	Correct	1 ms	12964 KB	Output is correct
37	Correct	0 ms	12964 KB	Output is correct
38	Correct	2 ms	12964 KB	Output is correct
39	Correct	0 ms	12964 KB	Output is correct
40	Correct	1 ms	12964 KB	Output is correct
41	Correct	4 ms	12964 KB	Output is correct
42	Correct	1 ms	13096 KB	Output is correct
43	Correct	8 ms	13096 KB	Output is correct
44	Correct	0 ms	12964 KB	Output is correct
45	Correct	6 ms	12964 KB	Output is correct
46	Correct	1 ms	13096 KB	Output is correct
47	Correct	0 ms	12964 KB	Output is correct
48	Correct	3 ms	12964 KB	Output is correct
49	Correct	2 ms	13096 KB	Output is correct
50	Correct	0 ms	12964 KB	Output is correct
51	Correct	0 ms	12964 KB	Output is correct
52	Correct	1 ms	12964 KB	Output is correct
53	Correct	0 ms	12964 KB	Output is correct
54	Correct	0 ms	12964 KB	Output is correct
55	Correct	8 ms	12964 KB	Output is correct
56	Correct	7 ms	12964 KB	Output is correct
57	Correct	0 ms	13096 KB	Output is correct
58	Correct	1 ms	13096 KB	Output is correct
59	Runtime error	5 ms	12964 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
60	Halted	0 ms	0 KB	-

답안 #39842

Compilation message

Subtask #1 18.0 / 18.0

Subtask #2 45.0 / 45.0

Subtask #3 0 / 37.0

Subtask #1
18.0 / 18.0

Subtask #2
45.0 / 45.0

Subtask #3
0 / 37.0