Difference between revisions of "2016-2017 CT S03E07: HackerEarth Problems Compilation"
Jump to navigation
Jump to search
| Line 2: | Line 2: | ||
Solved by ultmaster. 04:51 (+4) | Solved by ultmaster. 04:51 (+4) | ||
| + | |||
| + | 题意：给 $n$ 个串，有两种操作，一种是给某个串加一个字符，另一种是求存不存在一个串是查询串的子串。强制在线。 | ||
| + | |||
| + | 题解：由于限制了总长，所以不同的长度不会太多（根号级别）。枚举长度匹配一下哈希就行。把素数改成 unsigned long long 就能 AC 了。 | ||
| + | |||
| + | 所以为什么大家都是用自动机过的啊？ | ||
== Problem B == | == Problem B == | ||
Revision as of 10:44, 9 December 2018
Problem A
Solved by ultmaster. 04:51 (+4)
题意：给 $n$ 个串，有两种操作，一种是给某个串加一个字符，另一种是求存不存在一个串是查询串的子串。强制在线。
题解：由于限制了总长，所以不同的长度不会太多（根号级别）。枚举长度匹配一下哈希就行。把素数改成 unsigned long long 就能 AC 了。
所以为什么大家都是用自动机过的啊？
Problem B
Solved by zerol. 00:13 (+)
Problem C
Solved by ultmaster. 01:13 (+)
Problem D
Solved by zerol & kblack. 02:30 (+5)
Problem E
Solved by ultmaster. 00:16 (+)
排序签到。
Problem F
Solved by ultmaster. 03:31 (+1)
Problem G
Solved by zerol. 04:01 (+)
Problem I
Solved by kblack. 01:36 (+1)
Problem J
Solved by kblack. 03:49 (+4)
Problem K
Solved by ultmaster. 02:12 (+)