oj.uz

Submission #655926

# Submission time Handle Problem Language Result Execution time Memory
655926 2022-11-06T05:52:15 Z nolimiya Network (BOI15_net) C++14
100 / 100
 575 ms 84352 KB 
#include <bits/stdc++.h>
#include <math.h>
//in the name of god,aka allah
//**gray sety orz**
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define pi pair<long long , long long>
#define pii pair<long long , pair<long long , long long>>
const int maxm = 5e5 +4;
const long long mod = 1e9 + 7 ;
typedef long long ll;
ll l,r,mid;
ll n,m;
ll dis[maxm] , sum[maxm];
bool isval(int mid){
    //cout << mid <<" " << mid*mid-mid <<endl;
    if (((mid-1)*mid)/2 < m) return 0;
    return 1;
}
int darage[maxm] , ss , mm;
queue<int> q;
vector<int> g[maxm] , z[maxm];
ll sath[maxm];
bool vis[maxm] , gos[maxm];
int pedaret[maxm];
ll get_par(ll v){
    if (pedaret[v]==v) return v;
    return pedaret[v] = get_par(pedaret[v]);
}
ll pars1[maxm] , pars2[maxm];
vector<ll> se[maxm];
map<int,int> st[maxm];
int rp[maxm];
pi w[maxm];
ll dp[maxm];
//ll rw[maxm][maxm];
map<ll,ll> mp;
vector<int> vec;
void dfs(int k,int jad = 1){
    for (auto x : g[k]){
        if (jad!=x) dfs(x,k);
    }
    if (g[k].size()==1) vec.push_back(k);
}
int main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin >>n;
    for (int i=1; i<n; i++){
        cin >>l>>r;
        g[l].push_back(r),g[r].push_back(l); 
    }
    dfs(1);
    cout<<(vec.size()+1)/2<<endl;
    if (vec.size()%2==0){
        for (int i=0; i<vec.size()/2; i++) cout<<vec[i]<<" "<<vec[i+vec.size()/2]<<endl;
    }
    else{
        for (int i=0; i<vec.size()/2; i++) cout<<vec[i]<<" "<<vec[i+vec.size()/2+1]<<endl;
        cout<<vec[0]<<" "<<vec[vec.size()/2];
    }
}

Compilation message

net.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    5 | #pragma comment(linker, "/stack:200000000")
      | 
net.cpp: In function 'int main()':
net.cpp:57:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         for (int i=0; i<vec.size()/2; i++) cout<<vec[i]<<" "<<vec[i+vec.size()/2]<<endl;
      |                       ~^~~~~~~~~~~~~
net.cpp:60:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         for (int i=0; i<vec.size()/2; i++) cout<<vec[i]<<" "<<vec[i+vec.size()/2+1]<<endl;
      |                       ~^~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 58988 KB Output is correct
2 Correct 28 ms 58956 KB Output is correct
3 Correct 27 ms 58972 KB Output is correct
4 Correct 28 ms 59048 KB Output is correct
5 Correct 30 ms 59016 KB Output is correct
6 Correct 27 ms 58948 KB Output is correct
7 Correct 27 ms 58964 KB Output is correct
8 Correct 29 ms 59004 KB Output is correct
9 Correct 27 ms 59008 KB Output is correct
10 Correct 28 ms 59040 KB Output is correct
11 Correct 27 ms 58984 KB Output is correct
12 Correct 28 ms 58964 KB Output is correct
13 Correct 27 ms 58960 KB Output is correct
14 Correct 29 ms 58932 KB Output is correct
15 Correct 27 ms 58952 KB Output is correct
16 Correct 28 ms 58964 KB Output is correct
17 Correct 31 ms 59004 KB Output is correct
18 Correct 28 ms 59040 KB Output is correct
19 Correct 26 ms 58960 KB Output is correct
20 Correct 27 ms 58964 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 58988 KB Output is correct
2 Correct 28 ms 58956 KB Output is correct
3 Correct 27 ms 58972 KB Output is correct
4 Correct 28 ms 59048 KB Output is correct
5 Correct 30 ms 59016 KB Output is correct
6 Correct 27 ms 58948 KB Output is correct
7 Correct 27 ms 58964 KB Output is correct
8 Correct 29 ms 59004 KB Output is correct
9 Correct 27 ms 59008 KB Output is correct
10 Correct 28 ms 59040 KB Output is correct
11 Correct 27 ms 58984 KB Output is correct
12 Correct 28 ms 58964 KB Output is correct
13 Correct 27 ms 58960 KB Output is correct
14 Correct 29 ms 58932 KB Output is correct
15 Correct 27 ms 58952 KB Output is correct
16 Correct 28 ms 58964 KB Output is correct
17 Correct 31 ms 59004 KB Output is correct
18 Correct 28 ms 59040 KB Output is correct
19 Correct 26 ms 58960 KB Output is correct
20 Correct 27 ms 58964 KB Output is correct
21 Correct 31 ms 58984 KB Output is correct
22 Correct 30 ms 59108 KB Output is correct
23 Correct 31 ms 59040 KB Output is correct
24 Correct 28 ms 59092 KB Output is correct
25 Correct 28 ms 59092 KB Output is correct
26 Correct 28 ms 59004 KB Output is correct
27 Correct 28 ms 59140 KB Output is correct
28 Correct 34 ms 59140 KB Output is correct
29 Correct 34 ms 59080 KB Output is correct
30 Correct 27 ms 59008 KB Output is correct
31 Correct 28 ms 59004 KB Output is correct
32 Correct 28 ms 59048 KB Output is correct
33 Correct 27 ms 59048 KB Output is correct
34 Correct 27 ms 58964 KB Output is correct
35 Correct 27 ms 59032 KB Output is correct
36 Correct 31 ms 58980 KB Output is correct
37 Correct 33 ms 59004 KB Output is correct
38 Correct 29 ms 59032 KB Output is correct
39 Correct 31 ms 58984 KB Output is correct
40 Correct 28 ms 58964 KB Output is correct
41 Correct 27 ms 58972 KB Output is correct
42 Correct 30 ms 59000 KB Output is correct
43 Correct 30 ms 59076 KB Output is correct
44 Correct 27 ms 58976 KB Output is correct
45 Correct 26 ms 59040 KB Output is correct
46 Correct 29 ms 59004 KB Output is correct
47 Correct 42 ms 58952 KB Output is correct
48 Correct 32 ms 58948 KB Output is correct
49 Correct 28 ms 59028 KB Output is correct
50 Correct 28 ms 59020 KB Output is correct
51 Correct 27 ms 58992 KB Output is correct
52 Correct 27 ms 59028 KB Output is correct
53 Correct 33 ms 59052 KB Output is correct
54 Correct 27 ms 59048 KB Output is correct
55 Correct 27 ms 59048 KB Output is correct
56 Correct 27 ms 58992 KB Output is correct
57 Correct 27 ms 59020 KB Output is correct
58 Correct 29 ms 59092 KB Output is correct

Subtask #3
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 58988 KB Output is correct
2 Correct 28 ms 58956 KB Output is correct
3 Correct 27 ms 58972 KB Output is correct
4 Correct 28 ms 59048 KB Output is correct
5 Correct 30 ms 59016 KB Output is correct
6 Correct 27 ms 58948 KB Output is correct
7 Correct 27 ms 58964 KB Output is correct
8 Correct 29 ms 59004 KB Output is correct
9 Correct 27 ms 59008 KB Output is correct
10 Correct 28 ms 59040 KB Output is correct
11 Correct 27 ms 58984 KB Output is correct
12 Correct 28 ms 58964 KB Output is correct
13 Correct 27 ms 58960 KB Output is correct
14 Correct 29 ms 58932 KB Output is correct
15 Correct 27 ms 58952 KB Output is correct
16 Correct 28 ms 58964 KB Output is correct
17 Correct 31 ms 59004 KB Output is correct
18 Correct 28 ms 59040 KB Output is correct
19 Correct 26 ms 58960 KB Output is correct
20 Correct 27 ms 58964 KB Output is correct
21 Correct 31 ms 58984 KB Output is correct
22 Correct 30 ms 59108 KB Output is correct
23 Correct 31 ms 59040 KB Output is correct
24 Correct 28 ms 59092 KB Output is correct
25 Correct 28 ms 59092 KB Output is correct
26 Correct 28 ms 59004 KB Output is correct
27 Correct 28 ms 59140 KB Output is correct
28 Correct 34 ms 59140 KB Output is correct
29 Correct 34 ms 59080 KB Output is correct
30 Correct 27 ms 59008 KB Output is correct
31 Correct 28 ms 59004 KB Output is correct
32 Correct 28 ms 59048 KB Output is correct
33 Correct 27 ms 59048 KB Output is correct
34 Correct 27 ms 58964 KB Output is correct
35 Correct 27 ms 59032 KB Output is correct
36 Correct 31 ms 58980 KB Output is correct
37 Correct 33 ms 59004 KB Output is correct
38 Correct 29 ms 59032 KB Output is correct
39 Correct 31 ms 58984 KB Output is correct
40 Correct 28 ms 58964 KB Output is correct
41 Correct 27 ms 58972 KB Output is correct
42 Correct 30 ms 59000 KB Output is correct
43 Correct 30 ms 59076 KB Output is correct
44 Correct 27 ms 58976 KB Output is correct
45 Correct 26 ms 59040 KB Output is correct
46 Correct 29 ms 59004 KB Output is correct
47 Correct 42 ms 58952 KB Output is correct
48 Correct 32 ms 58948 KB Output is correct
49 Correct 28 ms 59028 KB Output is correct
50 Correct 28 ms 59020 KB Output is correct
51 Correct 27 ms 58992 KB Output is correct
52 Correct 27 ms 59028 KB Output is correct
53 Correct 33 ms 59052 KB Output is correct
54 Correct 27 ms 59048 KB Output is correct
55 Correct 27 ms 59048 KB Output is correct
56 Correct 27 ms 58992 KB Output is correct
57 Correct 27 ms 59020 KB Output is correct
58 Correct 29 ms 59092 KB Output is correct
59 Correct 492 ms 76988 KB Output is correct
60 Correct 561 ms 79104 KB Output is correct
61 Correct 32 ms 58956 KB Output is correct
62 Correct 28 ms 59020 KB Output is correct
63 Correct 415 ms 75296 KB Output is correct
64 Correct 30 ms 59348 KB Output is correct
65 Correct 39 ms 60308 KB Output is correct
66 Correct 126 ms 70252 KB Output is correct
67 Correct 450 ms 83432 KB Output is correct
68 Correct 421 ms 84352 KB Output is correct
69 Correct 41 ms 59732 KB Output is correct
70 Correct 164 ms 66156 KB Output is correct
71 Correct 530 ms 82244 KB Output is correct
72 Correct 543 ms 81320 KB Output is correct
73 Correct 159 ms 64344 KB Output is correct
74 Correct 531 ms 78012 KB Output is correct
75 Correct 79 ms 61516 KB Output is correct
76 Correct 527 ms 81780 KB Output is correct
77 Correct 537 ms 82132 KB Output is correct
78 Correct 55 ms 61404 KB Output is correct
79 Correct 405 ms 82256 KB Output is correct
80 Correct 31 ms 59220 KB Output is correct
81 Correct 198 ms 66112 KB Output is correct
82 Correct 571 ms 80096 KB Output is correct
83 Correct 514 ms 78072 KB Output is correct
84 Correct 546 ms 78152 KB Output is correct
85 Correct 520 ms 78068 KB Output is correct
86 Correct 537 ms 79064 KB Output is correct
87 Correct 575 ms 79340 KB Output is correct