Difference between revisions of "2013-2014 Petrozavodsk Winter Training Camp, Saratov SU Contest"
Jump to navigation
Jump to search
(Created page with "== Problem A == Unsolved. == Problem B == Solved by kblack & zerol. 03:51 (+) == Problem C == Solved by ultmaster. 01:16 (+) == Problem D == Unsolved. == Problem E ==...") |
|||
| Line 18: | Line 18: | ||
Solved by zerol. 00:32 (+) | Solved by zerol. 00:32 (+) | ||
| + | |||
| + | 题意：给若干个字符串，要求两两配对，使得每一对的最长公共前缀的长度和最大。 | ||
| + | |||
| + | 题解：全部插入一棵 trie，如果某个结点有超过两个字符串，就两两一对用掉，如果剩下一个的话就丢给父节点。 | ||
== Problem F == | == Problem F == | ||
Revision as of 10:34, 14 February 2019
Problem A
Unsolved.
Problem B
Solved by kblack & zerol. 03:51 (+)
Problem C
Solved by ultmaster. 01:16 (+)
Problem D
Unsolved.
Problem E
Solved by zerol. 00:32 (+)
题意：给若干个字符串，要求两两配对，使得每一对的最长公共前缀的长度和最大。
题解：全部插入一棵 trie，如果某个结点有超过两个字符串，就两两一对用掉，如果剩下一个的话就丢给父节点。
Problem F
Solved by kblack. 01:33 (+)
Problem G
Unsolved.
Problem H
Unsolved.
Problem I
Unsolved.
Problem J
Solved by kblack. 00:54 (+)
Problem K
Solved by ultmaster. 03:59 (+1)