| Task: | Robotti |
| Sender: | Kivvil |
| Submission time: | 2024-11-01 21:24:08 +0200 |
| Language: | Rust (2021) |
| Status: | READY |
| Result: | 30 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 30 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2 | details |
| #2 | ACCEPTED | 0.00 s | 1, 2 | details |
| #3 | ACCEPTED | 0.00 s | 1, 2 | details |
| #4 | ACCEPTED | 0.00 s | 1, 2 | details |
| #5 | ACCEPTED | 0.00 s | 1, 2 | details |
| #6 | ACCEPTED | 0.00 s | 1, 2 | details |
| #7 | ACCEPTED | 0.00 s | 1, 2 | details |
| #8 | ACCEPTED | 0.00 s | 1, 2 | details |
| #9 | ACCEPTED | 0.00 s | 1, 2 | details |
| #10 | ACCEPTED | 0.00 s | 1, 2 | details |
| #11 | ACCEPTED | 0.00 s | 1, 2 | details |
| #12 | ACCEPTED | 0.00 s | 2 | details |
| #13 | ACCEPTED | 0.00 s | 2 | details |
| #14 | ACCEPTED | 0.01 s | 2 | details |
| #15 | ACCEPTED | 0.05 s | 2 | details |
| #16 | ACCEPTED | 0.04 s | 2 | details |
| #17 | ACCEPTED | 0.00 s | 2 | details |
| #18 | ACCEPTED | 0.04 s | 2 | details |
| #19 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #20 | ACCEPTED | 0.01 s | 2 | details |
| #21 | ACCEPTED | 0.00 s | 2 | details |
| #22 | ACCEPTED | 0.02 s | 2 | details |
| #23 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #24 | TIME LIMIT EXCEEDED | -- | 2 | details |
Compiler report
warning: field `kartan_pituus` is never read
--> input/code.rs:17:5
|
15 | struct Rakennus {
| -------- field in this struct
16 | kolikot: Vec<Kolikko>,
17 | kartan_pituus: usize,
| ^^^^^^^^^^^^^
|
= note: `#[warn(dead_code)]` on by default
warning: variants `Tyhja` and `Kolikko` are never constructed
--> input/code.rs:195:5
|
194 | enum Huone {
| ----- variants in this enum
195 | Tyhja,
| ^^^^^
196 | Kolikko,
| ^^^^^^^
warning: associated function `from_char` is never used
--> input/code.rs:205:8
|
204 | impl Huone {
| ---------- associated function in this implementation
205 | fn from_char(character: char) -> Self {
| ^^^^^^^^^
warning: 3 warnings emittedCode
use std::vec::Vec;
fn main() {
let mut stdin_lines = std::io::stdin().lines();
// Luetaan vain kartta huoneista, ei tarvita ensimmäistä riviä, joten skipataan se.
let _ = stdin_lines.next();
let rivi = stdin_lines.next().unwrap().unwrap();
let mut rakennus = Rakennus::new(rivi);
let (askeleet, kolikot) = rakennus.pelaa();
println!("{} {}", askeleet, kolikot);
}
struct Rakennus {
kolikot: Vec<Kolikko>,
kartan_pituus: usize,
// Indeksi huoneet-vektoriin, jossa robotti sijaitsee
robotti_indeksi: usize,
// Edellinen indeksi kolikot-vektoriin, jossa kolikko on sijainnut.
edellinen_kolikkoindeksi: usize,
keratyt_kolikot: u32,
askeleet: u32,
}
impl Rakennus {
fn new(syote: String) -> Self {
Self {
kolikot: {
let mut kolikot = vec![];
for (indeksi, merkki) in syote.chars().enumerate() {
if merkki == '*' {
kolikot.push(Kolikko {
keratty: false,
indeksi,
});
}
}
kolikot
},
robotti_indeksi: syote.find("R").unwrap(),
edellinen_kolikkoindeksi: 0,
keratyt_kolikot: 0,
askeleet: 0,
kartan_pituus: syote.len(),
}
}
// Pelaa peliä. Palauttaa tuplen, jossa ensimmäinen askelten määrä ja toinen kerättyjen
// kolikoiden määrä
fn pelaa(&mut self) -> (u32, u32) {
// self.tulosta_huoneet();
self.pelaa_inner();
(self.askeleet, self.keratyt_kolikot)
}
// Funktio, joka pelaa peliä yksi kolikon keräys kerrallaan
fn pelaa_inner(&mut self) {
{
// println!("Robo idx: {}", self.robotti_indeksi);
let lahin_kolikko = match self.etsi_ensimmainen_kolikko() {
Some(kolikko) => kolikko,
None => {
return;
}
};
self.askeleet += (self.robotti_indeksi as i32
- self.kolikot[lahin_kolikko].indeksi as i32)
.abs() as u32;
self.keratyt_kolikot += 1;
self.robotti_indeksi = self.kolikot[lahin_kolikko].indeksi;
self.kolikot[lahin_kolikko].keratty = true;
self.edellinen_kolikkoindeksi = lahin_kolikko;
// println!("Robo idx: {}", self.robotti_indeksi);
}
// self.tulosta_huoneet();
loop {
let lahin_kolikko = match self.etsi_lahin_kolikko() {
Some(kolikko) => kolikko,
None => {
return;
}
};
self.askeleet += (self.robotti_indeksi as i32
- self.kolikot[lahin_kolikko].indeksi as i32)
.abs() as u32;
self.keratyt_kolikot += 1;
self.robotti_indeksi = self.kolikot[lahin_kolikko].indeksi;
self.kolikot[lahin_kolikko].keratty = true;
self.edellinen_kolikkoindeksi = lahin_kolikko;
// println!("Robo idx: {}", self.robotti_indeksi);
// self.tulosta_huoneet();
}
}
fn etsi_ensimmainen_kolikko(&self) -> Option<usize> {
let kolikko_oikealla_indeksi = self
.kolikot
.iter()
.position(|kolikko| kolikko.indeksi > self.robotti_indeksi);
if let None = kolikko_oikealla_indeksi {
if self.kolikot.len() > 0 {
return Some(self.kolikot.len() - 1);
} else {
return None;
}
}
let kolikko_oikealla_indeksi = kolikko_oikealla_indeksi.unwrap();
if kolikko_oikealla_indeksi == 0 {
return Some(kolikko_oikealla_indeksi);
}
let kolikko_vasemmalla_indeksi = kolikko_oikealla_indeksi - 1;
let etaisyys_oikealle =
self.kolikot[kolikko_oikealla_indeksi].indeksi - self.robotti_indeksi;
let etaisyys_vasemmalle =
self.robotti_indeksi - self.kolikot[kolikko_vasemmalla_indeksi].indeksi;
if etaisyys_vasemmalle > etaisyys_oikealle {
Some(kolikko_oikealla_indeksi)
} else if etaisyys_oikealle > etaisyys_vasemmalle {
Some(kolikko_vasemmalla_indeksi)
} else {
None
}
}
// Etsii lahimman kolikon ja jos löytyy, palauttaa indeksin kolikot-vektoriin
fn etsi_lahin_kolikko(&self) -> Option<usize> {
let kolikko_indeksi_vasemmalla = self.etsi_kolikko_vasemmalla();
let kolikko_indeksi_oikealla = self.etsi_kolikko_oikealla();
if let None = kolikko_indeksi_vasemmalla {
return kolikko_indeksi_oikealla;
}
if let None = kolikko_indeksi_oikealla {
return kolikko_indeksi_vasemmalla;
}
let kolikko_vasemmalla = &self.kolikot[kolikko_indeksi_vasemmalla.unwrap()];
let kolikko_oikealla = &self.kolikot[kolikko_indeksi_oikealla.unwrap()];
let etaisyys_vasemmalle = self.robotti_indeksi - kolikko_vasemmalla.indeksi;
let etaisyys_oikealle = kolikko_oikealla.indeksi - self.robotti_indeksi;
if etaisyys_vasemmalle > etaisyys_oikealle {
Some(kolikko_indeksi_oikealla.unwrap())
} else if etaisyys_oikealle > etaisyys_vasemmalle {
Some(kolikko_indeksi_vasemmalla.unwrap())
} else {
None
}
}
fn etsi_kolikko_oikealla(&self) -> Option<usize> {
match self.kolikot[self.edellinen_kolikkoindeksi..self.kolikot.len()]
.iter()
.position(|kolikko| !kolikko.keratty)
{
Some(pos) => Some(pos + self.edellinen_kolikkoindeksi),
None => None,
}
}
fn etsi_kolikko_vasemmalla(&self) -> Option<usize> {
match self.kolikot[0..=self.edellinen_kolikkoindeksi]
.iter()
.rev()
.position(|kolikko| !kolikko.keratty)
{
Some(pos) => Some(self.edellinen_kolikkoindeksi - pos),
None => None,
}
}
// fn tulosta_huoneet(&self) {
// let mut string = self
// .huoneet
// .iter()
// .map(|huone| match huone {
// Huone::Tyhja => ".",
// Huone::Kolikko => "*",
// })
// .collect::<String>();
// string.replace_range(self.robotti_indeksi..self.robotti_indeksi + 1, "R");
// println!("Huoneet: {}", string);
// }
}
#[derive(PartialEq, Eq)]
enum Huone {
Tyhja,
Kolikko,
}
struct Kolikko {
keratty: bool,
indeksi: usize,
}
impl Huone {
fn from_char(character: char) -> Self {
match character {
'*' => Huone::Kolikko,
'.' => Huone::Tyhja,
'R' => Huone::Tyhja,
_ => panic!("Viallinen merkki stdin:ssa"),
}
}
}
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: ACCEPTED
| input |
|---|
| 1000 .....*..*....**..**..*......*.... |
| correct output |
|---|
| 1287 400 |
| user output |
|---|
| 1287 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: 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: TIME LIMIT EXCEEDED
| 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: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 R*****************************... |
| correct output |
|---|
| 199999 199999 |
| user output |
|---|
| (empty) |
Test 24
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 ******************************... |
| correct output |
|---|
| 199999 199999 |
| user output |
|---|
| (empty) |
