ABC
SRM 648 · 2015-01-29 · by evima
Problem Statement
You are given two
- The string has exactly N characters, each of which is either 'A', 'B' or 'C'.
- The string s has exactly K pairs (i, j) (0 <= i < j <= N-1) such that s[i] < s[j].
If there exists a string that satisfies the conditions, find and return any such string. Otherwise, return an empty string.
Constraints
- N will be between 3 and 30, inclusive.
- K will be between 0 and N(N-1)/2, inclusive.
3 3 Returns: "ABC"
This string has exactly three pairs (i, j) mentioned in the statement: (0, 1), (0, 2) and (1, 2).
3 0 Returns: "CBA"
Please note that there are valid test cases with K = 0.
5 10 Returns: ""
Five characters is too short for this value of K.
15 36 Returns: "CABBACCBAABCBBB"
Please note that this is an example of a solution; other valid solutions will also be accepted.
3 1 Returns: "BCA"
Submissions are judged against all 113 archived test cases, of which 5 are shown here. Case numbers match the judge’s.
Language: C++17 · define a public class ABC with a public method string createString(int N, int K) · 113 test cases · 2 s / 256 MB per case