New Year Chaos

Problem Statement :

It is New Year's Day and people are in line for the Wonderland rollercoaster ride. Each person wears a sticker indicating their initial position in the queue from 1 to n. Any person can bribe the person directly in front of them to swap positions, but they still wear their original sticker. One person can bribe at most two others.

Determine the minimum number of bribes that took place to get to a given queue order. Print the number of bribes, or, if anyone has bribed more than two people, print Too chaotic.


q = [1,2,3,5,4,6,7,8]
If person 5 bribes person 4, the queue will look like this: 1,2,3,5,4,6,7,8. Only 1 bribe is required. Print 1.
q = [4,1,2,3]

Person 4 had to bribe 3 people to get to the current position. Print Too chaotic.

Function Description

Complete the function minimumBribes in the editor below.

minimumBribes has the following parameter(s):

int q[n]: the positions of the people after all bribes

No value is returned. Print the minimum number of bribes necessary or Too chaotic if someone has bribed more than 2 people.
Input Format

The first line contains an integer t, the number of test cases.

Each of the next t pairs of lines are as follows:
- The first line contains an integer t, the number of people in the queue
- The second line has n space-separated integers describing the final state of the queue.


1 <= t <= 10
1 <= n <= 10^5

Solution :


                            Solution in C :

In C++ :

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

int main(){
    int T;
    cin >> T;
    for(int a0 = 0; a0 < T; a0++){
        int n;
        cin >> n;
        vector<int> q(n);
        for(int q_i = 0;q_i < n;q_i++){
           cin >> q[q_i];
        int ans = 0;
        for (int i = n - 1; i >= 0; i--){
            if (ans == -1)
            int k = i;
            while (q[k] != i + 1)
            if (i - k > 2){
                ans = -1;
            } else {
                while (k != i){
                    swap(q[k], q[k + 1]);
        if (ans == -1)
            puts("Too chaotic");
            cout << ans << "\n";
    return 0;

In Java : 

import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(;
        int T = in.nextInt();
        int a,c;
        for(int a0 = 0; a0 < T; a0++){
            int n = in.nextInt();
            int q[] = new int[n], q2[] = new int[n];
            for(int q_i=0; q_i < n; q_i++){
                q[q_i] = in.nextInt()-1;
                q2[q_i] = q_i;
            for(int i=0;i<n;i++) {
                if (q[i]==q2[i]) {
                } else if (q[i]==q2[i+1]) {
                } else if (q[i]==q2[i+2]) {
                } else {
                    System.out.println("Too chaotic");
                if (i==n-1) {

In C :

#include <stdio.h>
int N;
int ar[100000];

int scan_swap ( int j ) {
	int temp;
	if ( j == ar[j - 1] ){
		return 0;
	else if ( j == ar [j - 2] ){
		temp = ar[j- 2];
		ar[j - 2] = ar[j - 1];
		ar[j - 1] = temp;
		return 1;
	else if (j == ar [j - 3] ){
		temp = ar[j- 3];
		ar[j - 3] = ar[j - 2];
		ar[j - 2] = ar[j - 1];
		ar[j - 1] = temp;
		return 2;
	else return -1;

int main (void){
	int T, i, j, k, point;
	scanf ("%d", &T);
	for (i=0;i<T;++i){
		scanf ("%d", &N);
		for (j=0; j<N; ++j) 
			scanf("%d", &ar[j] );
			int total = 0;
		for (j=N; j>0; --j){
			point = scan_swap ( j );
			/*for (k=0; k<N; ++k) 
				printf("%d ", ar[k] );puts("");*/
			if ( point != -1 ){
				total += point;
			else {
				total = -1;
		if ( -1 == total ){
			puts ("Too chaotic");
		else printf ("%d\n", total);

In Python3 :

def count_inversion(lst):
    return merge_count_inversion(lst)[1]

def merge_count_inversion(lst):
    if len(lst) <= 1:
        return lst, 0
    middle = int( len(lst) / 2 )
    left, a = merge_count_inversion(lst[:middle])
    right, b = merge_count_inversion(lst[middle:])
    result, c = merge_count_split_inversion(left, right)
    return result, (a + b + c)

def merge_count_split_inversion(left, right):
    result = []
    count = 0
    i, j = 0, 0
    left_len = len(left)
    while i < left_len and j < len(right):
        if left[i] <= right[j]:
            i += 1
            count += left_len - i
            j += 1
    result += left[i:]
    result += right[j:]
    return result, count
for _ in range(int(input())):
    if any(a[i]-(i+1)>2 for i in range(N)):
        print("Too chaotic")

View More Similar Problems

Dynamic Array

Create a list, seqList, of n empty sequences, where each sequence is indexed from 0 to n-1. The elements within each of the n sequences also use 0-indexing. Create an integer, lastAnswer, and initialize it to 0. There are 2 types of queries that can be performed on the list of sequences: 1. Query: 1 x y a. Find the sequence, seq, at index ((x xor lastAnswer)%n) in seqList.

View Solution →

Left Rotation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d

View Solution →

Sparse Arrays

There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun

View Solution →

Array Manipulation

Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu

View Solution →

Print the Elements of a Linked List

This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode

View Solution →

Insert a Node at the Tail of a Linked List

You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Input Format: You have to complete the SinglyLink

View Solution →