Monistus

input/code.cpp: In function 'int main()':
input/code.cpp:29:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for (int i = 0; i < word.length(); ++i) {
      |                     ~~^~~~~~~~~~~~~~~
input/code.cpp:44:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |                 for (int k = 0; k < independentWord.length(); ++k) {
      |                                 ~~^~~~~~~~~~~~~~~~~~~~~~~~~~

#include <iostream>
#include <string>
#include <string_view>
#include <algorithm>
#include <vector>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    string word;
    //word.reserve(500000);

    /*for (int i = 0; i < 430; ++i) {
        word.append("987654321i");
    }
    for (int i = 0; i < 25000; ++i) {
        word.append("qwertyuiop");
    }*/

    //clock_t tStart = clock();

    cin >> word;

    //word = "82silisko";

    for (int i = 0; i < word.length(); ++i) {
        if (word[i] <= '9') {
            int dulicateLenght = word[i] - 48;

            bool can = true;
            for (int k = 0; k < dulicateLenght; ++k) {
                if (!(word[i + k] <= '9' && (word[i + k] - 48) < dulicateLenght - k)) {
                    can = false;
                    break;
                }
            }
            // if we can solve the string independently
            if (can) {
                string independentWord = word.substr(i, dulicateLenght + 1);

                for (int k = 0; k < independentWord.length(); ++k) {
                    if (independentWord[k] <= '9') {
                        int dulicateLenght = independentWord[k] - 48;

                        independentWord.erase(k, 1);
                        independentWord.insert(k, string_view(independentWord.c_str() + k, dulicateLenght));
                        k -= 1;
                    }
                }

                word.erase(i, 1 + dulicateLenght);
                word.insert(i, independentWord);

                continue;
            }

            word.erase(i, 1);
            word.insert(i, string_view(word.c_str() + i, dulicateLenght));
            i -= 1;
        }
    }

    cout << word << endl;
    //printf("Time taken: %.2fs\n", (double)(clock() - tStart) / CLOCKS_PER_SEC);
}

/*int SeperationDistance(string& word, int place)
{
    int closestInt = 0;
    for (int i = 0; i < 10; ++i) {
        if (word[i] <= '9') {
            int number = word[place + i];
            closestInt = clamp(number - i, 0, 99);
        }
    }
}*/

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

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED