hackerrank order string by swaps

01. Arrays and strings/hackerrank/order_by_swaps_limited.cpp

@@ -0,0 +1,104 @@
+#include <bits/stdc++.h>
+#include <iostream> // std::cout
+#include <cmath>
+
+using namespace std;
+
+vector<string> split_string(string);
+
+// Complete the minimumBribes function below.
+void minimumBribes(vector<int> q)
+{
+
+    int swaps = -1;
+    vector<bool> vis(q.size(), false);
+    for (size_t i = 0; i < q.size(); i++)
+    {
+        if (vis[i] || q[i] == i + 1)
+        {
+            vis[i] = true;
+            continue;
+        }
+        int val = q[i];
+        int tmp_swaps = 0;
+        while (!vis[val - 1])
+        {
+            tmp_swaps = q[val-1] - val - 1;
+            if (tmp_swaps < 0){
+                tmp_swaps = val - q[val-1] - 1;
+            }
+            if (tmp_swaps > 2){
+                cout << "Too chaotic" << endl;
+                return;
+            }
+            vis[val - 1] = true;
+            val = q[val - 1];
+            swaps++;
+        }
+    }
+    cout << swaps << endl;
+}
+
+int main()
+{
+    int t;
+    cin >> t;
+    cin.ignore(numeric_limits<streamsize>::max(), '\n');
+
+    for (int t_itr = 0; t_itr < t; t_itr++)
+    {
+        int n;
+        cin >> n;
+        cin.ignore(numeric_limits<streamsize>::max(), '\n');
+
+        string q_temp_temp;
+        getline(cin, q_temp_temp);
+
+        vector<string> q_temp = split_string(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;
+}
+
+vector<string> split_string(string input_string)
+{
+    string::iterator new_end = unique(input_string.begin(), input_string.end(), [](const char &x, const char &y) {
+        return x == y and x == ' ';
+    });
+
+    input_string.erase(new_end, input_string.end());
+
+    while (input_string[input_string.length() - 1] == ' ')
+    {
+        input_string.pop_back();
+    }
+
+    vector<string> splits;
+    char delimiter = ' ';
+
+    size_t i = 0;
+    size_t pos = input_string.find(delimiter);
+
+    while (pos != string::npos)
+    {
+        splits.push_back(input_string.substr(i, pos - i));
+
+        i = pos + 1;
+        pos = input_string.find(delimiter, i);
+    }
+
+    splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));
+
+    return splits;
+}