Difference between revisions of "2011-2012 ACM-ICPC Northeastern European Regional Contest (NEERC 11)"
Jump to navigation
Jump to search
Line 47: | Line 47: | ||
Solved by oxx1108. 01:27 | Solved by oxx1108. 01:27 | ||
− | + | 题意:交互题,猜全排列,每次告诉你猜的序列与答案序列的最长子序列(不连续),要求在$5n^2$次数以下猜出来。 | |
题解: | 题解: |
Revision as of 07:30, 30 August 2018
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)
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.