CSES - Datatähti 2026 alku

Submission details
Task:	Tulkki
Sender:	drvilepis
Submission time:	2025-10-31 08:39:09 +0200
Language:	C++ (C++20)
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.00 s	1, 2, 3	details
#6	ACCEPTED	0.00 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.04 s	3	details
#16	ACCEPTED	0.00 s	3	details
#17	ACCEPTED	0.06 s	3	details
#18	ACCEPTED	0.02 s	3	details

Compiler report

input/code.cpp: In function 'int find_end(std::vector<std::__cxx11::basic_string<char> >&, int)':
input/code.cpp:8:16: 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]
    8 |     while (rip < program.size()) {
      |            ~~~~^~~~~~~~~~~~~~~~
input/code.cpp: In function 'int parse(std::vector<std::__cxx11::basic_string<char> >&, int, std::vector<int>&)':
input/code.cpp:25:16: 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]
   25 |     while (rip < program.size()) {
      |            ~~~~^~~~~~~~~~~~~~~~

Code

#include <cctype>
#include <iostream>
#include <string>
#include <vector>

int find_end(std::vector<std::string>& program, int rip) {
    int nest = 0;
    while (rip < program.size()) {
        if (program[rip] == "(") {
            nest++;
        } else if (program[rip] == ")") {
            if (nest == 0) {
                rip++;
                return rip;
            } else {
                nest--;
            }
        }
        rip++;
    }
    return rip;
}

int parse(std::vector<std::string>& program, int rip, std::vector<int> &mem) {
    while (rip < program.size()) {
        if (program[rip] == ")") {
            rip++;
            return rip;
        } else if (program[rip] == "CLEAR") {
            rip++;
            mem[program[rip][0] - 'A']=0;
            rip++;
        } else if (program[rip] == "INCREASE") {
            rip++;
            mem[program[rip][0] - 'A']+=1;
            rip++;
        } else if (program[rip] == "PRINT") {
            rip++;
            std::cout << mem[program[rip][0] - 'A'] << " ";
            rip++;
        } else if (program[rip] == "REPEAT") {
            rip++;
            int repeats = mem[program[rip][0] - 'A'];
            rip++;
            rip++;
            rip++;
            int end = find_end(program, rip);
            for (int i = 0; i < repeats; ++i) {
                end = parse(program, rip, mem);
            }
            rip = end;
        }
    }
    return rip;
}

int main() {
    std::vector<std::string> input;
    bool comment = false;
    std::vector<int> mem(30, 0);

    char c;

    std::string word = "";
    while (!std::cin.eof()) {
        std::cin.get(c);
        if (!comment) {
        if (std::isalpha(c)) {
                word.push_back(c);
            } else if (c == '#') {
                comment = true;
                if (word != "") {
                    input.push_back(word);
                    word.clear();
                }
            } else if (c == '(' || c == ')') {
                if (word != "") {
                    input.push_back(word);
                    word.clear();
                }
                word.push_back(c);
                input.push_back(word);
                word.clear();
            } else {
                if (word != "") {
                    input.push_back(word);
                    word.clear();
                }
            }
        } else {
            if (c == '\n') {
                comment = false;
            }
        }
    }

    if (word != "") {
        input.push_back(word);
        word.clear();
    }

    parse(input, 0, mem);
}

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