CSES - Datatähti 2026 alku

Submission details
Task:	Tulkki
Sender:	Lytsky
Submission time:	2025-10-29 10:23:07 +0200
Language:	C++ (C++11)
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	ACCEPTED	0.00 s	1, 2, 3	details
#3	ACCEPTED	0.00 s	1, 2, 3	details
#4	WRONG ANSWER	0.00 s	1, 2, 3	details
#5	WRONG ANSWER	0.00 s	1, 2, 3	details
#6	WRONG ANSWER	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	TIME LIMIT EXCEEDED	--	3	details
#16	ACCEPTED	0.01 s	3	details
#17	TIME LIMIT EXCEEDED	--	3	details
#18	RUNTIME ERROR	0.00 s	3	details

Code

#include <bits/stdc++.h>

using namespace std;

string line, word;
string times;
vector<int> print;
vector<string> input;
map<char, int> vars;

int main() {
    for (int c = 65; c <= 90; ++c) {
        char var = char(c);
        vars[var] = 0;
    }
    string lastword = "";
    for (int index = 0; index < 31; index++) {
        getline(cin, line);
        for (auto x : line) {
            if (x == '#') {
                int i = line.find('#');
                line.erase(line.begin() + i, line.end());
            }
        }
        if (line[0] == '#') continue;
        istringstream iss(line);
        while (iss >> word) {
            //tarviiko? vvv
            /*for (auto x : word) {
                if (x == '#') {
                    cout << "Mui" << endl; 
                    int i = word.find('#');
                    word.erase(word.begin() + i, word.end());
                    if (lastword == "") lastword = word;
                    cout << "mui" << lastword[0] << word[0] << endl; 
                    break;
                }
            }*/
            //
            if (word == ")") {
                input.push_back(word);
            }
            else if (word == "(") {
                lastword = "";
            }
            else if (lastword == "") {
                lastword = word;
            }
            else { 
                char var = lastword[0];
                char var2 = word[0];
                string str;
                str = var;
                str += var2;
                input.push_back(str);
                lastword = "";
            }
        }
    }
    while((int) input.size() > 0) {
        if (input[0][0] == 'P') print.push_back(vars[input[0][1]]); 
        else if (input[0][0] == 'I') vars[input[0][1]]++;
        else if (input[0][0] == 'C') vars[input[0][1]] = 0;
        else if (input[0][0] == 'R') {
            int times = vars[input[0][1]];
            input.erase(input.begin());
            int pars = 0;
            vector<string> newinput = {};
            for (int index = 0; index < 1000; index++) {
                if (input[0][0] == 'R') pars++;
                else if (input[0] == ")") {
                    if (pars == 0) {
                        input.erase(input.begin());
                        break;
                    }
                    pars--;
                }
                newinput.insert(newinput.end(), input[0]);
                input.erase(input.begin());
                if (input[0][0] != 'R' && input[0] != ")") {
                    newinput.insert(newinput.end(), input[0]);
                    input.erase(input.begin());
                }
            }
            for (int index = 0; index < times; index++) {
                input.insert(input.begin(), newinput.begin(), newinput.end());
            }
            input.insert(input.begin(), "a");
        }
        else if (input[0][0] == ')') ;
        else cout << "error: " << input[0] << endl; 
        input.erase(input.begin());
    }
    for (int index = 0; index < (int) print.size(); index++) {
        cout << print[index] << " ";
    }
    cout << endl; 
}

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

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

Feedback: Output is shorter than expected

Test 5 (public)

Group: 1, 2, 3

Verdict: WRONG ANSWER

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

correct output
`999` view save

user output
(empty)

Feedback: Output is shorter than expected

Test 6 (public)

Group: 1, 2, 3

Verdict: WRONG ANSWER

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

Feedback: Output is shorter than expected

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: TIME LIMIT EXCEEDED

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

correct output
`531441` view save

user output
(empty)

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: TIME LIMIT EXCEEDED

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

Test 18 (public)

Group: 3

Verdict: RUNTIME ERROR

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

Datatähti 2026 alku

Tulkki

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