| Task: | Tulkki |
| Sender: | Jaksu |
| Submission time: | 2025-10-28 17:36:13 +0200 |
| Language: | Rust (2021) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 12 |
| #2 | ACCEPTED | 32 |
| #3 | ACCEPTED | 56 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #2 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #4 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #5 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #6 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #7 | ACCEPTED | 0.00 s | 2, 3 | details |
| #8 | ACCEPTED | 0.00 s | 2, 3 | details |
| #9 | ACCEPTED | 0.00 s | 2, 3 | details |
| #10 | ACCEPTED | 0.00 s | 2, 3 | details |
| #11 | ACCEPTED | 0.00 s | 2, 3 | details |
| #12 | ACCEPTED | 0.00 s | 2, 3 | details |
| #13 | ACCEPTED | 0.00 s | 3 | details |
| #14 | ACCEPTED | 0.00 s | 3 | details |
| #15 | ACCEPTED | 0.08 s | 3 | details |
| #16 | ACCEPTED | 0.00 s | 3 | details |
| #17 | ACCEPTED | 0.57 s | 3 | details |
| #18 | ACCEPTED | 0.03 s | 3 | details |
Compiler report
warning: unused import: `str::SplitAsciiWhitespace`
--> input/code.rs:1:15
|
1 | use std::{io, str::SplitAsciiWhitespace};
| ^^^^^^^^^^^^^^^^^^^^^^^^^
|
= note: `#[warn(unused_imports)]` on by default
warning: 1 warning emittedCode
use std::{io, str::SplitAsciiWhitespace};
fn main() {
let mut command: String = String::from("");
let mut variables: [usize; 26] = [0;26];
let mut index: usize = 0;
let mut emptylines: usize = 0;
let mut ignorenext: usize = 0;
let mut repeatmemory: Vec<String> = vec!();
let mut repeating: bool = false;
let mut leftbrackets: usize = 0;
let mut rightbrackets: usize = 0;
loop {
let mut input = String::new();
io::stdin().read_line(&mut input).expect("Failed to read input");
if input.trim() == String::new() {
emptylines += 1;
if emptylines > 100 {
break;
}
}
let splitcode: Vec<String> = input.split("#").map(|e| e.to_string()).collect();
let code = &splitcode[0];
let instructionlist: Vec<String> = code.split_ascii_whitespace().map(|e| e.to_string()).collect();
run(instructionlist, &mut ignorenext, &mut command, &mut index, &mut variables, &mut repeatmemory, &mut repeating, &mut leftbrackets, &mut rightbrackets);
}
}
pub fn run(instructionlist: Vec<String>, ignorenext: &mut usize, command: &mut String, index: &mut usize, variables: &mut [usize;26], repeatmemory: &mut Vec<String>, repeating: &mut bool, leftbrackets: &mut usize, rightbrackets: &mut usize) {
for instruction in instructionlist {
if *ignorenext > 0 {
*ignorenext -= 1;
continue;
}
if !*repeating {
if *command != String::from("") {
*index = instruction.as_bytes()[0] as usize - 65;
let val = command.as_str();
match val {
// VAIHDA STRINGEIKSI
"CLEAR" => {variables[*index] = 0;},
"INCREASE" => {variables[*index] += 1;},
"PRINT" => {println!("{}", variables[*index]);},
"REPEAT" => {*ignorenext = 2; *repeating = true; *leftbrackets += 1},
_ => {},
}
if command != "REPEAT" {
*command = String::from("");
}
} else {
*command = instruction;
}
} else {
if instruction != String::from(")") {
if instruction == String::from("(") {
*leftbrackets += 1;
}
repeatmemory.push(instruction);
} else {
*rightbrackets += 1;
if leftbrackets == rightbrackets {
let mut repeatmemory2: Vec<String> = vec!();
let mut repeatignorenext: usize = 0;
let mut repeatcommand = "".to_string();
let mut repeatindex: usize = 0;
let mut repeatrepeating: bool = false;
let repeatamount = variables[*index].clone();
for _i in 0..repeatamount {
run(repeatmemory.to_vec(), &mut repeatignorenext, &mut repeatcommand, &mut repeatindex, variables, &mut repeatmemory2, &mut repeatrepeating, leftbrackets, rightbrackets);
}
*repeating = false;
*command = "".to_string();
*repeatmemory = vec!();
} else {
repeatmemory.push(instruction);
}
}
}
}
}
#[derive(PartialEq, Eq, Debug)]
pub enum Command {
None,
Clear,
Increase,
Print,
Repeat,
}Test details
Test 1 (public)
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| PRINT X INCREASE X PRINT X INCREASE X PRINT X ... |
| correct output |
|---|
| 0 1 2 0 |
| user output |
|---|
| 0 1 2 0 |
Test 2 (public)
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE X # aybabtu PRINT X INCREASE # test ... |
| correct output |
|---|
| 1 3 |
| user output |
|---|
| 1 3 |
Test 3 (public)
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| # Create number 3 INCREASE X INCREASE X INCREASE X ... |
| correct output |
|---|
| 3 |
| user output |
|---|
| 3 |
Test 4 (public)
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A PRINT A INCREASE B PRINT B INCREASE C ... |
| correct output |
|---|
| 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| user output |
|---|
| 1 1 1 1 1 ... |
Test 5 (public)
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE X INCREASE X INCREASE X INCREASE X INCREASE X ... |
| correct output |
|---|
| 999 |
| user output |
|---|
| 999 |
Test 6 (public)
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| PRINT X PRINT X PRINT X PRINT X PRINT X ... |
| correct output |
|---|
| 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| user output |
|---|
| 0 0 0 0 0 ... |
Test 7 (public)
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 5 5 5 5 5 |
| user output |
|---|
| 5 5 5 5 5 |
Test 8 (public)
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 0 0 0 0 0 |
| user output |
|---|
| 0 0 0 0 0 |
Test 9 (public)
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 6 7 8 9 10 |
| user output |
|---|
| 6 7 8 9 10 |
Test 10 (public)
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 5 5 |
| user output |
|---|
| 5 5 |
Test 11 (public)
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 20 |
| user output |
|---|
| 20 |
Test 12 (public)
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE B INCREASE B ... |
| correct output |
|---|
| 42 |
| user output |
|---|
| 42 |
Test 13 (public)
Group: 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 1 2 2 3 3 3 4 4 4 4 5 5 5 5 5 |
| user output |
|---|
| 1 2 2 3 3 ... |
Test 14 (public)
Group: 3
Verdict: ACCEPTED
| input |
|---|
| # Create number 3 INCREASE A INCREASE A INCREASE... |
| correct output |
|---|
| 12 |
| user output |
|---|
| 12 |
Test 15 (public)
Group: 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE X INCREASE X INCREASE X INCREASE X INCREASE X ... |
| correct output |
|---|
| 531441 |
| user output |
|---|
| 531441 |
Test 16 (public)
Group: 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 1337 |
| user output |
|---|
| 1337 |
Test 17 (public)
Group: 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A REPEAT A TIMES ( REPEAT A TIMES ( ... |
| correct output |
|---|
| 1 2 1 2 1 1 3 4 3 4 3 4 3 4 3 ... |
| user output |
|---|
| 1 2 1 2 1 ... |
Test 18 (public)
Group: 3
Verdict: ACCEPTED
| input |
|---|
| # Efficient algorithm for find... |
| correct output |
|---|
| 2 3 5 7 11 13 17 19 23 29 31 3... |
| user output |
|---|
| 2 3 5 7 11 ... |
