Submission details
Task:Tulkki
Sender:ma100
Submission time:2025-10-28 18:13:48 +0200
Language:Rust (2021)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED12
#2ACCEPTED32
#3ACCEPTED56
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2ACCEPTED0.00 s1, 2, 3details
#3ACCEPTED0.00 s1, 2, 3details
#4ACCEPTED0.00 s1, 2, 3details
#5ACCEPTED0.00 s1, 2, 3details
#6ACCEPTED0.00 s1, 2, 3details
#7ACCEPTED0.00 s2, 3details
#8ACCEPTED0.00 s2, 3details
#9ACCEPTED0.00 s2, 3details
#10ACCEPTED0.00 s2, 3details
#11ACCEPTED0.00 s2, 3details
#12ACCEPTED0.00 s2, 3details
#13ACCEPTED0.00 s3details
#14ACCEPTED0.00 s3details
#15ACCEPTED0.03 s3details
#16ACCEPTED0.00 s3details
#17ACCEPTED0.55 s3details
#18ACCEPTED0.01 s3details

Code

use std::{io::{self, Read}};

fn interpret<'a, I>(input: &mut I, regs: &mut [u32; 26]) -> bool
where
    I: Iterator<Item = &'a str>,
{
    let instr = match input.next() {
        Some(s) => s,
        None => return true,
    };
    //println!("instr: {}", instr);

    let reg = match input.next() {
        Some(s) => s,
        None => return true,
    };
    let reg: usize = (reg.as_bytes()[0] - 65).into();
    //println!("reg: {}", reg);

    match instr {
        "CLEAR" => {
            regs[reg] = 0;
            false
        },
        "INCREASE" => {
            regs[reg] += 1;
            false
        },
        "PRINT" => {
            println!("{}", regs[reg]);
            false
        },
        "REPEAT" => {
            let n = regs[reg];
            input.next(); // TIMES
            input.next(); // (
            let mut buf: Vec<&str> = Vec::new();
            let mut braces: u16 = 1;
            loop {
                let arg = input.next().expect("expected loop to close");
                if arg != ")" {
                    buf.push(arg);
                    if arg == "(" {
                        braces += 1;
                    }
                    //println!("arg: {}", arg);
                } else {
                    braces -= 1;
                    if braces == 0 {
                        break;
                    } else {
                        buf.push(arg);
                    }
                }
            }
            let buf = buf.into_iter();
            for _ in 0..n {
                let mut buf = buf.clone();
                while !interpret(&mut buf, regs) {}
            }
            false
        }
        _ => panic!("illegal instruction '{instr}'"),
    }
}

fn main() {
    let mut regs: [u32; 26] = [0; 26];
    let mut total_input = String::with_capacity(0xffff);
    io::stdin()
        .read_to_string(&mut total_input)
        .expect("read stdin error");
    let total_input = total_input.split("\n");
    let total_input = {
        let mut processed: Vec<&str> = Vec::with_capacity(1000);
        for line in total_input {
            processed.push(match line.find("#") {
                Some(i) => &line[..i],
                None => line,
            });
        }
        processed.join("\n")
    };
    let mut input = total_input.split_ascii_whitespace().into_iter();

    loop {
        if interpret(&mut input, &mut regs) {
            break;
        }
    }
}

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

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
...