拓扑排序 Fox And Names : CodeForces
来源:互联网 发布:java教程免费下载 编辑:程序博客网 时间:2024/05/29 19:46
题目:CodeForces - 510C
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 lexicographically, output any such order as a permutation of characters ‘a’–’z’ (i. e. first output the first letter of the modified alphabet, then the second, and so on).
Otherwise output a single word “Impossible” (without quotes).
题意:
重新定义一个字母序列使得给出的姓名表有序.
思路:
由姓名表得到字母对的大小关系,再由大小关系进行拓扑排序,若无法拓扑排序即为Impossible.比较简单不附代码了.
- 拓扑排序 Fox And Names : CodeForces
- codeforces 510C Fox And Names 拓扑排序
- Codeforces 510C - Fox And Names (拓扑排序)
- Codeforces 510C Fox And Names 拓扑排序
- codeforces 510c Fox And Names 拓扑排序
- [CodeForces 510C]Fox And Names[字典序][拓扑排序]
- Codeforces 510C Fox And Names 拓扑排序
- [CodeForces] 510 C Fox And Names [拓扑排序]
- 拓扑排序 CodeForces - 510C Fox And Names
- Codeforces 510C Fox And Names【拓扑排序】
- codeforces 510C Fox And Names 拓扑
- [拓扑] Codeforces #510C. Fox And Names
- 拓扑排序 Codecorces510C Fox And Names
- codeforces510C. Fox And Names【拓扑排序】
- 【拓扑排序】 Codeforces Round #290 (Div. 1) A Fox And Names
- Codeforces Round #290 (Div. 2)C. Fox And Names(拓扑排序)
- Codeforces Round #290 (Div. 2)C - Fox And Names——拓扑排序
- Codeforces Round #290 (Div. 2) C. Fox And Names 拓扑排序
- esp8266采用AT方式建立udp客户端
- J2EE JSP Java的区别
- Spark之分层抽样
- opengl
- 陕鼓-肥水流到外人
- 拓扑排序 Fox And Names : CodeForces
- Java File 类的使用方法详解
- 配置javacv环境与jniopencv_core.dll: Can't find dependent libraries解决
- js模板引擎artTemplate学习总结
- C#的Timer
- C——判断空行
- 云服务器和VPS哪个好?
- 【BSGS】POJ2417[Discrete Logging]&POJ3243[Clever Y]题解
- 手写数据结构----------HashMap