CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:onyx
Submission time:2024-11-05 13:42:24 +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
#40.00 s1, 2details
#5ACCEPTED0.00 s1, 2details
#6ACCEPTED0.00 s1, 2details
#7ACCEPTED0.00 s1, 2details
#80.00 s1, 2details
#90.00 s1, 2details
#10ACCEPTED0.00 s1, 2details
#11ACCEPTED0.00 s1, 2details
#12ACCEPTED0.00 s2details
#13ACCEPTED0.00 s2details
#14ACCEPTED0.00 s2details
#15ACCEPTED0.00 s2details
#16ACCEPTED0.00 s2details
#17ACCEPTED0.01 s2details
#18ACCEPTED0.01 s2details
#19ACCEPTED0.01 s2details
#200.01 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.01 s2details
#23ACCEPTED0.01 s2details
#24ACCEPTED0.01 s2details

Code

use std::collections::VecDeque;
use std::io::{BufRead, BufReader};

fn main() {
    let mut amount = String::new();
    let mut reader = BufReader::new(std::io::stdin());
    reader.read_line(&mut amount).unwrap();
    let mut building = String::with_capacity(amount.trim().parse().unwrap());
    reader.read_line(&mut building).unwrap();

    let rooms: Vec<(_, _)> = building.char_indices().collect();
    let mut robot_pos = rooms.iter().position(|&x| x.1 == 'R').unwrap() as i32;
    let mut indices: VecDeque<_> = rooms
        .into_iter()
        .filter(|x| x.1 == '*' || x.1 == 'R')
        .map(|x| x.0 as i32)
        .collect();
    let robot_index = indices.iter().position(|x| x == &robot_pos).unwrap();
    let mut split = indices.split_off(robot_index);
    robot_pos = split.pop_front().unwrap();

    let mut left = indices.pop_back().unwrap_or(-1);
    let mut right = split.pop_front().unwrap_or(-1);

    let mut left_dist = robot_pos - left;
    let mut right_dist = right - robot_pos;

    let mut steps = 0;
    let mut coins = 0;
    while left_dist != right_dist || (left_dist != -1 && right_dist != -1) {
        if left == -1 && right == -1 {
            break;
        }

        let next = if left == -1 && right != -1 {
            steps += right_dist;
            right
        } else if left != -1 && right == -1 {
            steps += left_dist;
            left
        } else if left_dist == -1 {
            steps += right_dist;
            right
        } else if right_dist == -1 {
            steps += left_dist;
            left
        } else if left_dist < right_dist {
            split.push_front(right);
            steps += left_dist;
            left
        } else {
            indices.push_back(left);
            steps += right_dist;
            right
        };
        coins += 1;

        robot_pos = next;

        left = indices.pop_back().unwrap_or(-1);
        right = split.pop_front().unwrap_or(-1);

        left_dist = robot_pos - left;
        right_dist = right - robot_pos;
    }
    println!("{steps} {coins}");
}

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:

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

correct output
0 0

user output
15 9

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

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

correct output
1287 400

user output
1287 400

Test 8

Group: 1, 2

Verdict:

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

correct output
0 0

user output
1684 900

Test 9

Group: 1, 2

Verdict:

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

correct output
0 0

user output
1684 999

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

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

correct output
18766 5000

user output
18766 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: ACCEPTED

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

correct output
299934 10000

user output
299934 10000

Test 19

Group: 2

Verdict: ACCEPTED

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

correct output
299998 100000

user output
299998 100000

Test 20

Group: 2

Verdict:

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

correct output
0 0

user output
299998 199999

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

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

correct output
199999 199999

user output
199999 199999

Test 24

Group: 2

Verdict: ACCEPTED

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

correct output
199999 199999

user output
199999 199999