HDU - 2018杭电ACM集训队单人排位赛 - 2 - Problem D. Team Name
发布日期:2021-06-30 23:40:34
浏览次数:3
分类:技术文章
本文共 1830 字,大约阅读时间需要 6 分钟。
Problem D Team Name
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 129 Accepted Submission(s): 68
Problem Description
After all the teams have been matched, what to do next is of course to think about a nice team name. Now it is known that there are n teams taking part in the Guangxi Province Collegiate Programming Contest. And the name of every team is a string consists of English lower characters. Now Luras needs to get her team name, she doesn’t want the name be any consecutive substring of any other teams. And she prefers shorter names. If there are many choices with the shortest length, she would prefer the one which is the smallest lexicographically. Now could you decide the team name for her? We regard string a is lexicographically smaller than string b if there exists such index j that a[i] == b[i] for all i < j and a[j] < b[j].
Input
The first line is an integer T which indicates the case number. And as for each case, there will be n + 1 lines. In the first line, there is one integer n, which indicates the number of teams. Then there will be n strings of the next n lines, indicate the name of every team in each line. It is guaranteed that—— T is about 100. for 100% cases, 1 <= n <= 100, 1 <= |s|(the length of s)<= 30.
Output
As for each case, you need to output a single line. There should be one string in the line which means the name Luras will give to her team.
Sample Input 23abc2abcdefghijklmnopqrstuvwxyzaa
Sample Output d
ac
解题思路:不是 n 个队名中的子串 && 队名字典序尽可能小。
AC 代码
#include#include #define mem(a,b) memset(a,b,sizeof a);#define INF 0x3f3f3f3fusing namespace std;typedef long long ll;char a[110][110], ans[110];bool ok;int n;void dfs(int dep,int len){ if(len==dep) { ans[len++]='\0'; for(int i=0;i
转载地址:https://lux-sun.blog.csdn.net/article/details/81061578 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!
发表评论
最新留言
网站不错 人气很旺了 加油
[***.192.178.218]2024年05月01日 13时49分48秒
关于作者
喝酒易醉,品茶养心,人生如梦,品茶悟道,何以解忧?唯有杜康!
-- 愿君每日到此一游!
推荐文章
攻防世界web进阶区bug详解
2019-04-30
攻防世界web进阶区ics-07详解
2019-04-30
攻防世界web进阶区unfinish详解
2019-04-30
攻防世界web进阶区i-got-id-200超详解
2019-04-30
sql注入总结学习
2019-04-30
leetcode46 全排列
2019-04-30
leetcode 122 买卖股票的最佳时机II
2019-04-30
leetcode 309 最佳买卖股票含冷冻期
2019-04-30
leetcode 714 买卖股票的最佳时机含手续费
2019-04-30
leetcode3 无重复字符的最长子串
2019-04-30
leetcode 1143. 最长公共子序列
2019-04-30
leetcode 83. 删除排序链表中的重复元素
2019-04-30
智能体 Intelligent Agent
2019-04-30
Python 之 histogram直方图
2019-04-30
Python 之 Scatter散点图
2019-04-30
Python实现决策树 Desision Tree & 可视化
2019-04-30
决策树 Decision tree
2019-04-30
nominal和ordinal & 数据处理中四种基本数据类型
2019-04-30
Grid SearchCV(网格搜索)& Python实现
2019-04-30