| Task: | Tulkki |
| Sender: | rene |
| Submission time: | 2025-11-01 14:59:18 +0200 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 12 |
| #2 | ACCEPTED | 32 |
| #3 | ACCEPTED | 56 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | 1, 2, 3 | details |
| #2 | ACCEPTED | 0.04 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.04 s | 1, 2, 3 | details |
| #4 | ACCEPTED | 0.04 s | 1, 2, 3 | details |
| #5 | ACCEPTED | 0.04 s | 1, 2, 3 | details |
| #6 | ACCEPTED | 0.04 s | 1, 2, 3 | details |
| #7 | ACCEPTED | 0.04 s | 2, 3 | details |
| #8 | ACCEPTED | 0.04 s | 2, 3 | details |
| #9 | ACCEPTED | 0.04 s | 2, 3 | details |
| #10 | ACCEPTED | 0.04 s | 2, 3 | details |
| #11 | ACCEPTED | 0.04 s | 2, 3 | details |
| #12 | ACCEPTED | 0.04 s | 2, 3 | details |
| #13 | ACCEPTED | 0.04 s | 3 | details |
| #14 | ACCEPTED | 0.04 s | 3 | details |
| #15 | ACCEPTED | 0.20 s | 3 | details |
| #16 | ACCEPTED | 0.05 s | 3 | details |
| #17 | ACCEPTED | 0.22 s | 3 | details |
| #18 | ACCEPTED | 0.10 s | 3 | details |
Code
import sys
def byebyecomments(line):
hash_pos = line.find('#')
if hash_pos != -1:
return line[:hash_pos]
return line
def partize(code):
lines = code.split('\n')
cleaned_lines = [byebyecomments(line) for line in lines]
cleaned_code = '\n'.join(cleaned_lines)
return cleaned_code.split()
def parseandrun(parts, variables, start_index=0):
i = start_index
output = []
parts_len = len(parts)
while i < parts_len:
part = parts[i]
if part == ')':
return i, output
elif part == 'CLEAR':
variables[parts[i + 1]] = 0
i += 2
elif part == 'INCREASE':
variables[parts[i + 1]] += 1
i += 2
elif part == 'PRINT':
output.append(str(variables[parts[i + 1]]))
i += 2
elif part == 'REPEAT':
var = parts[i + 1]
repeat_count = variables[var]
loop_start = i + 4
if repeat_count > 0:
for _ in range(repeat_count):
next_i, block_output = parseandrun(parts, variables, loop_start)
output.extend(block_output)
i = next_i + 1
else:
depth = 1
i = loop_start
while depth > 0:
if parts[i] == '(':
depth += 1
elif parts[i] == ')':
depth -= 1
i += 1
else:
i += 1
return i, output
def main():
code = sys.stdin.read()
variables = {chr(ord('A') + i): 0 for i in range(26)}
parts = partize(code)
index, output = parseandrun(parts, variables)
if output:
print(' '.join(output))
main()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 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: 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 3 4 4 4 4 5 5 5 5 5 |
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 1 3 4 3 4 3 4 3 4 3 ... |
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 13 17 19 23 29 31 3... |
