Tulkki

input/code.cpp: In function 'void handle_command()':
input/code.cpp:39:19: warning: array subscript has type 'char' [-Wchar-subscripts]
   39 |         cout << v[c] << " ";
      |                   ^
input/code.cpp:44:11: warning: array subscript has type 'char' [-Wchar-subscripts]
   44 |         v[c]++;
      |           ^
input/code.cpp:47:11: warning: array subscript has type 'char' [-Wchar-subscripts]
   47 |         v[c] = 0;
      |           ^
input/code.cpp:50:18: warning: array subscript has type 'char' [-Wchar-subscripts]
   50 |         ll u = v[c];
      |                  ^
input/code.cpp: In function 'int main()':
input/code.cpp:95:14: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |     while (p < keywords.size()) {
      |            ~~^~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

ll v[101010];
vector<string> keywords;
ll p = 0;

void find_keywords(const string& s) {
    string keyword;
    for (const char c : s) {
        if (c == '#') break;
        if (c != ' ') {
            keyword += c;
        } else if (!keyword.empty()){
            keywords.push_back(keyword);
            keyword = "";
        }
    }
    if (!keyword.empty()) keywords.push_back(keyword);
}

void print_near_keywords(int pointer) {
    cout << "keywords near pointer: " << pointer << endl;
    for (int i = pointer-3; i <= pointer+3; i++) {
        cout << keywords[i] << " ";
    }
    cout << endl;
}

void handle_command() {
    //cout << "pointer at: " << p << endl;
    const string& command = keywords[p];
    //cout << "command: " << command << endl;
    const string& arg = keywords[++p];
    //cout << "arg: " << arg << endl;
    if (command == "PRINT") {
        char c = arg.front();
        cout << v[c] << " ";
        /*cout << " <- from pointer " << p << "\n";
        print_near_keywords(p);*/
    } else if (command == "INCREASE") {
        char c = arg.front();
        v[c]++;
    } else if (command == "CLEAR") {
        char c = arg.front();
        v[c] = 0;
    } else if (command == "REPEAT") {
        char c = arg.front();
        ll u = v[c];
        p+=3; // skip TIMES ( important to do before checking u == 0
        if (u == 0) {
            //cout << "NOT REPATING AT ALL!! at pointer " << p << " which is keywords " << keywords[p] << "\n";
            ll sum = 1;
            while (sum > 0) {
                if (keywords[p] == ")") --sum;
                else if (keywords[p] == "(") ++sum;
                ++p;
            }
            --p; // Decrease pointer to go back to ) at end of repeat
            //cout << "not repeating ended at pointer " << p << " which is keyword " << keywords[p] << endl;
        }
        //if (c == 'A') cout << "repeating A times " << u << "\n";
        //cout << "repeating times: " << u << endl;
        //cout << "pointer at before starting loop: " << p << " which is keyword " << keywords[p] << endl;
        ll start = p;
        for (int i = 1; i<=u;i++) {
            p = start;
            //cout << "starting loop i: " << i << endl;
            while (keywords[p] != ")") {
                handle_command();
                p++;
            }
            //cout << "loop finished i: " << i << endl;
        }
        //cout << "complete loop finish, at pointer " << p << " which is keyword " << keywords[p] << endl;
    } else if (command == ")") {
        //nothing...
    }
}

int main() {
    //ios_base::sync_with_stdio(false);
    //cin.tie(nullptr);
    //freopen(R"(C:\Users\Kymppi\Downloads\test_input.txt)", "r", stdin);

    string l;
    vector<string> lines;
    while (getline(cin, l)) {
        if (!l.empty()) lines.push_back(l);
    }
    for (const string& line : lines) {
        find_keywords(line);
    }
    while (p < keywords.size()) {
        handle_command();
        p++;
    }

}

Test 1 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7 (public)

Group: 2, 3

Verdict: ACCEPTED

Test 8 (public)

Group: 2, 3

Verdict: ACCEPTED

Test 9 (public)

Group: 2, 3

Verdict: ACCEPTED

Test 10 (public)

Group: 2, 3

Verdict: ACCEPTED

Test 11 (public)

Group: 2, 3

Verdict: ACCEPTED

Test 12 (public)

Group: 2, 3

Verdict: ACCEPTED

Test 13 (public)

Group: 3

Verdict: ACCEPTED

Test 14 (public)

Group: 3

Verdict: ACCEPTED

Test 15 (public)

Group: 3

Verdict: ACCEPTED

Test 16 (public)

Group: 3

Verdict: ACCEPTED

Test 17 (public)

Group: 3

Verdict: ACCEPTED

Test 18 (public)

Group: 3

Verdict: ACCEPTED