CSES - Datatähti 2026 alku

Submission details
Task:	Tulkki
Sender:	worst
Submission time:	2025-10-27 18:15:18 +0200
Language:	C++ (C++20)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2, 3	details
#2	WRONG ANSWER	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.05 s	3	details
#18	ACCEPTED	0.01 s	3	details

Compiler report

input/code.cpp: In function 'void solve_operations(std::vector<std::pair<std::__cxx11::basic_string<char>, char> >&)':
input/code.cpp:8:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::__cxx11::basic_string<char>, char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for (int j = 0; j < operations.size(); j++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~
input/code.cpp:20:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::__cxx11::basic_string<char>, char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |             for (int jj = j + 2; jj < operations.size(); jj++) {
      |                                  ~~~^~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'void solve()':
input/code.cpp:55:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size...

Code

#include <bits/stdc++.h>

using namespace std;

map<char, int> mp;

void solve_operations(vector<pair<string, char>> &operations) {
    for (int j = 0; j < operations.size(); j++) {
        string op = operations[j].first;
        char l = operations[j].second;
        if (op == "INCREASE") {
            mp[l]++;
        } else if (op == "CLEAR") {
            mp[l] = 0;
        } else if (op == "PRINT") {
            cout << mp[l] << " ";
        } else if (op == "REPEAT") {
            vector<pair<string, char>> operationsNew;
            int c = 0;
            for (int jj = j + 2; jj < operations.size(); jj++) {
                if (operations[jj].first == "end" && c == 0) {
                    j = jj;
                    break;
                }
                operationsNew.push_back(operations[jj]);

                if (operations[jj].first == "REPEAT") {
                    c++;
                }
                if (operations[jj].first == "end") {
                    c--;
                }
            }

            int times = mp[l];
            for (int i = 0; i < times; i++) {
                solve_operations(operationsNew);
            }
        }
    }
}

void solve() {
    string s;
    vector<string> v;
    while (getline(cin, s)) {
        v.push_back(s);
    }

    for (int i = 65; i <= 90; i++) {
        mp[char(i)] = 0;
    }

    vector<pair<string, char>> operations;
    for (int i = 0; i < v.size(); i++) {
        string word;
        for (int j = 0; j < v[i].size(); j++) {
            if (v[i][j] == '#') {
                continue;
            }
            if (v[i][j] != ' ') {
                word += v[i][j];
            }
            if (word == "INCREASE" || word == "CLEAR" || word == "PRINT") {
                operations.push_back({word, v[i][j + 2]});
                j += 2;
                word = "";
            } else if (word == "REPEAT") {
                operations.push_back({word, v[i][j + 2]});
                operations.push_back({"start", '+'});
                j += 2 + 8;
                word = "";
            } else if (word == ")") {
                operations.push_back({"end", '-'});
                word = "";
            }
        }
    }

    solve_operations(operations);
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    // cout << fixed << setprecision(6) << endl;

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    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: WRONG ANSWER

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

correct output
`1 3` view save

user output
`0` view save

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 ...` 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 (worst)