Submission #49590

# Submission time Handle Problem Language Result Execution time Memory
49590 2018-05-31T18:53:40 Z rzbt Network (BOI15_net) C++14
100 / 100
922 ms 153276 KB
#include <bits/stdc++.h>
using namespace std;

int n,in1,in2,tren,prethodni,duz,koren=0;
vector<vector<int> > drvo;
stack<pair<int,int> > dfs;
pair<int,int> vrh;
vector<int> listovi;

int main()
{
    ios::sync_with_stdio(false);
    cin>>n;
    drvo.resize(n+1);
    for(int i=1;i<n;i++)
    {
        cin>>in1>>in2;
        drvo[in1].push_back(in2);
        drvo[in2].push_back(in1);
    }
    if(n<=20)
    {
        if(n==1)
        {
            cout<<1<<endl<<1<<" "<<1;
        }
        if(n==2)
        {
            cout<<1<<endl<<1<<" "<<2;
            return 0;
        }
        for(int i=1;i<=n;i++)
        {
            if(drvo[i].size()>1)
            {
                dfs.push(make_pair(i,0));
                break;
            }
        }
        while(!dfs.empty())
        {
            vrh=dfs.top();
            dfs.pop();
            tren=vrh.first;
            prethodni=vrh.second;
            duz=drvo[tren].size();
            if(duz==1)
            {
                listovi.push_back(tren);
            }
            else
            {
                for(int i=0;i<duz;i++)
                {
                    if(drvo[tren][i]!=prethodni)
                    {
                        dfs.push(make_pair(drvo[tren][i],tren));
                    }
                }
            }
        }
        duz=listovi.size();
        cout<<(duz+1)/2<<endl;
        for(int i=0;i<(duz+1)/2;i++)
        {
            if(i==duz-i-1)
            {
                cout<<listovi[0]<<" "<<listovi[i]<<endl;
            }
            else
            {
                cout<<listovi[i]<<" "<<listovi[i+(duz+1)/2]<<endl;
            }
        }
        return 0;
    }
    for(int i=1;i<=n;i++)
    {
        if(drvo[i].size()>1)
        {
            dfs.push(make_pair(i,0));
            break;
        }
    }
    while(!dfs.empty())
    {
        vrh=dfs.top();
        dfs.pop();
        tren=vrh.first;
        prethodni=vrh.second;
        duz=drvo[tren].size();
        if(duz==1)
        {
            listovi.push_back(tren);
        }
        else
        {
            for(int i=0;i<duz;i++)
            {
                if(drvo[tren][i]!=prethodni)
                {
                    dfs.push(make_pair(drvo[tren][i],tren));
                }
            }
        }
    }
    duz=listovi.size();
    cout<<(duz+1)/2<<endl;
    for(int i=0;i<(duz+1)/2;i++)
    {
        if(i==duz-i-1)
        {
            cout<<listovi[0]<<" "<<listovi[i]<<endl;
        }
        else
        {
            cout<<listovi[i]<<" "<<listovi[(duz+1)/2+i]<<endl;
        }
    }
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 548 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 740 KB Output is correct
10 Correct 2 ms 740 KB Output is correct
11 Correct 3 ms 740 KB Output is correct
12 Correct 2 ms 740 KB Output is correct
13 Correct 2 ms 740 KB Output is correct
14 Correct 2 ms 740 KB Output is correct
15 Correct 2 ms 740 KB Output is correct
16 Correct 2 ms 740 KB Output is correct
17 Correct 2 ms 740 KB Output is correct
18 Correct 2 ms 740 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 548 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 740 KB Output is correct
10 Correct 2 ms 740 KB Output is correct
11 Correct 3 ms 740 KB Output is correct
12 Correct 2 ms 740 KB Output is correct
13 Correct 2 ms 740 KB Output is correct
14 Correct 2 ms 740 KB Output is correct
15 Correct 2 ms 740 KB Output is correct
16 Correct 2 ms 740 KB Output is correct
17 Correct 2 ms 740 KB Output is correct
18 Correct 2 ms 740 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 6 ms 876 KB Output is correct
23 Correct 5 ms 912 KB Output is correct
24 Correct 5 ms 912 KB Output is correct
25 Correct 5 ms 1096 KB Output is correct
26 Correct 4 ms 1096 KB Output is correct
27 Correct 6 ms 1096 KB Output is correct
28 Correct 4 ms 1248 KB Output is correct
29 Correct 3 ms 1248 KB Output is correct
30 Correct 2 ms 1248 KB Output is correct
31 Correct 5 ms 1248 KB Output is correct
32 Correct 2 ms 1248 KB Output is correct
33 Correct 2 ms 1248 KB Output is correct
34 Correct 2 ms 1248 KB Output is correct
35 Correct 3 ms 1248 KB Output is correct
36 Correct 3 ms 1248 KB Output is correct
37 Correct 3 ms 1248 KB Output is correct
38 Correct 3 ms 1248 KB Output is correct
39 Correct 3 ms 1248 KB Output is correct
40 Correct 2 ms 1248 KB Output is correct
41 Correct 2 ms 1248 KB Output is correct
42 Correct 3 ms 1248 KB Output is correct
43 Correct 4 ms 1248 KB Output is correct
44 Correct 2 ms 1248 KB Output is correct
45 Correct 4 ms 1248 KB Output is correct
46 Correct 4 ms 1248 KB Output is correct
47 Correct 2 ms 1248 KB Output is correct
48 Correct 2 ms 1292 KB Output is correct
49 Correct 3 ms 1292 KB Output is correct
50 Correct 2 ms 1292 KB Output is correct
51 Correct 2 ms 1292 KB Output is correct
52 Correct 2 ms 1292 KB Output is correct
53 Correct 3 ms 1292 KB Output is correct
54 Correct 2 ms 1292 KB Output is correct
55 Correct 2 ms 1292 KB Output is correct
56 Correct 3 ms 1292 KB Output is correct
57 Correct 2 ms 1292 KB Output is correct
58 Correct 5 ms 1376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 548 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 740 KB Output is correct
10 Correct 2 ms 740 KB Output is correct
11 Correct 3 ms 740 KB Output is correct
12 Correct 2 ms 740 KB Output is correct
13 Correct 2 ms 740 KB Output is correct
14 Correct 2 ms 740 KB Output is correct
15 Correct 2 ms 740 KB Output is correct
16 Correct 2 ms 740 KB Output is correct
17 Correct 2 ms 740 KB Output is correct
18 Correct 2 ms 740 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 6 ms 876 KB Output is correct
23 Correct 5 ms 912 KB Output is correct
24 Correct 5 ms 912 KB Output is correct
25 Correct 5 ms 1096 KB Output is correct
26 Correct 4 ms 1096 KB Output is correct
27 Correct 6 ms 1096 KB Output is correct
28 Correct 4 ms 1248 KB Output is correct
29 Correct 3 ms 1248 KB Output is correct
30 Correct 2 ms 1248 KB Output is correct
31 Correct 5 ms 1248 KB Output is correct
32 Correct 2 ms 1248 KB Output is correct
33 Correct 2 ms 1248 KB Output is correct
34 Correct 2 ms 1248 KB Output is correct
35 Correct 3 ms 1248 KB Output is correct
36 Correct 3 ms 1248 KB Output is correct
37 Correct 3 ms 1248 KB Output is correct
38 Correct 3 ms 1248 KB Output is correct
39 Correct 3 ms 1248 KB Output is correct
40 Correct 2 ms 1248 KB Output is correct
41 Correct 2 ms 1248 KB Output is correct
42 Correct 3 ms 1248 KB Output is correct
43 Correct 4 ms 1248 KB Output is correct
44 Correct 2 ms 1248 KB Output is correct
45 Correct 4 ms 1248 KB Output is correct
46 Correct 4 ms 1248 KB Output is correct
47 Correct 2 ms 1248 KB Output is correct
48 Correct 2 ms 1292 KB Output is correct
49 Correct 3 ms 1292 KB Output is correct
50 Correct 2 ms 1292 KB Output is correct
51 Correct 2 ms 1292 KB Output is correct
52 Correct 2 ms 1292 KB Output is correct
53 Correct 3 ms 1292 KB Output is correct
54 Correct 2 ms 1292 KB Output is correct
55 Correct 2 ms 1292 KB Output is correct
56 Correct 3 ms 1292 KB Output is correct
57 Correct 2 ms 1292 KB Output is correct
58 Correct 5 ms 1376 KB Output is correct
59 Correct 678 ms 36624 KB Output is correct
60 Correct 718 ms 45800 KB Output is correct
61 Correct 2 ms 45800 KB Output is correct
62 Correct 2 ms 45800 KB Output is correct
63 Correct 559 ms 45800 KB Output is correct
64 Correct 5 ms 45800 KB Output is correct
65 Correct 16 ms 45800 KB Output is correct
66 Correct 186 ms 45800 KB Output is correct
67 Correct 654 ms 55736 KB Output is correct
68 Correct 588 ms 63240 KB Output is correct
69 Correct 28 ms 63240 KB Output is correct
70 Correct 226 ms 63240 KB Output is correct
71 Correct 733 ms 82524 KB Output is correct
72 Correct 692 ms 86244 KB Output is correct
73 Correct 169 ms 86244 KB Output is correct
74 Correct 742 ms 89420 KB Output is correct
75 Correct 70 ms 89420 KB Output is correct
76 Correct 922 ms 103508 KB Output is correct
77 Correct 790 ms 109752 KB Output is correct
78 Correct 40 ms 109752 KB Output is correct
79 Correct 602 ms 109752 KB Output is correct
80 Correct 6 ms 109752 KB Output is correct
81 Correct 225 ms 109752 KB Output is correct
82 Correct 734 ms 123716 KB Output is correct
83 Correct 679 ms 125744 KB Output is correct
84 Correct 716 ms 132264 KB Output is correct
85 Correct 701 ms 138944 KB Output is correct
86 Correct 742 ms 146760 KB Output is correct
87 Correct 782 ms 153276 KB Output is correct