This post is all about the solution of the B. The Forbidden Permutation Codeforces Round #848 (Div. 2) Problem solution.

B. The Forbidden Permutation Codeforces Round #848 (Div. 2) Problem solution

Codeforces

Problem Statement :

You are given an n-dimensional permutation p, an array of m distinct integers a1,a2,...,am (1ain), and an integer d.
Let pos(x) represent the index of x in permutation p. If array an is not good,
pos(ai) makes the array a good.
A permutation is an array of n distinct integers ranging from 1 to n in any order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not (it appears twice in the array) and [1,3,4] is not (n=3, but there are 4 in the array).



Format of Input :

Timofey visited a well-known summer school and discovered a tree with n vertices. A tree is an undirected connected graph with no cycles.
Except for c0, every vertex in this tree is white. The vertex c0 is black in colour.
Timofey wishes to make all of the vertices of this tree black. He uses n1 operations to accomplish this. During the i-th operation, he selects the currently white vertex ci and paints it black.
Let us define tree positivity as the shortest distance between all pairs of different black vertices in it. The number of edges on the path from v to u is the distance between the vertices v and u.
Timofey wants to know the current state of affairs after each operation.

Format of the Output :

For every test case, print three strings a, b, and c separated by spaces on a single line — capybara names, such that writing them without spaces results in a line s. ab and cb, or ba and bc, must be satisfied.

If you have several options for restoring the names, print any of them. If the names are unable to be recovered, print ":(" (without quotes)


Also Check this out:-


Solution of the Problem: Click Here