Submission details
Task:Connect cities
Sender:aalto26bh_042
Submission time:2026-09-05 17:37:59 +0300
Language:Rust (2021)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.09 sdetails
#7ACCEPTED0.09 sdetails
#8ACCEPTED0.09 sdetails
#9ACCEPTED0.09 sdetails
#10ACCEPTED0.09 sdetails
#11ACCEPTED0.16 sdetails
#12ACCEPTED0.00 sdetails

Code

#![allow(unused)]

use std::{collections::VecDeque, io, mem::take};

struct Node {
    visited: bool,
    neighbors: Vec<usize>,
}

fn take_tuple() -> (usize, usize) {
    let mut input = String::new();
    io::stdin().read_line(&mut input).unwrap();
    let (a, b) = input.trim().split_once(' ').unwrap();
    (a.parse().unwrap(), b.parse().unwrap())
}

fn create_neighbors(roads: &usize, cities: &usize) -> Vec<Vec<usize>> {
    let mut matrix: Vec<Vec<usize>> = vec![Vec::new(); *cities];

    for _ in 0..*roads {
        let (start, end) = take_tuple();
        matrix[start - 1].push(end - 1);
        matrix[end - 1].push(start - 1);
    }

    matrix
}

fn bfs(
    num_cities: &usize,
    root: usize,
    adjacent: &[Vec<usize>],
    visited: &mut [bool],
) -> usize {
    let mut queue: VecDeque<usize> = VecDeque::with_capacity(*num_cities);
    let mut last: usize = root;

    queue.push_back(root);
    visited[root] = true;

    while !queue.is_empty() {
        let current: usize = queue.pop_front().unwrap();

        for i in adjacent[current].iter() {
            let neighbor = *i;
            if visited[neighbor] {
                continue;
            }
            visited[neighbor] = true;
            queue.push_back(neighbor);
            last = neighbor;
        }
    }

    last
}

fn main() {
    let (num_cities, num_roads) = take_tuple();

    let mut visited: Vec<bool> = vec![false; num_cities];
    let mut adjacent: Vec<Vec<usize>> = create_neighbors(&num_roads, &num_cities);


    // first call
    let mut last = bfs(&num_cities, 0, &adjacent, &mut visited);
    let mut next: usize = 0;
    let mut missing: Vec<(usize, usize)> = Vec::new();

    for i in 0..num_cities {
        if !visited[i] {
            missing.push((last+1, i+1));
            last = bfs(&num_cities, i, &adjacent, &mut visited);
        }
    }
    println!("{}", missing.len());
    for t in missing.iter() {
        println!("{} {}", t.0, t.1);
    }
}

Test details

Test 1

Verdict: ACCEPTED

input
10 10
2 5
5 6
1 4
6 8
...

correct output
2
1 2
2 7

user output
2
10 2
9 7

Test 2

Verdict: ACCEPTED

input
10 10
3 9
6 8
9 10
7 8
...

correct output
2
1 4
4 5

user output
2
2 4
4 5

Test 3

Verdict: ACCEPTED

input
10 10
7 9
1 7
1 3
3 4
...

correct output
0

user output
0

Test 4

Verdict: ACCEPTED

input
10 10
4 8
5 9
4 9
2 7
...

correct output
1
1 3

user output
1
10 3

Test 5

Verdict: ACCEPTED

input
10 10
4 9
2 4
7 10
1 8
...

correct output
0

user output
0

Test 6

Verdict: ACCEPTED

input
100000 200000
7233 22146
94937 96203
6133 10731
98737 99193
...

correct output
4785
1 2
2 3
3 4
4 5
...

user output
4785
1 2
38712 3
3 4
37104 5
...

Test 7

Verdict: ACCEPTED

input
100000 200000
92950 93575
24401 88897
41796 99364
47106 50330
...

correct output
4868
1 2
2 7
7 9
9 15
...

user output
4868
1 2
30175 7
7 9
9 15
...

Test 8

Verdict: ACCEPTED

input
100000 200000
15637 76736
79169 98809
4382 86557
73383 77029
...

correct output
4683
1 9
9 20
20 27
27 28
...

user output
4683
29082 9
9 20
20 27
27 28
...

Test 9

Verdict: ACCEPTED

input
100000 200000
47932 66981
86401 99942
4353 27841
60492 67345
...

correct output
4807
1 6
6 7
7 11
11 12
...

user output
4807
72405 6
7243 7
34796 11
11 12
...

Test 10

Verdict: ACCEPTED

input
100000 200000
6554 44548
76413 98555
5447 59589
70166 74434
...

correct output
4786
1 2
2 18
18 21
21 27
...

user output
4786
48482 2
4194 18
18 21
21 27
...

Test 11

Verdict: ACCEPTED

input
100000 1
1 2

correct output
99998
1 3
3 4
4 5
5 6
...

user output
99998
2 3
3 4
4 5
5 6
...

Test 12

Verdict: ACCEPTED

input
10 9
2 5
5 6
1 4
6 8
...

correct output
2
1 2
2 7

user output
2
10 2
9 7