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() as i32;

    let mut kolikko_diffs: Vec<i32> = pos_of_c(&line, '*')
        .iter()
        .map(|x| *x as i32 - robotti_pos as i32)
        .collect();

    loop {
        let closest = closest_kaks(&kolikko_diffs);
        if closest.0 == closest.1 {
            break;
        }

        let diff = closest.0;

        askeleet += diff.abs();
        robotti_pos += diff;

        for d in kolikko_diffs.iter_mut() {
            *d -= diff;
        }

        kolikot += 1;
        for c in 0..kolikko_diffs.len() {
            if kolikko_diffs[c] == diff {
                kolikko_diffs.remove(c);
                break;
            }
        }

        //DEBUG
        if debug_mode {
            for i in 0..n {
                if i == robotti_pos as usize {
                    print!("R");
                } else if pos_of_c(&line, '*').contains(&i) {
                    print!("*");
                } else {
                    print!(".");
                }
            }
            println!("");
        }
    }

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

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
}

fn closest_kaks(arr: &[i32]) -> (i32, i32) {
    let mut closest = (i32::MAX, i32::MAX);

    for a in arr {
        if a.abs() < closest.0.abs() {
            closest.1 = closest.0;
            closest.0 = *a;
        }
    }

    /* dbg!(arr);
        dbg!(closest);
    */
    closest
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 1, 2

Verdict: WRONG ANSWER

Test 5

Group: 1, 2

Verdict: WRONG ANSWER

Test 6

Group: 1, 2

Verdict: WRONG ANSWER

Test 7

Group: 1, 2

Verdict: WRONG ANSWER

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

Test 9

Group: 1, 2

Verdict: WRONG ANSWER

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

Test 11

Group: 1, 2

Verdict: WRONG ANSWER

Test 12

Group: 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: WRONG ANSWER

Test 14

Group: 2

Verdict: WRONG ANSWER

Test 15

Group: 2

Verdict: WRONG ANSWER

Test 16

Group: 2

Verdict: WRONG ANSWER

Test 17

Group: 2

Verdict: ACCEPTED

Test 18

Group: 2

Verdict: WRONG ANSWER

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 2

Verdict: WRONG ANSWER

Test 22

Group: 2

Verdict: WRONG ANSWER

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 2

Verdict: TIME LIMIT EXCEEDED