— Dark mode

Aalto Competitive Programming 2024 - wk6 - Wed

Fragile network

  • Start: 2024-10-09 16:20:00
  • End: 2024-10-09 17:50:00
CSES - Aalto Competitive Programming 2024 - wk6 - Wed - Results
Submission details
Task:Fragile network
Sender:aalto2024g_003
Submission time:2024-10-09 16:26:23 +0300
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#10.01 sdetails
#20.01 sdetails
#30.01 sdetails
#40.01 sdetails
#50.01 sdetails
#60.05 sdetails
#70.06 sdetails
#80.06 sdetails
#90.06 sdetails
#100.05 sdetails
#110.01 sdetails
#120.01 sdetails
#130.01 sdetails
#140.03 sdetails
#150.01 sdetails
#160.01 sdetails
#170.01 sdetails
#180.01 sdetails
#190.01 sdetails
#200.01 sdetails
#210.01 sdetails

Code

#include <bits/stdc++.h>
using namespace std;

#define int long long

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int N = 1e5 + 5;

int n;
vector<int> adj[N];
vector<int> leaves;

void dfs(int u, int p) {
    int cnt = 0;
    for (int v : adj[u]) {
        if (v == p) continue;
        cnt++;
        dfs(v, u);
    }
    if (cnt == 0) leaves.push_back(u);
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit); // RTE if input wrong datatype

    cin >> n;
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    dfs(1, 1);

    cout << sz(leaves) - 1 << '\n';
    for (int i = 1; i < sz(leaves); i++) {
        cout << leaves[0] << ' ' << leaves[i] << '\n';
    }
}

Test details

Test 1

Verdict:

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

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

user output
8
5 7
5 8
5 3
5 4
...
view save

Test 2

Verdict:

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

correct output
1
10 1
view save

user output
0
view save

Test 3

Verdict:

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

correct output
3
7 10
8 2
1 9
view save

user output
4
8 7
8 9
8 10
8 2
view save

Test 4

Verdict:

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

correct output
3
10 8
6 4
5 9
view save

user output
5
5 6
5 10
5 9
5 8
...
view save

Test 5

Verdict:

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

correct output
3
8 7
10 9
1 6
view save

user output
4
10 8
10 6
10 7
10 9
view save

Test 6

Verdict:

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

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

user output
99998
56967 56618
56967 42321
56967 82550
56967 46223
...
Truncated

Test 7

Verdict:

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

correct output
1
100000 1
view save

user output
0
view save

Test 8

Verdict:

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

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

user output
50112
92881 20353
92881 76094
92881 16069
92881 87429
...
Truncated

Test 9

Verdict:

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

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

user output
975
21977 4831
21977 5346
21977 16423
21977 86387
...
Truncated

Test 10

Verdict:

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

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

user output
99
63319 64101
63319 25638
63319 42311
63319 2983
...
Truncated

Test 11

Verdict:

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

correct output
2
2 6
4 10
view save

user output
3
2 4
2 6
2 10
view save

Test 12

Verdict:

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

correct output
2
4 7
3 6
view save

user output
3
3 4
3 6
3 7
view save

Test 13

Verdict:

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

correct output
2
3 6
2 5
view save

user output
3
2 3
2 5
2 6
view save

Test 14

Verdict:

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

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

user output
32769
2 33
2 34
2 35
2 36
...
Truncated

Test 15

Verdict:

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

correct output
2
9 11
8 10
view save

user output
3
8 9
8 10
8 11
view save

Test 16

Verdict:

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

correct output
2
5 7
4 6
view save

user output
3
4 5
4 6
4 7
view save

Test 17

Verdict:

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

correct output
2
5 7
4 6
view save

user output
3
4 5
4 6
4 7
view save

Test 18

Verdict:

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

correct output
3
8 7
10 9
1 6
view save

user output
4
10 8
10 6
10 7
10 9
view save

Test 19

Verdict:

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

correct output
2
6 7
3 4
view save

user output
3
3 6
3 4
3 7
view save

Test 20

Verdict:

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

correct output
3
4 7
6 8
1 5
view save

user output
4
4 5
4 6
4 7
4 8
view save

Test 21

Verdict:

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

correct output
3
9 8
6 10
3 7
view save

user output
5
6 9
6 8
6 3
6 7
...
view save

Tasks

A FenceB Microservice hellC Online feudD LaddersE Fragile network

Submissions (aalto2024g_003)

2024-10-09 17:50:30 2024-10-09 17:49:45 2024-10-09 17:43:31 2024-10-09 16:41:00 2024-10-09 16:29:32 2024-10-09 16:26:23