Robotti

use rand::prelude::*;

fn main() {
    let debug_mode = std::env::args().any(|x| x == "debug".to_string());
    let auto = std::env::args().any(|x| x == "auto".to_string());

    let mut n: String = "".into();
    std::io::stdin().read_line(&mut n).expect("IO Ongelma :(");
    let n: usize = n.trim().parse().expect("Eka rivi ei ollut numero");

    let mut line: String = "".into();

    if !auto {
        // **..**..R..** juttu
        std::io::stdin()
            .read_line(&mut line)
            .expect("IO Ongelma :(");
    } else {
        let mut rng = rand::thread_rng();
        for _ in 0..n {
            let num = rng.gen_range(0.0..=1.);
            if num < 0.3 {
                line.push('*');
            } else {
                line.push('.');
            }
        }

        let half = n / 2;
        line.replace_range(half..=half, "R");
    }

    let mut askeleet = 0;
    let mut kolikot = 0;

    let mut robotti_pos = pos_of_c(&line, 'R')
        .first()
        .expect("Ei R:ää (robottia)")
        .clone();
    let mut kolikko_positions = pos_of_c(&line, '*');

    loop {
        let close = closest(&robotti_pos, &kolikko_positions);

        // Unwrap
        let close = match close {
            None => break,
            Some(s) => s,
        };

        // Optimisaatio
        let diff = close as i32 - robotti_pos as i32;

        if diff != 0 {
            askeleet += diff.abs();
            robotti_pos = (robotti_pos as i32 + diff) as usize;
        }
        // ==
        else {
            kolikot += 1;

            //Etsii löydetyn kolikon
            for (i, kp) in kolikko_positions.iter().enumerate() {
                if *kp == close {
                    kolikko_positions.remove(i);
                    break;
                }
            }
        }

        //DEBUG
        if debug_mode {
            for i in 0..n {
                if i == robotti_pos {
                    print!("R");
                } else if kolikko_positions.contains(&i) {
                    print!("*");
                } else {
                    print!(".");
                }
            }
            println!("");
        }
    }

    println!("{} {}", askeleet, kolikot);
}

fn closest(a: &usize, b: &Vec<usize>) -> Option<usize> {
    let mut c = usize::MAX;
    let mut c_index = 0;

    if b.is_empty() {
        return None;
    }

    for (i, n) in b.iter().enumerate() {
        let diff = dist((*a, *n));
        if diff < c {
            c = diff;
            c_index = i;
        }
    }

    // Toinen looppi joka tarkistaa jos on toinen yhtä kaukana oleva
    for (i, n) in b.iter().enumerate() {
        if i == c_index {
            continue;
        }

        let diff = dist((*a, *n));

        // Tyhmä ropotti >:(
        if diff == c {
            return None;
        }
    }

    Some(b[c_index])
}

fn dist((a, b): (usize, usize)) -> usize {
    a.abs_diff(b)
}

fn pos_of_c(s: &String, c: char) -> Vec<usize> {
    // *
    let mut pos = vec![];

    for (i, char) in s.chars().enumerate() {
        if char == c {
            pos.push(i);
        }
    }

    pos
}

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: 1, 2

Verdict: ACCEPTED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 1, 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 1, 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED

Test 14

Group: 2

Verdict: ACCEPTED

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: ACCEPTED

Test 17

Group: 2

Verdict: ACCEPTED

Test 18

Group: 2

Verdict: ACCEPTED

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 2

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: ACCEPTED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 2

Verdict: TIME LIMIT EXCEEDED