Submission details
Task:Tulkki
Sender:mestari037
Submission time:2025-11-09 22:47:14 +0200
Language:C++ (C++17)
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.04 s3details
#16ACCEPTED0.00 s3details
#17ACCEPTED0.07 s3details
#18ACCEPTED0.02 s3details

Code

#include <iostream>
#include <vector>
#include <string>
#include <map>

void a(const std::vector<std::string>& komennot, size_t alku, size_t loppu, std::map<char, int>& m, std::vector<int>& T){
    for (size_t i = alku; i < loppu; i++){
        std::string komento = komennot[i];

        if (komento == "CLEAR"){
            char mm = komennot[i + 1][0];
            m[mm] = 0;
            i++;
        } else if (komento == "INCREASE"){
            char mm = komennot[i + 1][0];
            m[mm]++;
            i++;
        } else if (komento == "PRINT"){
            char mm = komennot[i + 1][0];
            T.push_back(m[mm]);
            i++;
        } else if (komento == "REPEAT"){
            char mm = komennot[i + 1][0];
            int toistot = m[mm];

            i += 3;

            size_t s = 1;
            size_t Alku = i + 1;
            size_t Loppu = Alku;

            while (s > 0){
                if (komennot[Loppu] == "("){
                    s++;
                } else if (komennot[Loppu] == ")"){
                    s--;
                }
                if (s > 0){
                    Loppu++;
                }
            }

            for (int t = 0; t < toistot; t++){
                a(komennot, Alku, Loppu, m, T);
            }

            i = Loppu;
        }
    }
}

int main(){
    std::map<char, int> m;
    for (char c = 'A'; c <= 'Z'; c++){
        m[c] = 0;
    }

    std::string koodi = "";
    std::string rivi;
    while (std::getline(std::cin, rivi)){
        size_t kommentti = rivi.find('#');
        if (kommentti != std::string::npos){
            rivi = rivi.substr(0, kommentti);
        }
        koodi += rivi + "\n";
    }

    std::vector<std::string> komennot;
    std::string nK = "";

    for (size_t i = 0; i < koodi.length(); i++){
        char c = koodi[i];

        if (std::isspace(c)){
            if (!nK.empty()){
                komennot.push_back(nK);
                nK = "";
            }
        } else if (c == '(' || c == ')'){
            if (!nK.empty()){
                komennot.push_back(nK);
                nK = "";
            }
            komennot.push_back(std::string(1, c));
        }
        else {
            nK += c;
        }
    }

    if (!nK.empty()){
        komennot.push_back(nK);
    }

    std::vector<int> T;
    a(komennot, 0, komennot.size(), m, T);

    for (int arvo : T){
        std::cout << arvo << " ";
    }
}

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