Yesterday I asked this question about riffle shuffles. It seems that yesterdays question was a bit too hard so this question is a related but much easier task.
Today you are asked to determine if a permutation is in fact a riffle shuffle. Our definition of riffle shuffle is adapted from our last question:
The first part of the shuffle is the divide. In the divide partition the deck of cards in two. The two subsections must be continuous, mutually exclusive and exhaustive. In the real world want to make your partition as close to even as possible, however in this challenge this is not a consideration, all partitions including ones that are degenerate (one partition is empty) are of equal consideration.
After they have been partitioned, the cards are spliced together in such a way that cards maintain their relative order within the partition they are a member of. For example, if card A is before card B in the deck and cards A and B are in the same partition, card A must be before card B in the final result, even if the number of cards between them has increased. If A and B are in different partitions, they can be in any order, regardless of their starting order, in the final result.
Each riffle shuffle can then be viewed as a permutation of the original deck of cards. For example the permutation
1,2,3 -> 1,3,2
is a riffle shuffle. If you split the deck like so
1, 2 | 3
we see that every card in
1,3,2 has the same relative order to every other card in it's partition.
2 is still after
On the other hand the following permutation is not a riffle shuffle.
1,2,3 -> 3,2,1
We can see this because for all the two (non-trivial) partitions
1, 2 | 3 1 | 2, 3
there is a pair of cards that do not maintain their relative orderings. In the first partition
2 change their ordering, while in the second partition
3 change their ordering.
Given a permutation via any reasonable method, determine if it represents a valid riffle shuffle. You should output two distinct constant values one for "Yes, this is a riffle shuffle" and one for "No, this is not a riffle shuffle".
This is code-golf so answers will be scored in bytes with less bytes being better.
1,3,2 -> True 3,2,1 -> False 3,1,2,4 -> True 2,3,4,1 -> True 4,3,2,1 -> False 1,2,3,4,5 -> True 1,2,5,4,3 -> False 5,1,4,2,3 -> False 3,1,4,2,5 -> True 2,3,6,1,4,5 -> False
Takes input as an array of integers. Returns a boolean.
let f = ([x,...a],y)=>a.every(z=>z+~x?y?z==++y:y=z:++x) ;[ [1,3,2 ], // -> True [3,2,1 ], // -> False [3,1,2,4 ], // -> True [2,3,4,1 ], // -> True [4,3,2,1 ], // -> False [1,2,3,4,5 ], // -> True [1,2,5,4,3 ], // -> False [3,1,4,2,5 ], // -> True [2,3,6,1,4,5] // -> False ] .forEach(a => console.log(JSON.stringify(a) + ' -> ' + f(a)))
The input array A is a valid riffle shuffle if it consists of at most two distinct interlaced sequences of consecutive integers.
The challenge rules specify that we're given a permutation of [1...N]. So we don't need to additionally check that the sorted union of these sequences actually results in such a range.
We use a counter x initialized to A and a counter y initially undefined.
For each entry z in A, starting with the 2nd one:
s takes a list of integers as in the OP examples and returns a
s p=or[f(<x)p++f(>=x)p<[1..]|x<-p] f=filter
pin turn and checks if it can be the first element of the second partition of the shuffle. Then
Trueif any of the checks were
pinto elements smaller and larger than (or equal to)
x, concatenating, and checking if the resulting list is
[1..length p], i.e. the elements in order.
[1..length p]is done by seeing if the result is strictly smaller than the infinite list
[1..] == [1,2,3,etc.], which gives the same result for any permutation.
ỤIṢḊRẠ Main link. Argument: A (permutation of [1, ..., n]) Ụ Grade up; sort the indices of A by their respective values. For shuffles, the result is the concatenation of up to two increasing sequences of indices. I Compute the forward differences. In a shuffle, only one difference may be negative. Ṣ Sort the differences. Ḋ Dequeue; remove the first (smallest) difference. R Range; map each k to [1, ..., k]. This yields an empty array for non-positive values of k. Ạ All; check if all resulting ranges are non-empty.
l & [*1..a] | lapplies an intersection and then an union: first get the elements of
<=aand then add the remaining elements of
lwithout changing the order. If a is the number we are looking for, then this operation is the same as sorting
}SQy*2 *2 the (implicit) input list doubled, that is concatenated with a copy y all subsequences of it } contain an element equaling SQ the input list sorted
Checks whether the doubled input list contains a sorted version of itself as a subsequence.
Saved 3 bytes thanks to isaacg.
False for riffle-shuffle and non-riffle-shuffle respectively.
}SQm.nS.Tcd2./ ~ Full program. Reads input from STDIN and outputs to STDOUT. ./ ~ Return all divisions of the input into disjoint substrings (partition). m ~ Map over the above using a variable d. cd2 ~ Chop d into two-element lists. .T ~ Justified transpose, ignoring absences. S ~ Sort (lexicographically). .n ~ Deep-flatten. } ~ Check if the above contains... SQ ~ The sorted input.