CSES - Datatähti 2026 alku

Submission details
Task:	Tulkki
Sender:	MatoCSES
Submission time:	2025-10-28 18:43:03 +0200
Language:	Rust (2021)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	12
#2	ACCEPTED	32
#3	ACCEPTED	56

Test results
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.00 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.05 s	3	details
#16	ACCEPTED	0.00 s	3	details
#17	ACCEPTED	0.04 s	3	details
#18	ACCEPTED	0.02 s	3	details

Code

use std::{char, collections::HashMap, io};

struct Commands {}
impl Commands {
    const INCREASE: &'static str = "INCREASE";
    const CLEAR: &'static str = "CLEAR";
    const PRINT: &'static str = "PRINT";
    const REPEAT: &'static str = "REPEAT";
}

fn main() {
    let variables: HashMap<char, usize> = init_variables();

    let commands: Vec<String> = read_input();
    parse_input(&commands, variables);
}

fn init_variables() -> HashMap<char, usize> {
    let mut variables: HashMap<char, usize> = HashMap::new();
    for k in 65 .. 91 as u8 {
        variables.insert(k as char, 0);
    }
    return variables;
}

fn read_input() -> Vec<String> {
    let mut empty_line_count: usize = 0;
    let mut input: String = String::new();
    for line in io::stdin().lines() {
        let mut line: String = line.unwrap();
        if line.contains("#") { _ = line.split_off(line.find("#").unwrap()); }
        if line != "" {
            empty_line_count = 0;
            input = format!("{}:{}", input, line.replace("\n", "").replace("\r", "").replace("\t", "").replace(" ", ":"));
        } else {
            empty_line_count += 1;
            if empty_line_count > 5 { break; }
        }
    }

    let mut commands: Vec<String> = input.trim().split(":").map(|s| s.to_string()).collect();
    commands.retain(|c| c != "");
    return commands;
}

fn parse_input(commands: &Vec<String>, mut variables: HashMap<char, usize>) -> HashMap<char, usize> {
    let mut i: usize = 0;
    while i < commands.len() {
        match commands[i].as_str() {
            Commands::INCREASE => { variables = c_increase(commands[i+1].chars().next().unwrap(), variables); i += 1; }
            Commands::CLEAR => { variables = c_clear(commands[i+1].chars().next().unwrap(), variables); i += 1; }
            Commands::PRINT => { c_print(commands[i+1].chars().next().unwrap(), &variables); i += 1; }
            Commands::REPEAT => { 
                let loop_commands: Vec<String> = get_loop(commands.to_vec(), i);
                variables = c_repeat(commands[i+1].chars().next().unwrap(), variables, &loop_commands);
                i += loop_commands.len() + 4; 
            }
            _ => {}
        }

        i += 1;
    }
    return variables;
}

fn get_loop(commands: Vec<String>, i: usize) -> Vec<String> {
    let mut loop_commands: Vec<String> = Vec::new();

    let mut closure_count: usize = 1;
    let mut j: usize = 0;
    while closure_count > 0 {
        let c: &String = &commands[i + 4 + j];

        if c == "TIMES" { closure_count += 1; }
        else if c == ")" { closure_count -= 1; }

        if closure_count > 0 {
            loop_commands.push(c.to_string());
        }

        j += 1;
    }

    return loop_commands;
}

fn c_clear(key: char, mut variables: HashMap<char, usize>) -> HashMap<char, usize> {
    variables.entry(key).and_modify(|value: &mut usize| *value = 0);
    return variables;
}

fn c_increase(key: char, mut variables: HashMap<char, usize>) -> HashMap<char, usize> {
    variables.entry(key).and_modify(|value: &mut usize| *value += 1);
    return variables;
}

fn c_print(key: char, variables: &HashMap<char, usize>) {
    print!("{} ", variables.get(&key).unwrap());
}

fn c_repeat(key: char, mut variables: HashMap<char, usize>, loop_commands: &Vec<String>) -> HashMap<char, usize> {
    let iteration_count: usize = *variables.get(&key).unwrap();
    for _ in 0 .. iteration_count {
        variables = parse_input(loop_commands, variables);
    }
    return variables;
}

Test details

Test 1 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`PRINT X INCREASE X PRINT X INCREASE X PRINT X ...` view save

correct output
`0 1 2 0` view save

user output
`0 1 2 0` view save

Test 2 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`INCREASE X # aybabtu PRINT X INCREASE # test ...` view save

correct output
`1 3` view save

user output
`1 3` view save

Test 3 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`# Create number 3 INCREASE X INCREASE X INCREASE X ...` view save

correct output
`3` view save

user output
`3` view save

Test 4 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`INCREASE A PRINT A INCREASE B PRINT B INCREASE C ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

Test 5 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`INCREASE X INCREASE X INCREASE X INCREASE X INCREASE X ...` view save

correct output
`999` view save

user output
`999` view save

Test 6 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`PRINT X PRINT X PRINT X PRINT X PRINT X ...` view save

correct output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Test 7 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`5 5 5 5 5` view save

user output
`5 5 5 5 5` view save

Test 8 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`0 0 0 0 0` view save

user output
`0 0 0 0 0` view save

Test 9 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`6 7 8 9 10` view save

user output
`6 7 8 9 10` view save

Test 10 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`5 5` view save

user output
`5 5` view save

Test 11 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`20` view save

user output
`20` view save

Test 12 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE B INCREASE B ...` view save

correct output
`42` view save

user output
`42` view save

Test 13 (public)

Group: 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`1 2 2 3 3 3 4 4 4 4 5 5 5 5 5` view save

user output
`1 2 2 3 3 3 4 4 4 4 5 5 5 5 5` view save

Test 14 (public)

Group: 3

Verdict: ACCEPTED

input
`# Create number 3 INCREASE A INCREASE A INCREASE...` view save

correct output
`12` view save

user output
`12` view save

Test 15 (public)

Group: 3

Verdict: ACCEPTED

input
`INCREASE X INCREASE X INCREASE X INCREASE X INCREASE X ...` view save

correct output
`531441` view save

user output
`531441` view save

Test 16 (public)

Group: 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`1337` view save

user output
`1337` view save

Test 17 (public)

Group: 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A REPEAT A TIMES ( REPEAT A TIMES ( ...` view save

correct output
`1 2 1 2 1 1 3 4 3 4 3 4 3 4 3 ...` view save

user output
`1 2 1 2 1 1 3 4 3 4 3 4 3 4 3 ...` view save

Test 18 (public)

Group: 3

Verdict: ACCEPTED

input
`# Efficient algorithm for find...` view save

correct output
`2 3 5 7 11 13 17 19 23 29 31 3...` view save

user output
`2 3 5 7 11 13 17 19 23 29 31 3...` view save

Datatähti 2026 alku

Tulkki

Code

Test details

Test 1 (public)

Test 2 (public)

Test 3 (public)

Test 4 (public)

Test 5 (public)

Test 6 (public)

Test 7 (public)

Test 8 (public)

Test 9 (public)

Test 10 (public)

Test 11 (public)

Test 12 (public)

Test 13 (public)

Test 14 (public)

Test 15 (public)

Test 16 (public)

Test 17 (public)

Test 18 (public)

Tasks

Submissions (MatoCSES)