Difference between revisions of "2016–2017 Northeastern European Regional Contest (NEERC 2016)"
Jump to navigation
Jump to search
| (2 intermediate revisions by 2 users not shown) | |||
| Line 10: | Line 10: | ||
Solved by kblack. 02:18 (+) | Solved by kblack. 02:18 (+) | ||
| + | |||
| + | 温暖的签到。 | ||
=== Problem F === | === Problem F === | ||
Solved by kblack. 01:09 (+) | Solved by kblack. 01:09 (+) | ||
| + | |||
| + | 温暖的签到 | ||
=== Problem G === | === Problem G === | ||
| Line 24: | Line 28: | ||
Solved by ultmaster. 00:56 (+) | Solved by ultmaster. 00:56 (+) | ||
| + | |||
| + | 题意：模拟题二号。给若干不等式，要求合并相交的区间，输出答案。 | ||
| + | |||
| + | 题解：数据范围不大，记录差分信息，求一遍前缀和，然后扫描线合并相邻即可。还要判断全集和空集情况。比较容易写错，要小心一点。 | ||
=== Problem J === | === Problem J === | ||
Latest revision as of 15:22, 11 October 2018
Problem A
Solved by ultmaster. 01:55 (+2)
题意：模拟题。大概就是把某些连续的东西替换成缩写，之类的。
题解：据说用正则表达式一行就能解决。我用 Python 写了好多好多行，怕不是傻逼。。。
Problem E
Solved by kblack. 02:18 (+)
温暖的签到。
Problem F
Solved by kblack. 01:09 (+)
温暖的签到
Problem G
Upsolved by zerol.
Problem H
Solved by ultmaster. 00:56 (+)
题意：模拟题二号。给若干不等式，要求合并相交的区间，输出答案。
题解：数据范围不大，记录差分信息，求一遍前缀和，然后扫描线合并相邻即可。还要判断全集和空集情况。比较容易写错，要小心一点。
Problem J
Solved by zerol. 03:23 (+3)
题意：模拟一个抽积木游戏。倒塌的条件是某一层以上的重心落在了这一层的最外侧木块之外。
题解：由于数据范围，这题相当暴力。维护每一层以上的重心和每一层的最外侧木块和所有木块有没有被取走。