Tulkki

input/code.cpp: In function 'int KayKomentojaLapi(int, int)':
input/code.cpp:43:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for (int i = aloituskohta; i < komentolista.size(); i++)
      |                                ~~^~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:142:13: warning: unused variable 'variable' [-Wunused-variable]
  142 |         int variable = 0;
      |             ^~~~~~~~

#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <unordered_map>
#include <cmath>
#include <algorithm>
#include <optional>
#include <string>


typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned int uint;

using namespace std;

//2
void Print(int x){
    cout << x << "\n";
}
//1
int Increase(int x){
    return x += 1;
}
//0
int Clear(){
    return 0;
}

//Teorias opcode ja sit arvo
// 0 Clear, 1 INC, 2 PRNT, 3 ?, 4+syvyys LOOP ALKU, 5+syvyys LOOP LOPPU (ja tän arvo on sit turha)
vector<pair<int,int>> komentolista;
//Muistiosote ja sen arvo
map<char,int> muisti;


void LisaaKomentoListaan(pair<int,int> komento){
    komentolista.push_back(komento);
}

int KayKomentojaLapi(int aloituskohta, int syvyys){
    for (int i = aloituskohta; i < komentolista.size(); i++)
    {
       // cout << komentolista[i].first << " ";
        switch (komentolista[i].first)
            {
            case 0:
                muisti[komentolista[i].second] = Clear();
                break;
            case 1:
                muisti[komentolista[i].second] = Increase(muisti[komentolista[i].second]);
                break;
            case 2:
                Print(muisti[komentolista[i].second]);
                break;
            case 4:
            {
                //int max = komentolista.size() - i;
                int spotti = i;
                int paljoTuleeSkippaa = 0;
                int montakoKierrosta = muisti[komentolista[i].second];  //Tämä, jotta ei voisi lisätä kierroksia sisältä
                for (int j = 0; j < montakoKierrosta; j++)
                {
                    paljoTuleeSkippaa = KayKomentojaLapi(spotti+1,syvyys+1);
                }
                i = paljoTuleeSkippaa;
                break;
            }
            case 5:
            if(komentolista[i].second == syvyys){
                return i;
            }
            break;

            default:
                cout << "VIRHE!!";
                break;
        }
    }

    return 0;
}

int main(){

    string line = "";
    int syvyys = 0;

    while ( getline(cin, line))
    {
        if(line == "ä") {break;}


        string komento = "";
        char arvo = 0;

        bool luetteleeKomentoja = true;


        for (auto &&c : line)
        {
            if(c == 35) {break;}
            if(c == 32){
                if(luetteleeKomentoja == false){
                    if(komento == "PRINT") {LisaaKomentoListaan(make_pair(2,arvo)); komento = "";}
                    if(komento == "INCREASE") {LisaaKomentoListaan(make_pair(1,arvo)); komento = "";}
                    if(komento == "CLEAR") {LisaaKomentoListaan(make_pair(0,arvo)); komento = "";}
                }

                luetteleeKomentoja = !luetteleeKomentoja;

            }
            else if(c == 40){
                LisaaKomentoListaan(make_pair(4,arvo));
                syvyys += 1;
                komento = "";
            }
            else if(c == 41){
                LisaaKomentoListaan(make_pair(5,syvyys));
                syvyys -= 1;
            }

            else if(luetteleeKomentoja)
                komento += c;
            
            else{
                arvo = c - 65;
                
            }

        }
        
        if(luetteleeKomentoja == false){
            if(komento == "PRINT") {LisaaKomentoListaan(make_pair(2,arvo));}
            if(komento == "INCREASE") {LisaaKomentoListaan(make_pair(1,arvo));}
            if(komento == "CLEAR") {LisaaKomentoListaan(make_pair(0,arvo));}
        }        
        
       
        string command = "";
        int variable = 0;
    }

   
    KayKomentojaLapi(0,0);


    return 0;
}

Test 1 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2 (public)

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 3 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7 (public)

Group: 2, 3

Verdict: ACCEPTED

Test 8 (public)

Group: 2, 3

Verdict: ACCEPTED

Test 9 (public)

Group: 2, 3

Verdict: ACCEPTED

Test 10 (public)

Group: 2, 3

Verdict: ACCEPTED

Test 11 (public)

Group: 2, 3

Verdict: ACCEPTED

Test 12 (public)

Group: 2, 3

Verdict: ACCEPTED

Test 13 (public)

Group: 3

Verdict: ACCEPTED

Test 14 (public)

Group: 3

Verdict: ACCEPTED

Test 15 (public)

Group: 3

Verdict: ACCEPTED

Test 16 (public)

Group: 3

Verdict: ACCEPTED

Test 17 (public)

Group: 3

Verdict: ACCEPTED

Test 18 (public)

Group: 3

Verdict: RUNTIME ERROR