Submission details
Task:Tulkki
Sender:xiaou0
Submission time:2025-10-27 01:53:15 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#20.00 s1, 2, 3details
#3ACCEPTED0.00 s1, 2, 3details
#4ACCEPTED0.00 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s1, 2, 3details
#7ACCEPTED0.00 s2, 3details
#8ACCEPTED0.00 s2, 3details
#9ACCEPTED0.00 s2, 3details
#10ACCEPTED0.00 s2, 3details
#11ACCEPTED0.01 s2, 3details
#12ACCEPTED0.00 s2, 3details
#13ACCEPTED0.00 s3details
#14ACCEPTED0.00 s3details
#15ACCEPTED0.21 s3details
#16ACCEPTED0.00 s3details
#17ACCEPTED0.17 s3details
#18ACCEPTED0.09 s3details

Code

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

int var[27];

/*
*PRINT X: output X
*INCREASE X: var[X]+=1
*CLEAR X: var[x]=0
*REPEAT A TIMES (...): repeat the commands inside A times
*#: comment
*/

struct Command{
    Command(string t,int v,Command*f){
        type=t;
        vl=v;
        fa=f;
    }
    string type;
    int vl;
    Command*fa;
    queue<Command>cmds;
};

void runcmd(Command cmd){
    if(cmd.type=="PRINT"){
        cout<<var[cmd.vl]<<" ";
    }
    if(cmd.type=="INCREASE"){
        var[cmd.vl]+=1;
    }
    if(cmd.type=="CLEAR"){
        var[cmd.vl]=0;
    }
    if(cmd.type=="ROOT"){
        int n=var[cmd.vl];
        for(int i=1;i<=n;++i){
            queue<Command>tmp=cmd.cmds;
            while(!tmp.empty()){
                Command c=tmp.front();
                tmp.pop();
                runcmd(c);
            }
        }
    }
}

int main(){
    string s;
    var[26]=1;
    Command root=Command("ROOT",26,NULL);
    Command*fa=&root;
    while(cin>>s){
        if(s=="END")break;
        if(s=="PRINT"){
            char c;
            cin>>c;
            fa->cmds.push(Command("PRINT",c-'A',fa));
        }
        if(s=="INCREASE"){
            char c;
            cin>>c;
            fa->cmds.push(Command("INCREASE",c-'A',fa));
        }
        if(s=="CLEAR"){
            char c;
            cin>>c;
            fa->cmds.push(Command("CLEAR",c-'A',fa));
        }
        if(s=="REPEAT"){
            char c;
            cin>>c;
            cin>>s;// TIMES
            fa->cmds.push(Command("ROOT",c-'A',fa));
            cin>>c;// (
            fa=&(fa->cmds.back());
        }
        if(s=="#"){
            getline(cin,s);
        }
        if(s==")"){
            fa=fa->fa;
        }
    }
    runcmd(root);
    return 0;
}

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

Feedback: Output is shorter than expected

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