This post is all about the solution of the D. Distinct Split Codeforces Round #849 (Div. 4) Problem solution.

D. Distinct Split Codeforces Round #849 (Div. 4) Problem solution

Codeforces

Problem Statement :

Let us define the f(x) function for a string x as the number of distinct characters contained in the string. For instance, f(abc) = 3, f(bbbbb) = 1, and f(babacaba) = 3.
Given a string s, divide it into two non-empty strings a and b in such a way that f(a)+f(b) is as large as possible. Find the maximum possible value of f(a)+f(b) such that a+b=s (the concatenation of string a and string b is equal to string s).



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