oj.uz

Submission #780419

# Submission time Handle Problem Language Result Execution time Memory
780419 2023-07-12T08:55:25 Z anton Network (BOI15_net) C++17
100 / 100
 742 ms 74032 KB 
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int, int>

const int INF = 2*1e9;

vector<vector<int>> adj;
vector<int> leaves;

void dfs(int i){
    
    leaves[i] = 0;
    bool leaf = true;
    for(auto next: adj[i]){
        if(leaves[next]==-1){
            leaf = false;
            dfs(next);
            leaves[i]+=leaves[next];
        }
    }

    if(leaf){
        leaves[i] =1;
    }
    //cout<<"dfs "<<i<<" "<<leaves[i]<<endl;
}

vector<vector<int>> ch;
vector<int> color;

void dfs2(int id, int c){
    //cout<<"dfs2 "<<id<<" "<<c<<endl;
    color[id] =c;
    bool leaf = true;
    for(auto e: adj[id]){
        if(color[e]==-1){
            leaf= false;
            dfs2(e, c);
        }
    }
    if(leaf){
        ch[c].push_back(id);
    }
}
int main(){
    int n;
    cin>>n;

    adj.resize(n);
    leaves.resize(n, -1);
    int total_l = 0;

    int f_root= 0;


    for(int i = 0; i<n-1; i++){
        int a, b;
        cin>>a>>b;
        a--;b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
        if(adj[a].size()>1){
            f_root =a;
        }
        if(adj[b].size()>1){
            f_root =b;
        }
    }

    dfs(f_root);

    total_l= leaves[f_root];
    int nb_p = (total_l+1)/2;

    cout<<nb_p<<endl;

    int cur = f_root;
    pii max_c = pii(0, -1);
    for(auto e: adj[cur]){
        if(leaves[e]>max_c.first){
            max_c = pii(leaves[e], e);
        }
    }

    while(max_c.first>nb_p){
        int next = max_c.second;
        max_c = pii(0, -1);

        leaves[cur]-= leaves[next];
        leaves[next] = total_l;

        cur= next;    
        for(auto e: adj[cur]){
            if(leaves[e]>max_c.first){
                max_c = pii(leaves[e], e);
            }
        }
    }
    //cout<<"cur "<<cur<<endl;

    int nb_sub = adj[cur].size();
    ch.resize(nb_sub);
    color.resize(n, -1);

    color[cur] = INF;

    for(int i = 0; i<nb_sub; i++){
        dfs2(adj[cur][i], i);
    }

    vector<vector<int>> pairs(2, vector<int> (nb_p, cur));

    int id= 0;

    for(int i = 0; i<adj[cur].size(); i++){
        for(auto e: ch[i]){
            pairs[id/(nb_p)][id%(nb_p)] = e;
            id++;
        }
    }

    for(int i= 0; i<nb_p; i++){
        cout<<pairs[0][i]+1<<" "<<pairs[1][i]+1<<endl;
    }

    
}

Compilation message

net.cpp: In function 'int main()':
net.cpp:115:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |     for(int i = 0; i<adj[cur].size(); i++){
      |                    ~^~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 4 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 3 ms 468 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 3 ms 340 KB Output is correct
28 Correct 3 ms 440 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 2 ms 340 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 300 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 2 ms 468 KB Output is correct
59 Correct 659 ms 46372 KB Output is correct
60 Correct 675 ms 44232 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 546 ms 39704 KB Output is correct
64 Correct 4 ms 724 KB Output is correct
65 Correct 16 ms 2776 KB Output is correct
66 Correct 163 ms 19324 KB Output is correct
67 Correct 679 ms 61176 KB Output is correct
68 Correct 693 ms 51148 KB Output is correct
69 Correct 16 ms 2392 KB Output is correct
70 Correct 183 ms 22268 KB Output is correct
71 Correct 665 ms 74032 KB Output is correct
72 Correct 696 ms 69880 KB Output is correct
73 Correct 130 ms 11964 KB Output is correct
74 Correct 638 ms 42704 KB Output is correct
75 Correct 59 ms 6648 KB Output is correct
76 Correct 653 ms 59432 KB Output is correct
77 Correct 680 ms 60032 KB Output is correct
78 Correct 41 ms 5436 KB Output is correct
79 Correct 655 ms 52704 KB Output is correct
80 Correct 4 ms 688 KB Output is correct
81 Correct 215 ms 19676 KB Output is correct
82 Correct 742 ms 57520 KB Output is correct
83 Correct 633 ms 42636 KB Output is correct
84 Correct 655 ms 42788 KB Output is correct
85 Correct 671 ms 42956 KB Output is correct
86 Correct 668 ms 44000 KB Output is correct
87 Correct 689 ms 44156 KB Output is correct