Submission details
Task:Fragile network
Sender:aalto25f_003
Submission time:2025-10-08 17:09:51 +0300
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.01 sdetails
#20.01 sdetails
#3ACCEPTED0.01 sdetails
#4ACCEPTED0.01 sdetails
#5ACCEPTED0.01 sdetails
#6ACCEPTED0.06 sdetails
#70.06 sdetails
#8ACCEPTED0.06 sdetails
#90.06 sdetails
#100.07 sdetails
#11ACCEPTED0.01 sdetails
#12ACCEPTED0.01 sdetails
#13ACCEPTED0.01 sdetails
#14ACCEPTED0.03 sdetails
#15ACCEPTED0.01 sdetails
#16ACCEPTED0.01 sdetails
#17ACCEPTED0.01 sdetails
#18ACCEPTED0.01 sdetails
#19ACCEPTED0.01 sdetails
#20ACCEPTED0.01 sdetails
#21ACCEPTED0.01 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:46:36: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   46 |   for (int i = 0; i + l.size() / 2 < (int) l.size(); i++) {
      |                   ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Code

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int N = 1e5 + 5;

int n;
vector<int> g[N];
vector<pair<int, int> > ans;
bool vis[N];
vector<int> l;

void dfs(int u) {
  bool f = true;
  vis[u] = true;
  for (int v : g[u]) {
    if (!vis[v]) {
      f = false;
      dfs(v);
    }
  }
  if (f) {
    l.emplace_back(u);
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n - 1; i++) {
    int a, b;
    cin >> a >> b;
    g[a].emplace_back(b);
    g[b].emplace_back(a);
  }
  for (int i = 1; i <= n; i++) {
    sort(g[i].begin(), g[i].end());
  }
  dfs(1);
  if (l.size() & 1) {
    l.emplace_back(l.back());
  }
  for (int i = 0; i + l.size() / 2 < (int) l.size(); i++) {
    ans.emplace_back(l[i], l[i + l.size() / 2]);
  }
  std::cout << ans.size() << '\n';
  for (auto x : ans) {
    std::cout << x.first << ' ' << x.second << '\n';
  }
  return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
10
1 5
1 7
1 8
1 3
...

correct output
5
5 2
7 9
8 6
3 10
...

user output
5
2 7
3 8
4 9
5 10
...

Test 2

Verdict:

input
10
4 5
3 4
2 3
9 10
...

correct output
1
10 1

user output
1
10 10

Test 3

Verdict: ACCEPTED

input
10
1 8
1 3
3 5
5 7
...

correct output
3
7 10
8 2
1 9

user output
3
2 7
9 8
10 8

Test 4

Verdict: ACCEPTED

input
10
1 5
3 7
2 10
3 8
...

correct output
3
10 8
6 4
5 9

user output
3
9 10
8 5
4 6

Test 5

Verdict: ACCEPTED

input
10
4 8
3 4
4 6
2 3
...

correct output
3
8 7
10 9
1 6

user output
3
6 9
7 10
8 10

Test 6

Verdict: ACCEPTED

input
100000
1 56967
1 56618
1 42321
1 82550
...

correct output
50000
56967 16911
56618 39942
42321 99902
82550 2538
...

user output
50000
2 50002
3 50003
4 50004
5 50005
...

Test 7

Verdict:

input
100000
92297 92298
23511 23512
68057 68058
65434 65435
...

correct output
1
100000 1

user output
1
100000 100000

Test 8

Verdict: ACCEPTED

input
100000
17747 97512
10397 12053
679 6975
4013 14565
...

correct output
25057
92881 76094
20353 87429
16069 96487
71186 52809
...

user output
25057
64789 93491
39130 44778
80065 49573
83407 54953
...

Test 9

Verdict:

input
100000
72941 72942
11232 11233
73464 73465
30042 30043
...

correct output
489
16423 85168
20707 94190
36505 54940
96411 44067
...

user output
488
99 70143
9350 79584
57383 28827
28295 90825
...

Test 10

Verdict:

input
100000
31451 31452
7473 7474
24056 24057
85181 85182
...

correct output
51
25638 2983
87594 87371
92001 50610
46744 100000
...

user output
50
140 73338
346 37425
1093 63187
43065 22961
...

Test 11

Verdict: ACCEPTED

input
10
1 2
1 3
3 4
3 5
...

correct output
2
2 6
4 10

user output
2
2 6
4 10

Test 12

Verdict: ACCEPTED

input
7
1 2
2 3
2 4
1 5
...

correct output
2
4 7
3 6

user output
2
3 6
4 7

Test 13

Verdict: ACCEPTED

input
6
1 2
1 3
1 4
4 5
...

correct output
2
3 6
2 5

user output
2
2 5
3 6

Test 14

Verdict: ACCEPTED

input
65538
1 2
1 3
1 4
3 5
...

correct output
16385
34 36
40 42
35 41
48 50
...

user output
16385
2 32799
33 32800
34 32801
35 32802
...

Test 15

Verdict: ACCEPTED

input
11
1 2
1 3
2 4
2 5
...

correct output
2
9 11
8 10

user output
2
8 10
9 11

Test 16

Verdict: ACCEPTED

input
7
1 2
1 3
2 4
2 5
...

correct output
2
5 7
4 6

user output
2
4 6
5 7

Test 17

Verdict: ACCEPTED

input
7
1 2
1 3
2 4
2 5
...

correct output
2
5 7
4 6

user output
2
4 6
5 7

Test 18

Verdict: ACCEPTED

input
10
8 4
3 4
4 6
2 3
...

correct output
3
8 7
10 9
1 6

user output
3
6 9
7 10
8 10

Test 19

Verdict: ACCEPTED

input
7
1 2
1 5
2 3
2 6
...

correct output
2
6 7
3 4

user output
2
3 4
6 7

Test 20

Verdict: ACCEPTED

input
8
1 2
1 3
2 4
2 5
...

correct output
3
4 7
6 8
1 5

user output
3
4 7
5 8
6 8

Test 21

Verdict: ACCEPTED

input
10
2 1
3 1
4 2
5 4
...

correct output
3
9 8
6 10
3 7

user output
3
6 3
9 7
8 10