Submission details
Task:Tulkki
Sender:zli0122
Submission time:2025-10-28 11:35:55 +0200
Language:C++ (C++11)
Status:READY
Result:44
Feedback
groupverdictscore
#1ACCEPTED12
#2ACCEPTED32
#30
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.01 s3details
#16ACCEPTED0.00 s3details
#170.01 s3details
#18--3details

Compiler report

input/code.cpp: In function 'void solve()':
input/code.cpp:50:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for(int i=0; i<commands.size(); i++) {
      |                  ~^~~~~~~~~~~~~~~~

Code

#include <bits/stdc++.h>

 
#define Debug(x) cout << #x << ": " << (x) << "\n"
#define debug(x) cout << #x << ": " << (x) << ", "

using namespace std;

streamsize MAX_SIZE = 67000;

void solve() {
    string c;
    char X;
    vector<pair<int, int>> commands;
    while (cin >> c) {
        if (c[0]=='#') { // COMMENT
            cin.ignore(MAX_SIZE, '\n');
        }
        if (c[0] == 'C') { // CLEAR, code 0
            cin >> X;
            while (X == '#') {cin.ignore(MAX_SIZE, '\n');cin >> X;}
            commands.push_back({0, X-'A'});
        }
        if (c[0] == 'I') { // INCREASE, code 1
            cin >> X;
            while (X == '#') {cin.ignore(MAX_SIZE, '\n');cin >> X;}
            commands.push_back({1, X-'A'});
        }
        if (c[0] == 'P') { // PRINT, code 2
            cin >> X;
            while (X == '#') {cin.ignore(MAX_SIZE, '\n');cin >> X;}
            commands.push_back({2, X-'A'});
        }
        if (c[0] == 'R') { // REPEAT, code 3
            cin >> X;
            while (X == '#') {cin.ignore(MAX_SIZE, '\n');cin >> X;}
            cin.ignore(MAX_SIZE, '(');
            commands.push_back({3, X-'A'});
        }
        if (c[0] == ')') { // STOP REPEAT, code 4
            commands.push_back({4, 0});
        }
    }

    stack<pair<int, int>> repeat_counters; // repeat location, number of times.
    int var, op;
    pair<int, int> curr_repeat = {0,1};
    int memory[26] = {};

    for(int i=0; i<commands.size(); i++) {
        // Debug(i);
        // debug(commands[i].first);
        // debug(commands[i].second);
        // debug(curr_repeat.first);
        // Debug(curr_repeat.second);
        // for (auto j : memory) cout << j;
        // cout << "\n\n";

        op = commands[i].first;
        var = commands[i].second;
        if (op == 4) {
            if (curr_repeat.second == 1) { // if this is the last loop-through
                if (!repeat_counters.empty()) {
                    curr_repeat=repeat_counters.top();
                    repeat_counters.pop();
                }
            } else {
                curr_repeat.second--;
                i = curr_repeat.first;
            }
        }
        if (op == 3) {
            if (curr_repeat.second > 1) { // remember the ongoing loop before stepping into the next
                repeat_counters.push(curr_repeat);
            }
            curr_repeat = {i, memory[var]};
        }
        if (op == 2) {
            cout << memory[var] << " ";
        }
        if (op == 1) {
            memory[var]++;
        }
        if (op == 0) {
            memory[var]=0;
        }
    }
    cout << "\n";
}

int main() {
    solve();
}

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

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:

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

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
(empty)