CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:leonard
Submission time:2024-10-29 10:45:45 +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.03 s2details
#15ACCEPTED0.11 s2details
#16ACCEPTED0.12 s2details
#17ACCEPTED0.00 s2details
#18ACCEPTED0.11 s2details
#19--2details
#20--2details
#21ACCEPTED0.00 s2details
#22ACCEPTED0.03 s2details
#23--2details
#24--2details

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();
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;
askeleet += diff.abs();
robotti_pos = (robotti_pos as i32 + diff) as usize;
kolikot += 1;
kolikko_positions.retain(|x| *x != close);
//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);
}
#[inline(always)]
fn closest(a: &usize, b: &[usize]) -> Option<usize> {
let mut c = usize::MAX;
let mut c_index = 0;
let mut wurst: Option<usize> = None;
if b.is_empty() {
return None;
}
for i in 0..b.len() {
let diff = dist((*a, b[i]));
if diff < c {
c = diff;
c_index = i;
wurst = None;
}
if diff == c {
wurst = Some(c);
}
}
// Tyhmä ropotti >:(
if wurst == None {
return None;
}
Some(b[c_index])
}
#[inline(always)]
fn dist((a, b): (usize, usize)) -> usize {
a.abs_diff(b)
}
fn pos_of_c(s: &str, 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:

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

correct output
0 0

user output
12 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
1313 900

Test 9

Group: 1, 2

Verdict:

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

correct output
0 0

user output
1313 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:

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

correct output
299998 100000

user output
(empty)

Test 20

Group: 2

Verdict:

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

correct output
0 0

user output
(empty)

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)