CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:leonard
Submission time:2024-10-29 08:08:05 +0200
Language:Rust (2021)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.00 s1, 2details
#3ACCEPTED0.00 s1, 2details
#4ACCEPTED0.00 s1, 2details
#5ACCEPTED0.00 s1, 2details
#6ACCEPTED0.00 s1, 2details
#70.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10ACCEPTED0.00 s1, 2details
#11ACCEPTED0.00 s1, 2details
#120.00 s2details
#13ACCEPTED0.00 s2details
#140.01 s2details
#15ACCEPTED0.01 s2details
#16ACCEPTED0.01 s2details
#17ACCEPTED0.01 s2details
#180.01 s2details
#19--2details
#20ACCEPTED0.01 s2details
#21ACCEPTED0.00 s2details
#22ACCEPTED0.01 s2details
#23--2details
#24--2details

Compiler report

warning: function `closest` is never used
  --> input/code.rs:89:4
   |
89 | fn closest(a: &usize, b: &[usize]) -> Option<usize> {
   |    ^^^^^^^
   |
   = note: `#[warn(dead_code)]` on by default

warning: function `dist` is never used
   --> input/code.rs:125:4
    |
125 | fn dist((a, b): (usize, usize)) -> usize {
    |    ^^^^

warning: 2 warnings emitted

Code

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();
    kolikko_diffs.sort_by(|x, y| x.abs().cmp(&y.abs()));

    loop {
        if kolikko_diffs.get(0).map(|x| x.abs()) == kolikko_diffs.get(1).map(|x| x.abs()) {
            break;
        }

        let diff = kolikko_diffs.get(0).map(|x| *x);

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

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

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

        kolikot += 1;
        kolikko_diffs.remove(0);

        //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);
}

#[inline(always)]
fn closest(a: &usize, b: &[usize]) -> Option<usize> {
    let mut c = usize::MAX;
    let mut c_index = 0;

    if b.is_empty() {
        return None;
    }

    // let distances = b.iter().map(|x| dist((*a, *x)));

    for i in 0..b.len() {
        let diff = dist((*a, b[i]));
        if diff < c {
            c = diff;
            c_index = i;
        }
    }

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

        let diff = dist((*a, b[i]));

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

    Some(b[c_index])
}

#[inline(always)]
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 details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
1
R

correct output
0 0

user output
0 0

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
10
...R......

correct output
0 0

user output
0 0

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
10
**.R...***

correct output
12 5

user output
12 5

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
10
***R******

correct output
0 0

user output
0 0

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
1000
R................................

correct output
947 9

user output
947 9

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
1000
.................................

correct output
886 9

user output
886 9

Test 7

Group: 1, 2

Verdict:

input
1000
.....*..*....**..**..*......*....

correct output
1287 400

user output
47375 400

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
1000
************.*****************...

correct output
0 0

user output
0 0

Test 9

Group: 1, 2

Verdict: ACCEPTED

input
1000
******************************...

correct output
0 0

user output
0 0

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
1000
R*****************************...

correct output
999 999

user output
999 999

Test 11

Group: 1, 2

Verdict: ACCEPTED

input
1000
******************************...

correct output
999 999

user output
999 999

Test 12

Group: 2

Verdict:

input
10000
.......**........*...........*...

correct output
10971 999

user output
101945 999

Test 13

Group: 2

Verdict: ACCEPTED

input
10000
*..*....*......*.....*..*........

correct output
9999 999

user output
9999 999

Test 14

Group: 2

Verdict:

input
10000
*.*.*...**.*...*....**.**.**.....

correct output
18766 5000

user output
1117892 5000

Test 15

Group: 2

Verdict: ACCEPTED

input
10000
R*****************************...

correct output
9999 9999

user output
9999 9999

Test 16

Group: 2

Verdict: ACCEPTED

input
10000
******************************...

correct output
9999 9999

user output
9999 9999

Test 17

Group: 2

Verdict: ACCEPTED

input
200000
.................................

correct output
0 0

user output
0 0

Test 18

Group: 2

Verdict:

input
200000
.................................

correct output
299934 10000

user output
524086098 10000

Test 19

Group: 2

Verdict:

input
200000
**.***....**..**.....***.*..*....

correct output
299998 100000

user output
(empty)

Test 20

Group: 2

Verdict: ACCEPTED

input
200000
******************************...

correct output
0 0

user output
0 0

Test 21

Group: 2

Verdict: ACCEPTED

input
200000
R................................

correct output
133765 3

user output
133765 3

Test 22

Group: 2

Verdict: ACCEPTED

input
200000
R................................

correct output
199982 5000

user output
199982 5000

Test 23

Group: 2

Verdict:

input
200000
R*****************************...

correct output
199999 199999

user output
(empty)

Test 24

Group: 2

Verdict:

input
200000
******************************...

correct output
199999 199999

user output
(empty)