A9860 | Fox And Names
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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: $s_{i}≠t_{i}$ . 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 $s_{i}$ and $t_{i}$ according to their order in alphabet.
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: $s_{i}≠t_{i}$ . 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 $s_{i}$ and $t_{i}$ according to their order in alphabet.
输入格式
The first line contains an integer $n$ ( $1<=n<=100$ ): number of names.
Each of the following $n$ lines contain one string $name_{i}$ ( $1<=|name_{i}|<=100$ ), the $i$ -th name. Each name contains only lowercase Latin letters. All names are different.
Each of the following $n$ lines contain one string $name_{i}$ ( $1<=|name_{i}|<=100$ ), the $i$ -th name. Each name contains only lowercase Latin letters. All names are different.
输出格式
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).
Otherwise output a single word "Impossible" (without quotes).
输入输出样例
输入 #1
3 rivest shamir adleman
输出 #1
bcdefghijklmnopqrsatuvwxyz
输入 #2
10 tourist petr wjmzbmr yeputons vepifanov scottwu oooooooooooooooo subscriber rowdark tankengineer
输出 #2
Impossible
输入 #3
10 petr egor endagorion feferivan ilovetanyaromanova kostka dmitriyh maratsnowbear bredorjaguarturnik cgyforever
输出 #3
aghjlnopefikdmbcqrstuvwxyz
输入 #4
7 car care careful carefully becarefuldontforgetsomething otherwiseyouwillbehacked goodluck
输出 #4
acbdefhijklmnogpqrstuvwxyz
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted