远端评测题 1000ms 64MiB

[POJ]Sorting It All Out

该比赛已结束,您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Description

An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted sequence A, B, C, D implies that A < B, B < C and C < D. in this problem, we will give you a set of relations of the form A < B and ask you to determine whether a sorted order has been specified or not.

Input

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.

Output

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.

4 6
A&lt;B
A&lt;C
B&lt;C
C&lt;D
B&lt;D
A&lt;B
3 2
A&lt;B
B&lt;A
26 1
A&lt;Z
0 0
Sorted sequence determined after 4 relations: ABCD.

Inconsistency found after 2 relations. Sorted sequence cannot be determined.

Source

East Central North America 2001</p>

「图论专题2」最短路

未参加
状态
已结束
规则
IOI
题目
14
开始于
2022-4-25 16:00
结束于
2022-6-27 4:00
持续时间
1500 小时
主持人
参赛人数
10