oj.uz

답안 #640554

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
640554 2022-09-14T21:27:18 Z sondos225 Network (BOI15_net) C++17
100 / 100
 412 ms 49092 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T>using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;//find_by_order(ind);//order_of_key()
#define int long long
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define pb emplace_back
#define pf emplace_front
#define yes "YES"
#define no "NO"
#define bigg INT_MAX
#define mp make_pair
#define mt make_tuple
#define debug(x) cout<<(#x)<<" = " <<x<<endl;
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define nn '\n'
#define mms(x,y) memset(x,y,sizeof(x))
#define forr(i,j,n) for (int i=j; i<n; i++)
#define forn(i,j,n) for (int i=j; i>n; i--)
#define cinn(x,y) for(int i=0; i<y; i++) cin>>x[i];
#define fi first
#define se second
#define la "LA"
#define pii pair<int,int>
// to use cmd ctrl+shift+c then g++ name.cpp -o name2.exe then name2 then input
//ctrl+shift+p to open search
//shift+alt+a stack comment2
///power function works in log2b
// int pwr(int a, int b)
// {
//   int po = 1;
//   while ( b )
//   {
//          if ( b & 1 )
//          {
//            po = po * a;
//            --b;
//          }
//          a = a*a;
//          b = b/2;
//   }
//   return po;
// }
vector <int> a[500001];
vector <int> leaf;
bool vis[500001];
void dfs(int i)
{
    vis[i]=1;
    if (a[i].sz==1) leaf.pb(i);
    forr(j,0,a[i].sz)
    {
        if(!vis[a[i][j]]) dfs(a[i][j]);
    }
    return;
}
signed main()
{
    fast
    //  #ifndef LOCAL
    //  freopen("in.txt","r",stdin);
    //  freopen("out.txt","w",stdout);
    //  #endif
    int n;
    cin>>n;
    forr(i,0,n-1)
    {
        int x,y;
        cin>>x >>y;
        a[x].pb(y);
        a[y].pb(x);
    }
    dfs(1);
    int cnt=leaf.sz;
    // cout<<leaf.sz<<endl<<endl;
    int i=0;
  //j=cnt-1;
    cout<<(cnt/2)+(cnt%2)<<nn;
    while(cnt>0)
    {
        // cout<<yes<<cnt<<endl;
        if (cnt==1)
        {
            
            cout<<leaf[i]<<' '<<leaf[0]<<nn;
        }
        else
        {
            //not 2 adjacent
          //if wrong try idea 2
          //cout<<i<<' '<<j<<endl;
            cout<<leaf[i]<<' '<<leaf[(leaf.sz/2)+(leaf.sz%2)+i]<<nn;
            i++;
        }
        cnt-=2;
    }
    return 0;
}

Compilation message

net.cpp: In function 'void dfs(long long int)':
net.cpp:22:36: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 | #define forr(i,j,n) for (int i=j; i<n; i++)
      |                                    ^
net.cpp:55:5: note: in expansion of macro 'forr'
   55 |     forr(j,0,a[i].sz)
      |     ^~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11972 KB Output is correct
4 Correct 7 ms 11988 KB Output is correct
5 Correct 6 ms 11988 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 11944 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 7 ms 11988 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 7 ms 11988 KB Output is correct
12 Correct 6 ms 11988 KB Output is correct
13 Correct 6 ms 11988 KB Output is correct
14 Correct 6 ms 11988 KB Output is correct
15 Correct 6 ms 11988 KB Output is correct
16 Correct 7 ms 11988 KB Output is correct
17 Correct 6 ms 12060 KB Output is correct
18 Correct 7 ms 11988 KB Output is correct
19 Correct 6 ms 11988 KB Output is correct
20 Correct 8 ms 11988 KB Output is correct
21 Correct 6 ms 11988 KB Output is correct
22 Correct 7 ms 12116 KB Output is correct
23 Correct 7 ms 12152 KB Output is correct
24 Correct 7 ms 12116 KB Output is correct
25 Correct 7 ms 12080 KB Output is correct
26 Correct 8 ms 12116 KB Output is correct
27 Correct 7 ms 12116 KB Output is correct
28 Correct 7 ms 12116 KB Output is correct
29 Correct 7 ms 12116 KB Output is correct
30 Correct 6 ms 11988 KB Output is correct
31 Correct 7 ms 12116 KB Output is correct
32 Correct 7 ms 11988 KB Output is correct
33 Correct 6 ms 12028 KB Output is correct
34 Correct 7 ms 11988 KB Output is correct
35 Correct 6 ms 11988 KB Output is correct
36 Correct 6 ms 11988 KB Output is correct
37 Correct 6 ms 12072 KB Output is correct
38 Correct 7 ms 12116 KB Output is correct
39 Correct 6 ms 11988 KB Output is correct
40 Correct 6 ms 12064 KB Output is correct
41 Correct 6 ms 12072 KB Output is correct
42 Correct 7 ms 11988 KB Output is correct
43 Correct 7 ms 12116 KB Output is correct
44 Correct 6 ms 11988 KB Output is correct
45 Correct 6 ms 12076 KB Output is correct
46 Correct 6 ms 12116 KB Output is correct
47 Correct 7 ms 11988 KB Output is correct
48 Correct 6 ms 12000 KB Output is correct
49 Correct 7 ms 12024 KB Output is correct
50 Correct 6 ms 12072 KB Output is correct
51 Correct 7 ms 11988 KB Output is correct
52 Correct 6 ms 11988 KB Output is correct
53 Correct 7 ms 12096 KB Output is correct
54 Correct 7 ms 11988 KB Output is correct
55 Correct 7 ms 12060 KB Output is correct
56 Correct 7 ms 12000 KB Output is correct
57 Correct 6 ms 12068 KB Output is correct
58 Correct 7 ms 12212 KB Output is correct

Subtask #3
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11972 KB Output is correct
4 Correct 7 ms 11988 KB Output is correct
5 Correct 6 ms 11988 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 11944 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 7 ms 11988 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 7 ms 11988 KB Output is correct
12 Correct 6 ms 11988 KB Output is correct
13 Correct 6 ms 11988 KB Output is correct
14 Correct 6 ms 11988 KB Output is correct
15 Correct 6 ms 11988 KB Output is correct
16 Correct 7 ms 11988 KB Output is correct
17 Correct 6 ms 12060 KB Output is correct
18 Correct 7 ms 11988 KB Output is correct
19 Correct 6 ms 11988 KB Output is correct
20 Correct 8 ms 11988 KB Output is correct
21 Correct 6 ms 11988 KB Output is correct
22 Correct 7 ms 12116 KB Output is correct
23 Correct 7 ms 12152 KB Output is correct
24 Correct 7 ms 12116 KB Output is correct
25 Correct 7 ms 12080 KB Output is correct
26 Correct 8 ms 12116 KB Output is correct
27 Correct 7 ms 12116 KB Output is correct
28 Correct 7 ms 12116 KB Output is correct
29 Correct 7 ms 12116 KB Output is correct
30 Correct 6 ms 11988 KB Output is correct
31 Correct 7 ms 12116 KB Output is correct
32 Correct 7 ms 11988 KB Output is correct
33 Correct 6 ms 12028 KB Output is correct
34 Correct 7 ms 11988 KB Output is correct
35 Correct 6 ms 11988 KB Output is correct
36 Correct 6 ms 11988 KB Output is correct
37 Correct 6 ms 12072 KB Output is correct
38 Correct 7 ms 12116 KB Output is correct
39 Correct 6 ms 11988 KB Output is correct
40 Correct 6 ms 12064 KB Output is correct
41 Correct 6 ms 12072 KB Output is correct
42 Correct 7 ms 11988 KB Output is correct
43 Correct 7 ms 12116 KB Output is correct
44 Correct 6 ms 11988 KB Output is correct
45 Correct 6 ms 12076 KB Output is correct
46 Correct 6 ms 12116 KB Output is correct
47 Correct 7 ms 11988 KB Output is correct
48 Correct 6 ms 12000 KB Output is correct
49 Correct 7 ms 12024 KB Output is correct
50 Correct 6 ms 12072 KB Output is correct
51 Correct 7 ms 11988 KB Output is correct
52 Correct 6 ms 11988 KB Output is correct
53 Correct 7 ms 12096 KB Output is correct
54 Correct 7 ms 11988 KB Output is correct
55 Correct 7 ms 12060 KB Output is correct
56 Correct 7 ms 12000 KB Output is correct
57 Correct 6 ms 12068 KB Output is correct
58 Correct 7 ms 12212 KB Output is correct
59 Correct 285 ms 40892 KB Output is correct
60 Correct 354 ms 43828 KB Output is correct
61 Correct 6 ms 12064 KB Output is correct
62 Correct 6 ms 11988 KB Output is correct
63 Correct 259 ms 37092 KB Output is correct
64 Correct 8 ms 12500 KB Output is correct
65 Correct 17 ms 13952 KB Output is correct
66 Correct 104 ms 27996 KB Output is correct
67 Correct 411 ms 47360 KB Output is correct
68 Correct 412 ms 49092 KB Output is correct
69 Correct 11 ms 13076 KB Output is correct
70 Correct 68 ms 23492 KB Output is correct
71 Correct 237 ms 46264 KB Output is correct
72 Correct 253 ms 44744 KB Output is correct
73 Correct 71 ms 20184 KB Output is correct
74 Correct 353 ms 41616 KB Output is correct
75 Correct 24 ms 15692 KB Output is correct
76 Correct 253 ms 45780 KB Output is correct
77 Correct 234 ms 45988 KB Output is correct
78 Correct 27 ms 15692 KB Output is correct
79 Correct 388 ms 45636 KB Output is correct
80 Correct 8 ms 12332 KB Output is correct
81 Correct 84 ms 22616 KB Output is correct
82 Correct 310 ms 43720 KB Output is correct
83 Correct 370 ms 41548 KB Output is correct
84 Correct 360 ms 41760 KB Output is correct
85 Correct 359 ms 41588 KB Output is correct
86 Correct 364 ms 43852 KB Output is correct
87 Correct 352 ms 43824 KB Output is correct