A805 | Standing Out from the Herd--Platinum
来源USACO
时间限制1s
内存限制128MB
通过 / 提交0/0
题目描述
Just like humans, cows often appreciate feeling they are unique in some way.
Since Farmer John's cows all come from the same breed and look quite similar,
they want to measure uniqueness in their names.
Each cow's name has some number of substrings. For example, "amy" has
substrings {a, m, y, am, my, amy}, and "tommy" would have the following
substrings: {t, o, m, y, to, om, mm, my, tom, omm, mmy, tomm, ommy, tommy}.
A cow name has a "uniqueness factor" which is the number of substrings of that
name not shared with any other cow. For example, If amy was in a herd by
herself, her uniqueness factor would be 6. If tommy was in a herd by himself,
his uniqueness factor would be 14. If they were in a herd together, however,
amy's uniqueness factor would be 3 and tommy's would be 11.
Given a herd of cows, please determine each cow's uniqueness factor.
Since Farmer John's cows all come from the same breed and look quite similar,
they want to measure uniqueness in their names.
Each cow's name has some number of substrings. For example, "amy" has
substrings {a, m, y, am, my, amy}, and "tommy" would have the following
substrings: {t, o, m, y, to, om, mm, my, tom, omm, mmy, tomm, ommy, tommy}.
A cow name has a "uniqueness factor" which is the number of substrings of that
name not shared with any other cow. For example, If amy was in a herd by
herself, her uniqueness factor would be 6. If tommy was in a herd by himself,
his uniqueness factor would be 14. If they were in a herd together, however,
amy's uniqueness factor would be 3 and tommy's would be 11.
Given a herd of cows, please determine each cow's uniqueness factor.
输入格式
The first line of input will contain $N$ ($1 \le N \le 10^5$). The following
$N$ lines will each contain the name of a cow in the herd. Each name will
contain only lowercase characters a-z. The total length of all names will not
exceed $10^5$.
$N$ lines will each contain the name of a cow in the herd. Each name will
contain only lowercase characters a-z. The total length of all names will not
exceed $10^5$.
输出格式
Output $N$ numbers, one per line, describing the uniqueness factor of each
cow.
cow.
输入输出样例
输入 #1
3 amy tommy bessie
输出 #1
3 11 19
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted