CSES - Datatähti 2026 alku

Submission details
Task:	Tulkki
Sender:	xiaou0
Submission time:	2025-10-27 09:17:54 +0200
Language:	C++ (C++17)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	12
#2	ACCEPTED	32
#3	ACCEPTED	56

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2, 3	details
#2	ACCEPTED	0.00 s	1, 2, 3	details
#3	ACCEPTED	0.00 s	1, 2, 3	details
#4	ACCEPTED	0.00 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.01 s	1, 2, 3	details
#7	ACCEPTED	0.00 s	2, 3	details
#8	ACCEPTED	0.00 s	2, 3	details
#9	ACCEPTED	0.00 s	2, 3	details
#10	ACCEPTED	0.00 s	2, 3	details
#11	ACCEPTED	0.00 s	2, 3	details
#12	ACCEPTED	0.00 s	2, 3	details
#13	ACCEPTED	0.00 s	3	details
#14	ACCEPTED	0.00 s	3	details
#15	ACCEPTED	0.22 s	3	details
#16	ACCEPTED	0.00 s	3	details
#17	ACCEPTED	0.17 s	3	details
#18	ACCEPTED	0.10 s	3	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:68:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |     for(int i=0;i<s.size();++i){
      |                 ~^~~~~~~~~
input/code.cpp:79:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |     for(int i=0;i<lst.size();++i){
      |                 ~^~~~~~~~~~~

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);
            }
        }
    }
}
string s;
vector<string>lst;

int main(){
    var[26]=1;
    Command root=Command("ROOT",26,NULL);
    Command*fa=&root;
    char c;
    bool iscomment=false;
    while(cin.get(c)){
        if(!iscomment){
            if(c=='#'){iscomment=true;continue;}
            s.push_back(c);
        }
        else if(c=='\n'){
            iscomment=false;
            s.push_back('\n');
        }
    }
    string tmp;
    for(int i=0;i<s.size();++i){
        if(s[i]==' '||s[i]=='\n'){
            if(!tmp.empty()){
                lst.push_back(tmp);
                tmp.clear();
            }
            continue;
        }
        else tmp.push_back(s[i]);
    }
    if(!tmp.empty())lst.push_back(tmp);
    for(int i=0;i<lst.size();++i){
        if(lst[i]=="PRINT"){
            fa->cmds.push(Command("PRINT",lst[i+1][0]-'A',fa));
            ++i;
        }
        if(lst[i]=="INCREASE"){
            fa->cmds.push(Command("INCREASE",lst[i+1][0]-'A',fa));
            ++i;
        }
        if(lst[i]=="CLEAR"){
            fa->cmds.push(Command("CLEAR",lst[i+1][0]-'A',fa));
            ++i;
        }
        if(lst[i]=="REPEAT"){
            fa->cmds.push(Command("ROOT",lst[i+1][0]-'A',fa));
            fa=&(fa->cmds.back());
            i+=3;
        }
        if(lst[i]==")"){
            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 ...` view save

correct output
`0 1 2 0` view save

user output
`0 1 2 0` view save

Test 2 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`INCREASE X # aybabtu PRINT X INCREASE # test ...` view save

correct output
`1 3` view save

user output
`1 3` view save

Test 3 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`# Create number 3 INCREASE X INCREASE X INCREASE X ...` view save

correct output
`3` view save

user output
`3` view save

Test 4 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`INCREASE A PRINT A INCREASE B PRINT B INCREASE C ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

Test 5 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`INCREASE X INCREASE X INCREASE X INCREASE X INCREASE X ...` view save

correct output
`999` view save

user output
`999` view save

Test 6 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`PRINT X PRINT X PRINT X PRINT X PRINT X ...` view save

correct output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Test 7 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`5 5 5 5 5` view save

user output
`5 5 5 5 5` view save

Test 8 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`0 0 0 0 0` view save

user output
`0 0 0 0 0` view save

Test 9 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`6 7 8 9 10` view save

user output
`6 7 8 9 10` view save

Test 10 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`5 5` view save

user output
`5 5` view save

Test 11 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`20` view save

user output
`20` view save

Test 12 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE B INCREASE B ...` view save

correct output
`42` view save

user output
`42` view save

Test 13 (public)

Group: 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`1 2 2 3 3 3 4 4 4 4 5 5 5 5 5` view save

user output
`1 2 2 3 3 3 4 4 4 4 5 5 5 5 5` view save

Test 14 (public)

Group: 3

Verdict: ACCEPTED

input
`# Create number 3 INCREASE A INCREASE A INCREASE...` view save

correct output
`12` view save

user output
`12` view save

Test 15 (public)

Group: 3

Verdict: ACCEPTED

input
`INCREASE X INCREASE X INCREASE X INCREASE X INCREASE X ...` view save

correct output
`531441` view save

user output
`531441` view save

Test 16 (public)

Group: 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`1337` view save

user output
`1337` view save

Test 17 (public)

Group: 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A REPEAT A TIMES ( REPEAT A TIMES ( ...` view save

correct output
`1 2 1 2 1 1 3 4 3 4 3 4 3 4 3 ...` view save

user output
`1 2 1 2 1 1 3 4 3 4 3 4 3 4 3 ...` view save

Test 18 (public)

Group: 3

Verdict: ACCEPTED

input
`# Efficient algorithm for find...` view save

correct output
`2 3 5 7 11 13 17 19 23 29 31 3...` view save

user output
`2 3 5 7 11 13 17 19 23 29 31 3...` view save

Datatähti 2026 alku

Tulkki

Compiler report

Code

Test details

Test 1 (public)

Test 2 (public)

Test 3 (public)

Test 4 (public)

Test 5 (public)

Test 6 (public)

Test 7 (public)

Test 8 (public)

Test 9 (public)

Test 10 (public)

Test 11 (public)

Test 12 (public)

Test 13 (public)

Test 14 (public)

Test 15 (public)

Test 16 (public)

Test 17 (public)

Test 18 (public)

Tasks

Submissions (xiaou0)