2011-2012 ACM-ICPC Northeastern European Regional Contest (NEERC 11)
NEERC 11
- 某题题解[solutions]
Problem A
Solved by dreamcloud. 00:22
Problem B
Solved by oxx1108. 00:42
题意:给小于$m$的数二进制编码,要求满足一堆性质的情况下用的数字最少。
题解:签到题,读懂题就会做了。
Problem C
Solved by Xiejiadong & oxx1108. 04:26(+1)
题意:给出每一个字母的点阵,求讲一个句子点阵变换成另一个句子的点阵最少需要几步。
题解:暴力预处理每一个字母在每一个位置为开始的最少需要改变多少的点阵位置。
然后就是跑dp,$f[i][j]$表示新句子的前$i$个字母,填到第$j$列最少需要改变的次数,暴力转移即可。
这道题目的输入非常繁琐,oxx完成了最复杂的一块;Xiejiadong写了最简单的dp一块,还写挂了,请来了oxx debug
Problem D
Solved by Xiejiadong. 01:12(+1)
题意:
题解:
Problem E
Solved by dreamcloud. 02:35(+1)
Problem F
Unsolved.
Problem G
Solved by Xiejiadong. 02:25
Problem H
Unsolved.
Problem I
Solved by oxx1108. 01:27
题意:交互题,猜全排列,每次告诉你猜的序列与答案序列的最长子序列(不连续),要求在$5n^2$次数以下猜出来。
题解:
Problem J
Unsolve.
Problem K
Solved Xiejiadong. 00:51
Problem L
Unsolved.