new-year-chaos.cpp

/**
 * @file new-year-chaos.cpp
 * @author Alexander Khvolis(ExpliuM)
 * @link https://www.hackerrank.com/challenges/new-year-chaos/problem?isFullScreen=true
 * @version 0.1
 * @date 2023-02-19
 * 
 * @copyright Copyright (c) 2023
 * 
 */

#include <functional>
#include <iostream>
#include <istream>
#include <string>
#include <vector>

using namespace std;

string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);

/*
 * Complete the 'minimumBribes' function below.
 *
 * The function accepts INTEGER_ARRAY q as parameter.
 */

void minimumBribes(vector<int> q)
{
    int qSize = q.size();
    int beribesCount = 0;
    for (int i = 0; i < qSize; ++i)
    {
        int currentBribesCount = q[i] - (i + 1);
        if (currentBribesCount > 0)
        {
            if (currentBribesCount > 2)
            {
                cout << "Too chaotic" << endl;
                return;
            }
            beribesCount += currentBribesCount;
        }
    }
    cout << beribesCount << endl;
    // int *minimalFromBehindArr = new int[qSize];

    // std::fill_n(minimalFromBehindArr, qSize, 0);

    // minimalFromBehindArr[qSize - 1] = q[qSize - 1];
    // for (int i = qSize - 2; i >= 0; --i)
    // {
    //     minimalFromBehindArr[i] = min(minimalFromBehindArr[i + 1], q[i]);
    // }

    // int beribesCount = 0;
    // for (int i = 0; i < qSize - 1; ++i)
    // {
    //     int currentBribesCount = q[i] - minimalFromBehindArr[i];
    //     if (currentBribesCount > 2)
    //     {
    //         cout << "Too chaotic" << endl;
    //         delete[] minimalFromBehindArr;
    //         return;
    //     }
    //     beribesCount += currentBribesCount;
    // }

    // cout << beribesCount << endl;
    // delete[] minimalFromBehindArr;
    return;
}

int main()
{
    string t_temp;
    getline(cin, t_temp);

    int t = stoi(ltrim(rtrim(t_temp)));

    for (int t_itr = 0; t_itr < t; t_itr++)
    {
        string n_temp;
        getline(cin, n_temp);

        int n = stoi(ltrim(rtrim(n_temp)));

        string q_temp_temp;
        getline(cin, q_temp_temp);

        vector<string> q_temp = split(rtrim(q_temp_temp));

        vector<int> q(n);

        for (int i = 0; i < n; i++)
        {
            int q_item = stoi(q_temp[i]);

            q[i] = q_item;
        }

        minimumBribes(q);
    }

    return 0;
}

string ltrim(const string &str)
{
    string s(str);

    s.erase(
        s.begin(),
        find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace))));

    return s;
}

string rtrim(const string &str)
{
    string s(str);

    s.erase(
        find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
        s.end());

    return s;
}

vector<string> split(const string &str)
{
    vector<string> tokens;

    string::size_type start = 0;
    string::size_type end = 0;

    while ((end = str.find(" ", start)) != string::npos)
    {
        tokens.push_back(str.substr(start, end - start));

        start = end + 1;
    }

    tokens.push_back(str.substr(start));

    return tokens;
}