Submission details
Task:Tulkki
Sender:sevti
Submission time:2025-10-27 11:25:30 +0200
Language:Python3 (PyPy3)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1, 2, 3details
#20.07 s1, 2, 3details
#3ACCEPTED0.04 s1, 2, 3details
#4ACCEPTED0.04 s1, 2, 3details
#5ACCEPTED0.05 s1, 2, 3details
#6ACCEPTED0.06 s1, 2, 3details
#7ACCEPTED0.04 s2, 3details
#8ACCEPTED0.04 s2, 3details
#9ACCEPTED0.04 s2, 3details
#10ACCEPTED0.04 s2, 3details
#11ACCEPTED0.04 s2, 3details
#12ACCEPTED0.04 s2, 3details
#130.04 s3details
#140.04 s3details
#150.04 s3details
#160.04 s3details
#170.04 s3details
#180.04 s3details

Code

import sys

vars = {chr(c): 0 for c in range(ord('A'), ord('Z') + 1)}
code = sys.stdin.read().splitlines()

comm_cleaner = []
for line in code:
    if '#' in line:
        line = line[:line.index('#')]
    comm_cleaner.append(line)
code = comm_cleaner

i = 0

def run(lines):
    tokens = []
    for line in lines:
        tokens.extend(line.split())
    
    j = 0
    while j < len(tokens):
        cmd = tokens[j]
        
        if cmd == 'CLEAR':
            vars[tokens[j + 1]] = 0
            j += 2
        elif cmd == 'INCREASE':
            vars[tokens[j + 1]] += 1
            j += 2
        elif cmd == 'PRINT':
            print(vars[tokens[j + 1]], end=' ')
            j += 2
        else:
            j += 1
            
while i < len(code):
    line = code[i].strip()
    
    if not line:
        i += 1
        continue
        
    if line.startswith('REPEAT'):
        parts = line.split()
        count_var = parts[1]
        repeat_count = vars[count_var]
        
        block_lines = []
        i += 1
        depth = 1
        
        while i < len(code):
            curr = code[i].strip()
            tokens_in_line = curr.split()
            
            for tok in tokens_in_line:
                if tok == 'REPEAT':
                    depth += 1
                elif tok == ')':
                    depth -= 1
                    
            if depth == 0:
                break
                
            block_lines.append(code[i])
            i += 1
            
        for _ in range(repeat_count):
            run(block_lines)
    else:
        tokens = line.split()
        j = 0
        
        while j < len(tokens):
            cmd = tokens[j]
            
            if cmd == 'CLEAR':
                vars[tokens[j + 1]] = 0
                j += 2
            elif cmd == 'INCREASE':
                vars[tokens[j + 1]] += 1
                j += 2
            elif cmd == 'PRINT':
                print(vars[tokens[j + 1]], end=' ')
                j += 2
            else:
                j += 1
    i += 1

print()

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:

input
INCREASE
X
# aybabtu
   PRINT    X
INCREASE # test
...

correct output
1 3 

user output
(empty)

Error:
Traceback (most recent call last):
  File "input/code.py", line 81, in <module>
    vars[tokens[j + 1]] += 1
IndexError: list index out of range

Test 3 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
# Create number 3
INCREASE X
INCREASE X
INCREASE X

...

correct output

user output

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 1 1 1 1 1 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 0 0 0 0 0 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:

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 3 4 5 

Feedback: Output is shorter than expected

Test 14 (public)

Group: 3

Verdict:

input
# Create number 3
INCREASE A INCREASE A INCREASE...

correct output
12 

user output
0 0 0 

Feedback: Output is longer than expected

Test 15 (public)

Group: 3

Verdict:

input
INCREASE X
INCREASE X
INCREASE X
INCREASE X
INCREASE X
...

correct output
531441 

user output

Feedback: Incorrect character on line 1 col 1: expected "531441", got "9"

Test 16 (public)

Group: 3

Verdict:

input
INCREASE A
INCREASE A
INCREASE A
INCREASE A
INCREASE A
...

correct output
1337 

user output

Feedback: Incorrect character on line 1 col 1: expected "1337", got "7"

Test 17 (public)

Group: 3

Verdict:

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 1 1 1 3 2 

Feedback: Output is shorter than expected

Test 18 (public)

Group: 3

Verdict:

input
# Efficient algorithm for find...

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

user output
2 2 3 5 6 8 9 11 13 14 15 16 2...

Feedback: Output is shorter than expected