Difference between revisions of "2015-2016 Nizhny Novgorod SU Contest"
Jump to navigation
Jump to search
(Created page with "Problem A Unsolved. Problem B Solved by ultmaster. 01:01 (+) 题意：挺复杂的。英文水平不行。 题解：模拟。签到。 Problem C Solved by u...") |
|||
| Line 1: | Line 1: | ||
| − | + | == Problem A == | |
Unsolved. | Unsolved. | ||
| − | + | == Problem B == | |
Solved by ultmaster. 01:01 (+) | Solved by ultmaster. 01:01 (+) | ||
| Line 11: | Line 11: | ||
题解：模拟。签到。 | 题解：模拟。签到。 | ||
| − | + | == Problem C == | |
Solved by ultmaster. 03:37 (+1) | Solved by ultmaster. 03:37 (+1) | ||
| Line 19: | Line 19: | ||
题解：关键是要算出状态 $f(i,j,k)$ 表示旋转 $i$ 后 $j$ 对应 $k$ 的数量。置要用到的位为 1，然后做 25 次卷积。然后枚举置换求一求就好了。两倍的 NTT（$2 \cdot 10^5$）似乎不行，降到一半之后卡过了。也不知道常数为什么这么大。 | 题解：关键是要算出状态 $f(i,j,k)$ 表示旋转 $i$ 后 $j$ 对应 $k$ 的数量。置要用到的位为 1，然后做 25 次卷积。然后枚举置换求一求就好了。两倍的 NTT（$2 \cdot 10^5$）似乎不行，降到一半之后卡过了。也不知道常数为什么这么大。 | ||
| − | + | == Problem F == | |
Solved by kblack. 01:47 (+3) | Solved by kblack. 01:47 (+3) | ||
| Line 25: | Line 25: | ||
题意： | 题意： | ||
| − | + | == Problem H == | |
Solved by zerol. 00:21 (+) | Solved by zerol. 00:21 (+) | ||
LCT 模板题。签到。 | LCT 模板题。签到。 | ||
Revision as of 00:04, 19 March 2018
Problem A
Unsolved.
Problem B
Solved by ultmaster. 01:01 (+)
题意：挺复杂的。英文水平不行。
题解：模拟。签到。
Problem C
Solved by ultmaster. 03:37 (+1)
题意：求 A-E 的字符串和 a-e 的字符串在建立合理映射并旋转后最多能有多少个位置相同。
题解：关键是要算出状态 $f(i,j,k)$ 表示旋转 $i$ 后 $j$ 对应 $k$ 的数量。置要用到的位为 1，然后做 25 次卷积。然后枚举置换求一求就好了。两倍的 NTT（$2 \cdot 10^5$）似乎不行，降到一半之后卡过了。也不知道常数为什么这么大。
Problem F
Solved by kblack. 01:47 (+3)
题意：
Problem H
Solved by zerol. 00:21 (+)
LCT 模板题。签到。