Submission details
Task:Tulkki
Sender:Lytsky
Submission time:2025-10-29 14:22:03 +0200
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2ACCEPTED0.00 s1, 2, 3details
#3ACCEPTED0.00 s1, 2, 3details
#40.00 s1, 2, 3details
#50.00 s1, 2, 3details
#60.00 s1, 2, 3details
#7ACCEPTED0.00 s2, 3details
#8ACCEPTED0.00 s2, 3details
#9ACCEPTED0.00 s2, 3details
#10ACCEPTED0.00 s2, 3details
#11ACCEPTED0.00 s2, 3details
#12ACCEPTED0.00 s2, 3details
#13ACCEPTED0.00 s3details
#14ACCEPTED0.00 s3details
#15ACCEPTED0.03 s3details
#160.00 s3details
#170.00 s3details
#180.00 s3details

Code

#include <bits/stdc++.h>

using namespace std;

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

void repeat() {
    if (input[mones][0] == 'R') {
        int times = vars[input[mones][1]];
        mones++;
        int apu = mones;
        for (int index = 0; index < times; index++) { 
            mones = apu;
            for (int i = 0; i < 1000; i++) { 
                if (input[mones] == ")") {
                    break;
                }
                repeat();
            }
        }
    } else if (input[mones][0] == 'P') print.push_back(vars[input[mones][1]]);
    else if (input[mones][0] == 'I') vars[input[mones][1]]++;
    else if (input[mones][0] == 'C') vars[input[mones][1]] = 0;
    else if (input[mones] == ")") {
        return;
    }
    mones++;
}
/*
   int times = vars[input[mones][1]];
   mones++;
   for (int i = 0; i < times; i++) {
   for (apu = 0; apu < 1000; apu++) {
   if (input[mones+apu][0] == 'R') {
   repeat();
   } else if (input[mones+apu][0] == 'P') print.push_back(vars[input[mones+apu][1]]);
   else if (input[mones+apu][0] == 'I') vars[input[mones+apu][1]]++;
   else if (input[mones+apu][0] == 'C') vars[input[mones+apu][1]] = 0;
   else if (input[mones+apu] == ")") {
   break;
   }
   }
   }
   mones--;
   }*/

int main() {
    for (int c = 65; c <= 90; ++c) {
        char var = char(c);
        vars[var] = 0;
    }
    string lastword = "";
    for (int index = 0; index < 25; 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) {
            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 = "";
            }
        }
    }
    mones = 0;
    while((int) input.size() != mones) {
        repeat();
    }
    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
...

correct output
0 1 2 0 

user output
0 1 2 0 

Test 2 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
INCREASE
X
# aybabtu
   PRINT    X
INCREASE # test
...

correct output
1 3 

user output
1 3 

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:

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 

Feedback: Output is shorter than expected

Test 5 (public)

Group: 1, 2, 3

Verdict:

input
INCREASE X
INCREASE X
INCREASE X
INCREASE X
INCREASE X
...

correct output
999 

user output
(empty)

Feedback: Output is shorter than expected

Test 6 (public)

Group: 1, 2, 3

Verdict:

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

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

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:

input
INCREASE A
INCREASE A
INCREASE A
INCREASE A
INCREASE A
...

correct output
1337 

user output
(empty)

Test 17 (public)

Group: 3

Verdict:

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

Test 18 (public)

Group: 3

Verdict:

input
# Efficient algorithm for find...

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

user output
(empty)