Sadonkorjuu

warning: value assigned to `cur` is never read
  --> input/code.rs:65:17
   |
65 |         let mut cur: Vec<(usize, Option<usize>, usize)> = vec![];
   |                 ^^^
   |
   = note: `#[warn(unused_assignments)]` on by default
   = help: maybe it is overwritten before being read?

warning: unused variable: `n_cities`
  --> input/code.rs:17:9
   |
17 |     let n_cities = input.trim().parse::<usize>().unwrap();
   |         ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_n_cities`
   |
   = note: `#[warn(unused_variables)]` on by default

warning: unused `Result` that must be used
  --> input/code.rs:16:5
   |
16 |     stdin.read_line(&mut input);
   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
   |
   = note: `#[warn(unused_must_use)]` on by default
   = note: this `Result` may be an `Err` variant, which should be handled

warning: unused `Result` that must be used
  --> input/code.rs:20:5
   |
20 |     stdin.read_line(&mut input);
   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^...

use std::collections::HashMap;

fn sort(i: usize, j: usize) -> (usize, usize) {
    if i < j {
        (i, j)
    } else {
        (j, i)
    }
}

fn main() {
    let stdin = std::io::stdin();

    let mut input = String::new();

    stdin.read_line(&mut input);
    let n_cities = input.trim().parse::<usize>().unwrap();
    input.clear();

    stdin.read_line(&mut input);

    // true on satama, false on pelto
    let types = input.split_whitespace().map(|c| c.chars().next().unwrap() == '0').collect::<Vec<_>>();
    input.clear();

    let mut lenmap = HashMap::new();
    let mut bridgemap: HashMap<usize, Vec<usize>> = HashMap::new();

    loop {
        let res = stdin.read_line(&mut input);

        if let Ok(0) = res {
            break;
        };

        let mut nums = input.split_whitespace().map(|c| c.parse::<usize>().unwrap());
        let (i, j) = (nums.next().unwrap() - 1, nums.next().unwrap() - 1);

        let (i, j) = sort(i, j);

        lenmap.insert((i, j), nums.next().unwrap());

        if let Some(vec) = bridgemap.get_mut(&i) {
            vec.push(j)
        } else {
            bridgemap.insert(i, vec![j]);
        }

        if let Some(vec) = bridgemap.get_mut(&j) {
            vec.push(i)
        } else {
            bridgemap.insert(j, vec![i]);
        }

        input.clear();
    }

    let sum = types.iter().enumerate().filter_map(|(i, &t)| {
        if t {
            return None;
        }

        let mut min_dist: Option<usize> = None;

        let mut cur: Vec<(usize, Option<usize>, usize)> = vec![];
        let mut last: Vec<(usize, Option<usize>, usize)> = vec![];

        last.push((i, None, 0));

        for _ in 1..20 {
            cur = last.iter().map(|&(cur_node, last_node_opt, length)| {
                let mut other_nodes = bridgemap.get(&cur_node).unwrap().clone();
                if let Some(last_node) = last_node_opt {
                    let index = other_nodes.iter().position(|&node| node == last_node).unwrap();
                    other_nodes.remove(index);
                };

                let mut out = vec![];

                for other_node in other_nodes {
                    let new_length = length + *lenmap.get(&sort(other_node, cur_node)).unwrap();

                    if let Some(dist) = min_dist {
                        if new_length >= dist {
                            continue
                        };
                    };

                    if !types[other_node] {
                        out.push((other_node, Some(cur_node), new_length));
                    } else {
                        if let Some(dist) = min_dist {
                            if new_length < dist {
                                min_dist = Some(new_length);
                            }
                        } else {
                            min_dist = Some(new_length);
                        }
                    }
                }

                out
            }).flatten().collect();

            last = cur.clone();
            cur.clear();
        }

        min_dist
    }).sum::<usize>();

    println!("{}", sum);
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2

Verdict: ACCEPTED

Test 14

Group: 2

Verdict: ACCEPTED

Test 15

Group: 1, 2

Verdict: WRONG ANSWER

Test 16

Group: 1, 2

Verdict: ACCEPTED

Test 17

Group: 1, 2

Verdict: ACCEPTED

Test 18

Group: 1, 2

Verdict: ACCEPTED

Test 19

Group: 1, 2

Verdict: ACCEPTED

Test 20

Group: 1, 2

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: ACCEPTED

Test 24

Group: 1, 2

Verdict: ACCEPTED

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 26

Group: 1, 2

Verdict: ACCEPTED

Test 27

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 28

Group: 1, 2

Verdict: ACCEPTED

Test 29

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 30

Group: 1, 2

Verdict: ACCEPTED

Test 31

Group: 2

Verdict: TIME LIMIT EXCEEDED