CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:wolruso
Submission time:2024-10-28 20:03:54 +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
#12ACCEPTED0.00 s2details
#13ACCEPTED0.00 s2details
#140.02 s2details
#15ACCEPTED0.14 s2details
#16ACCEPTED0.13 s2details
#17ACCEPTED0.00 s2details
#18ACCEPTED0.14 s2details
#19--2details
#20ACCEPTED0.01 s2details
#21ACCEPTED0.00 s2details
#22ACCEPTED0.04 s2details
#23--2details
#24--2details

Compiler report

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

warning: 1 warning emitted

Code

use core::panic;
use std::io::stdin;

#[derive(PartialEq, Eq)]
enum Room {
    Empty,
    HasCoin,
}

fn main() {
    let mut n = String::new();
    stdin().read_line(&mut n).unwrap();
    let room_count = n.trim().parse::<i32>().unwrap();
    let mut room_map = String::new();
    stdin().read_line(&mut room_map).unwrap();
    let mut robot_position: isize = -1;
    let rooms = room_map
        .trim()
        .chars()
        .enumerate()
        .map(|(index, room_desc)| match room_desc {
            '*' => Room::HasCoin,
            '.' => Room::Empty,
            'R' => {
                robot_position = index as isize;
                Room::Empty
            }
            _ => panic!(),
        });

    let mut coin_positions = Vec::new();
    for (index, room) in rooms.enumerate() {
        if room == Room::HasCoin {
            coin_positions.push(index as isize);
        }
    }

    if robot_position == -1 {
        panic!()
    }
    let mut num_coins_collected = 0;
    let mut num_steps_taken = 0;
    loop {
        if coin_positions.is_empty() {
            break;
        }
        let mut closest_coin: isize = -1;
        let mut closest_coin_dis: isize = -1;
        let mut should_exit: bool = false;
        for (index, coin_pos) in coin_positions.iter().enumerate() {
            let dis = robot_position.abs_diff(*coin_pos) as isize;
            if closest_coin == -1 || dis < closest_coin_dis {
                closest_coin = index as isize;
                closest_coin_dis = dis;
            } else if dis == closest_coin_dis {
                should_exit = true;
                break;
            }
        }
        if should_exit {
            break;
        }
        robot_position = coin_positions[closest_coin as usize];
        coin_positions.swap_remove(closest_coin as usize);
        num_coins_collected += 1;
        num_steps_taken += closest_coin_dis;
    }
    println!("{} {}", num_steps_taken, num_coins_collected);
}

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
104 38

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: ACCEPTED

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

correct output
10971 999

user output
10971 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
2892 1472

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: ACCEPTED

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

correct output
299934 10000

user output
299934 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)