CodeForces - 510C（拓扑排序）

最新推荐文章于 2019-08-02 23:33:00 发布

Sega_hsj

最新推荐文章于 2019-08-02 23:33:00 发布

阅读量674

点赞数

分类专栏：算法学习 acm 图论文章标签： codeforces 拓扑排序

本文链接：https://blog.csdn.net/hsj970319/article/details/55292208

版权

该博客探讨了如何找到一种字母顺序，使得给定的一组作者名字按照字典序排列。通过构建有向图并进行拓扑排序，判断是否存在这样的字母顺序。文章包含多个示例和解决方案。

摘要由CSDN通过智能技术生成

Fox Ciel is going to publish a paper on FOCS (Foxes Operated Computer Systems, pronounce: “Fox”). She heard a rumor: the authors list on the paper is always sorted in the lexicographical order.

After checking some examples, she found out that sometimes it wasn’t true. On some papers authors’ names weren’t sorted in lexicographical order in normal sense. But it was always true that after some modification of the order of letters in alphabet, the order of authors becomes lexicographical!

She wants to know, if there exists an order of letters in Latin alphabet such that the names on the paper she is submitting are following in the lexicographical order. If so, you should find out any such order.

Lexicographical order is defined in following way. When we compare s and t, first we find the leftmost position with differing characters: si ≠ ti. If there is no such position (i. e. s is a prefix of t or vice versa) the shortest string is less. Otherwise, we compare characters si and ti according to their order in alphabet.

Input
The first line contains an integer n (1 ≤ n ≤ 100): number of names.

Each of the following n lines contain one string namei (1 ≤ |namei| ≤ 100), the i-th name. Each name contains only lowercase Latin letters. All names are different.

Output
If there exists such order of letters that the given names are sorted lexicograp