Submission details
Task:Tulkki
Sender:viiviP
Submission time:2025-10-31 07:48:44 +0200
Language:C++ (C++17)
Status:READY
Result:44
Feedback
groupverdictscore
#1ACCEPTED12
#2ACCEPTED32
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2ACCEPTED0.00 s1, 2, 3details
#3ACCEPTED0.00 s1, 2, 3details
#4ACCEPTED0.00 s1, 2, 3details
#5ACCEPTED0.00 s1, 2, 3details
#6ACCEPTED0.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.07 s3details
#16ACCEPTED0.00 s3details
#17ACCEPTED0.07 s3details
#18--3details

Compiler report

input/code.cpp: In function 'int loop(int)':
input/code.cpp:27:9: warning: unused variable 'l' [-Wunused-variable]
   27 |     int l = 0;
      |         ^
input/code.cpp:30:9: warning: unused variable 'id' [-Wunused-variable]
   30 |     int id = a+4;
      |         ^~
input/code.cpp: In function 'int main()':
input/code.cpp:95:14: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |     while (c < k.size()) {
      |            ~~^~~~~~~~~~

Code

#include <iostream>
#include <sstream>
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;


//map<char, ll> var = {'A': 0, 'B': 0, 'C': 0, 'D': 0, 'E': 0, 'F': 0, 'G': 0, 'H': 0, 'I': 0, 'J': 0,'K': 0, 'L': 0, 'M': 0, 'N': 0, 'O': 0, 'P': 0, 'Q': 0, 'R': 0, 'S': 0, 'T': 0, 'U': 0, 'V': 0, 'W': 0, 'X': 0, 'Z': 0, 'Y':0};
//map<char, ll> var = {'A': 0, 'B': 0, 'C': 0, 'D': 0, 'E': 0, 'F': 0, 'G': 0, 'H': 0, 'I': 0, 'J': 0,'K': 0, 'L': 0, 'M': 0, 'N': 0, 'O': 0, 'P': 0, 'Q': 0, 'R': 0, 'S': 0, 'T': 0, 'U': 0, 'V': 0, 'W': 0, 'X': 0, 'Z': 0, 'Y':0};
ll c = 0;
vector<string> k;
map<string, ll> var = {{"A", 0}, {"B", 0}, {"C", 0}, {"D", 0}, {"E", 0}, {"F", 0}, {"G", 0}, {"H", 0}, {"I", 0}, {"J", 0},{"K", 0} , {"L", 0} ,{"M", 0}, {"N", 0}, {"O", 0}, {"P", 0}, {"Q", 0} , {"R", 0}, {"S", 0} , {"T", 0}, {"U", 0}, {"V", 0}, {"W", 0}, {"X", 0}, {"Z", 0}, {"Y",0}};

int tulosta(int a) {
    cout << var[k[a+1]]<<" ";
    return 2;
}
int tyhjenna(int a) {
    var[k[a+1]] = 0;
    return 2;
}
int lisaa(int a) {
    var[k[a+1]] += 1;
    return 2;
}
int loop (int a) {
    int l = 0;
    int range = var[k[a+1]];

    int id = a+4;
    int count = 0;
    for (int i = 0; i<range;i++) {
        int id = a+4;
        count = 0;
        while (k[id] != ")") {
            if (k[id] == "PRINT") {
                id += tulosta(id);
                count += 2;
            } else if (k[id] == "CLEAR") {
                id += tyhjenna(id);
                count += 2;
            } else if (k[id] == "INCREASE") {
                id += lisaa(id);
                count += 2;
            } else if (k[id] == "REPEAT") {
                int ans = loop(id);
                id += ans;
                count += ans;
            }
        }
    }
    return 5 + count;
}

int command(int a) {
    int l = 0;
    if (k[a] == "PRINT") {
        l += tulosta(a);
    } else if (k[a] == "CLEAR") {
        l += tyhjenna(a);
    } else if (k[a] == "INCREASE") {
        l += lisaa(a);
    } else if (k[a] == "REPEAT") {
        int ans = loop(a);
        l += ans;
    }
    
    return l;
}

int main() {
    string line;
    while (getline(cin, line)) {
        stringstream ss(line);
        string osa;
        bool f = false;
        while (ss >> osa) {
            string r = "";
            for (auto m : osa) {
                if (m != '#') { r += m;}
                 else {
                    f = true;
                    break;
                }
            }
            if (r.size() > 0) {
                k.push_back(r);
            }
            if (f) {break;}
        }
    }
    //for (auto a : k) {
    //    cout << a<<"\n";
    //}
    while (c < k.size()) {
        int ans = command(c); //lisaa muualle suoritetut rivit;
        c += ans;
        //cout << "sarja tuotti: "<< ans<< " seuraava komento: "<< c<<"\n";
        
        //c++; //seuraava uusi
    }
}

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: ACCEPTED

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

Test 5 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
999 

user output
999 

Test 6 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

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

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: ACCEPTED

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

correct output
1337 

user output
1337 

Test 17 (public)

Group: 3

Verdict: ACCEPTED

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
1 2 1 2 1 1 3 4 3 4 3 4 3 4 3 ...

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)