Time Limit: Java: 2000 ms / Others: 2000 ms
Memory Limit: Java: 65536 KB / Others: 65536 KB
Input consists of multiple problem instances. Each instance starts with a line
containing two positive integers n and m. the first value indicated the number
of objects to sort, where 2 <= n <= 26. The objects to be sorted will
be the first n characters of the uppercase alphabet. The second value m indicates
the number of relations of the form A < B which will be given in this problem
instance. Next will be m lines, each containing one such relation consisting
of three characters: an uppercase letter, the character "<" and
a second uppercase letter. No letter will be outside the range of the first
n letters of the alphabet. Values of n = m = 0 indicate end of input.
For each problem instance, output consists of one line. This line should be one of the following three:
Sorted sequence determined after xxx relations: yyy...y.
Sorted sequence cannot be determined.
Inconsistency found after xxx relations.
where xxx is the number of relations processed at the time either a sorted
sequence is determined or an inconsistency is found, whichever comes first,
and yyy...y is the sorted, ascending sequence.
Sorted sequence determined after 4 relations: ABCD. Inconsistency found after 2 relations. Sorted sequence cannot be determined.