oj.uz

Submission #39843

# Submission time Handle Problem Language Result Execution time Memory
39843 2018-01-20T21:54:35 Z MladenP Network (BOI15_net) C++14
63 / 100
 2000 ms 92340 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 500010
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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29372 KB Output is correct
2 Correct 6 ms 29372 KB Output is correct
3 Correct 3 ms 29372 KB Output is correct
4 Correct 13 ms 29372 KB Output is correct
5 Correct 9 ms 29372 KB Output is correct
6 Correct 6 ms 29372 KB Output is correct
7 Correct 10 ms 29372 KB Output is correct
8 Correct 3 ms 29372 KB Output is correct
9 Correct 0 ms 29372 KB Output is correct
10 Correct 6 ms 29372 KB Output is correct
11 Correct 13 ms 29372 KB Output is correct
12 Correct 9 ms 29372 KB Output is correct
13 Correct 9 ms 29372 KB Output is correct
14 Correct 6 ms 29372 KB Output is correct
15 Correct 20 ms 29372 KB Output is correct
16 Correct 9 ms 29372 KB Output is correct
17 Correct 3 ms 29372 KB Output is correct
18 Correct 3 ms 29372 KB Output is correct
19 Correct 14 ms 29372 KB Output is correct
20 Correct 3 ms 29372 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29372 KB Output is correct
2 Correct 6 ms 29372 KB Output is correct
3 Correct 3 ms 29372 KB Output is correct
4 Correct 13 ms 29372 KB Output is correct
5 Correct 9 ms 29372 KB Output is correct
6 Correct 6 ms 29372 KB Output is correct
7 Correct 10 ms 29372 KB Output is correct
8 Correct 3 ms 29372 KB Output is correct
9 Correct 0 ms 29372 KB Output is correct
10 Correct 6 ms 29372 KB Output is correct
11 Correct 13 ms 29372 KB Output is correct
12 Correct 9 ms 29372 KB Output is correct
13 Correct 9 ms 29372 KB Output is correct
14 Correct 6 ms 29372 KB Output is correct
15 Correct 20 ms 29372 KB Output is correct
16 Correct 9 ms 29372 KB Output is correct
17 Correct 3 ms 29372 KB Output is correct
18 Correct 3 ms 29372 KB Output is correct
19 Correct 14 ms 29372 KB Output is correct
20 Correct 3 ms 29372 KB Output is correct
21 Correct 8 ms 29372 KB Output is correct
22 Correct 19 ms 29636 KB Output is correct
23 Correct 6 ms 29636 KB Output is correct
24 Correct 13 ms 29636 KB Output is correct
25 Correct 10 ms 29504 KB Output is correct
26 Correct 6 ms 29504 KB Output is correct
27 Correct 3 ms 29504 KB Output is correct
28 Correct 3 ms 29504 KB Output is correct
29 Correct 6 ms 29504 KB Output is correct
30 Correct 6 ms 29372 KB Output is correct
31 Correct 8 ms 29504 KB Output is correct
32 Correct 4 ms 29372 KB Output is correct
33 Correct 12 ms 29372 KB Output is correct
34 Correct 4 ms 29372 KB Output is correct
35 Correct 13 ms 29372 KB Output is correct
36 Correct 6 ms 29372 KB Output is correct
37 Correct 6 ms 29372 KB Output is correct
38 Correct 3 ms 29372 KB Output is correct
39 Correct 3 ms 29372 KB Output is correct
40 Correct 7 ms 29372 KB Output is correct
41 Correct 6 ms 29372 KB Output is correct
42 Correct 7 ms 29504 KB Output is correct
43 Correct 10 ms 29504 KB Output is correct
44 Correct 3 ms 29372 KB Output is correct
45 Correct 6 ms 29372 KB Output is correct
46 Correct 4 ms 29504 KB Output is correct
47 Correct 3 ms 29372 KB Output is correct
48 Correct 6 ms 29372 KB Output is correct
49 Correct 10 ms 29504 KB Output is correct
50 Correct 3 ms 29372 KB Output is correct
51 Correct 3 ms 29372 KB Output is correct
52 Correct 3 ms 29372 KB Output is correct
53 Correct 3 ms 29372 KB Output is correct
54 Correct 7 ms 29372 KB Output is correct
55 Correct 9 ms 29372 KB Output is correct
56 Correct 3 ms 29372 KB Output is correct
57 Correct 9 ms 29504 KB Output is correct
58 Correct 6 ms 29504 KB Output is correct

Subtask #3
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29372 KB Output is correct
2 Correct 6 ms 29372 KB Output is correct
3 Correct 3 ms 29372 KB Output is correct
4 Correct 13 ms 29372 KB Output is correct
5 Correct 9 ms 29372 KB Output is correct
6 Correct 6 ms 29372 KB Output is correct
7 Correct 10 ms 29372 KB Output is correct
8 Correct 3 ms 29372 KB Output is correct
9 Correct 0 ms 29372 KB Output is correct
10 Correct 6 ms 29372 KB Output is correct
11 Correct 13 ms 29372 KB Output is correct
12 Correct 9 ms 29372 KB Output is correct
13 Correct 9 ms 29372 KB Output is correct
14 Correct 6 ms 29372 KB Output is correct
15 Correct 20 ms 29372 KB Output is correct
16 Correct 9 ms 29372 KB Output is correct
17 Correct 3 ms 29372 KB Output is correct
18 Correct 3 ms 29372 KB Output is correct
19 Correct 14 ms 29372 KB Output is correct
20 Correct 3 ms 29372 KB Output is correct
21 Correct 8 ms 29372 KB Output is correct
22 Correct 19 ms 29636 KB Output is correct
23 Correct 6 ms 29636 KB Output is correct
24 Correct 13 ms 29636 KB Output is correct
25 Correct 10 ms 29504 KB Output is correct
26 Correct 6 ms 29504 KB Output is correct
27 Correct 3 ms 29504 KB Output is correct
28 Correct 3 ms 29504 KB Output is correct
29 Correct 6 ms 29504 KB Output is correct
30 Correct 6 ms 29372 KB Output is correct
31 Correct 8 ms 29504 KB Output is correct
32 Correct 4 ms 29372 KB Output is correct
33 Correct 12 ms 29372 KB Output is correct
34 Correct 4 ms 29372 KB Output is correct
35 Correct 13 ms 29372 KB Output is correct
36 Correct 6 ms 29372 KB Output is correct
37 Correct 6 ms 29372 KB Output is correct
38 Correct 3 ms 29372 KB Output is correct
39 Correct 3 ms 29372 KB Output is correct
40 Correct 7 ms 29372 KB Output is correct
41 Correct 6 ms 29372 KB Output is correct
42 Correct 7 ms 29504 KB Output is correct
43 Correct 10 ms 29504 KB Output is correct
44 Correct 3 ms 29372 KB Output is correct
45 Correct 6 ms 29372 KB Output is correct
46 Correct 4 ms 29504 KB Output is correct
47 Correct 3 ms 29372 KB Output is correct
48 Correct 6 ms 29372 KB Output is correct
49 Correct 10 ms 29504 KB Output is correct
50 Correct 3 ms 29372 KB Output is correct
51 Correct 3 ms 29372 KB Output is correct
52 Correct 3 ms 29372 KB Output is correct
53 Correct 3 ms 29372 KB Output is correct
54 Correct 7 ms 29372 KB Output is correct
55 Correct 9 ms 29372 KB Output is correct
56 Correct 3 ms 29372 KB Output is correct
57 Correct 9 ms 29504 KB Output is correct
58 Correct 6 ms 29504 KB Output is correct
59 Correct 1441 ms 66368 KB Output is correct
60 Correct 1544 ms 63280 KB Output is correct
61 Correct 9 ms 29372 KB Output is correct
62 Correct 8 ms 29372 KB Output is correct
63 Correct 1298 ms 61196 KB Output is correct
64 Correct 8 ms 29540 KB Output is correct
65 Correct 21 ms 30736 KB Output is correct
66 Correct 192 ms 40132 KB Output is correct
67 Correct 755 ms 68196 KB Output is correct
68 Correct 1170 ms 62796 KB Output is correct
69 Correct 28 ms 31260 KB Output is correct
70 Correct 415 ms 49588 KB Output is correct
71 Execution timed out 2000 ms 92340 KB Execution timed out
72 Halted 0 ms 0 KB -