Difference between revisions of "2019 ICPC Shanghai Onsite"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) (→Replay) |
Xiejiadong (talk | contribs) |
||
Line 19: | Line 19: | ||
== Problem B == | == Problem B == | ||
− | + | Solved by Xiejiadong. 00:32 (+) | |
+ | |||
+ | 题意:判断给出的所有字符串是否存在其中一个是另一个的前缀。 | ||
+ | |||
+ | 题解:直接把每一个字符串插入字典树,插入一个单词的时候,以下两种情况就是产生前缀关系了: | ||
+ | |||
+ | * 单词的结尾是已经存在的(为已经插入字符串的前缀); | ||
+ | |||
+ | * 插入的过程中遇到了单词结尾的标记(已经插入的字符串存在当前串的前缀)。 | ||
== Problem C == | == Problem C == |
Revision as of 06:04, 3 December 2019
Replay
Xiejiadong:
- ICPC·Tree Round
- 怎么感觉这场的题目,按照垃圾分类的传统全是我的题。
- 被 F 关了两个小时,没有模板纯自己发明,好在发明成功了。
- 第一次打星参赛。
- 没想到一场区域赛可以引起一场如此持久的对线。
Kilo_5723:
Weaver_zhu:
Problem A
Unsolved.
Problem B
Solved by Xiejiadong. 00:32 (+)
题意:判断给出的所有字符串是否存在其中一个是另一个的前缀。
题解:直接把每一个字符串插入字典树,插入一个单词的时候,以下两种情况就是产生前缀关系了:
- 单词的结尾是已经存在的(为已经插入字符串的前缀);
- 插入的过程中遇到了单词结尾的标记(已经插入的字符串存在当前串的前缀)。
Problem C
Unsolved.
Problem D
Unsolved.
Problem E
Unsolved.
Problem F
Unsolved.
Problem G
Unsolved.
Problem H
Unsolved.
Problem I
Unsolved.
Problem J
Unsolved.
Problem K
Unsolved.
Problem L
Unsolved.
Problem M
Unsolved.