Monistus

input/code.cpp: In function 'int main()':
input/code.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for (int i = 0; i < original_string.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:72:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |             for (int i=0; i<currect_node->text.size(); i++) {
      |                           ~^~~~~~~~~~~~~~~~~~~~~~~~~~

#include <iostream>
#include <string>
#include <vector>
#include <stack>


struct Node {
    int num;
    std::string text;
    Node* next;
};


Node* add_node(Node* prev, int num, const std::string& text) {
    Node* node = new Node{num, text, nullptr};
    prev->next = node;
    return node;
}


int main()
{
    std::string original_string;
    std::cin >> original_string;

    Node* currect_node = new Node{-1, "", nullptr};
    Node* HEAD = currect_node;

    char c;
    int  v;
    for (int i = 0; i < original_string.size(); i++) {
        c = original_string[i];
        v = c - '0';
        if (0 < v && v < 10) {
            currect_node = add_node(currect_node, v, "");
            currect_node = add_node(currect_node, -1, "");
            continue;
        }
        currect_node->text += c;
    }

    currect_node = HEAD;
    Node* sub_head  = nullptr;
    Node* sub_tail  = nullptr;
    int A = 0;
    std::string solved_string = "";

    while (HEAD)
    {
        if (HEAD->num == -1) { 
            solved_string += HEAD->text;
            HEAD = HEAD->next;
            continue; 
        }

        // When we hit a number
        sub_head = new Node{-1, "", nullptr};
        sub_tail = sub_head;
        A = HEAD->num;
        currect_node = HEAD;        // HEAD -> number

        while (A > 0)
        {
            currect_node = currect_node->next;
            if (!currect_node) break;
            if (currect_node->num != -1) {
                sub_tail = add_node(sub_tail, currect_node->num, "");
                A--;
                continue;
            }
            sub_tail = add_node(sub_tail, -1, "");
            for (int i=0; i<currect_node->text.size(); i++) {
                sub_tail->text += currect_node->text[i];
                A--;
                if (A <= 0) break;
            }
        }
        sub_tail->next = HEAD->next;
        if (sub_head->next) *HEAD = *(sub_head->next);
    }
    
    std::cout << solved_string;

    return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 1, 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED

Test 14

Group: 2

Verdict: ACCEPTED