The 5th FanRuan Cup Southeast University Programming Contest （Winter）
15 problems from The 5th FanRuan Cup Southeast University Programming Contest （Winter） (contest 105069), difficulty -. 11/15 solutions verified against sample I/O.
The 5th FanRuan Cup Southeast University Programming Contest （Winter）
Special | 15 problems | 11/15 verified | Difficulty - | 11m 49s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | rain\uff08easy version\uff09 | 27s | ||||
| B | rain\uff08hard version\uff09 | 1m 14s | ✓ | |||
| C | There are many books and books | 1m 7s | ✓ | |||
| D | We need more and more OR numbers | 52s | ✓ | |||
| E | \u4e0d\u51cf\u7684\u6570\u7ec4 | 34s | ||||
| F | \u4e58\u6cd5\u4e0e\u52a0\u6cd5 | 51s | ✓ | |||
| G | \u9664\u6cd5\u4e0e\u53d6\u6a21 | 29s | ||||
| H | \u6253\u996d | 47s | ✓ | |||
| I | \u5927\u529b\u51fa\u5947\u8ff9 | 51s | ✓ | |||
| J | \u5927\u5174\u571f\u6728 | 47s | ✓ | |||
| K | \u7f8e\u4e3d\u89d2\u5bf9 | 52s | ✓ | |||
| L | \u751f\u6d3b\u5728\u6811\u4e0a | 49s | ✓ | |||
| M | \u67d3\u8272\u6e38\u620f\uff08easy version\uff09 | 55s | ✓ | |||
| N | \u67d3\u8272\u6e38\u620f\uff08hard version\uff09 | 29s | ||||
| O | \u81f3\u5c11\u4e00\u534a\u8981\u76f8\u7b49 | 45s | ✓ |
CF 105069O - 至少一半要相等
We are given an array of integers and we need to output a positive integer with a very specific property: when you reduce every array element modulo this integer, at least half of the elements land in the same residue class.
CF 105069M - 染色游戏（easy version）
We are given a rectangular grid where each cell already has a color assigned to it. The game involves repeatedly applying painting operations, where each operation paints an entire row or an entire column with a single color, overwriting whatever was there before.
CF 105069N - 染色游戏（hard version）
The task describes a grid coloring process where operations repaint entire rows or entire columns, overwriting previous colors.
CF 105069L - 生活在树上
We are given a tree where each node carries a single character, either an opening bracket or a closing bracket. For multiple queries, we are asked to look at the characters along the unique path between two nodes and decide whether that resulting sequence satisfies a special…
CF 105069K - 美丽角对
We are given a set of planar points, and the task is to reason about “beautiful angle pairs” formed by these points.
CF 105069J - 大兴土木
We are given a line of positions, and on this line there are constraints that forbid certain patterns from being formed inside chosen segments.
CF 105069I - 大力出奇迹
We are given two rooted trees built on the same set of labeled leaves. The first tree defines a notion of distance between any two leaves through their lowest common ancestor, so any pair of leaves has a fixed distance determined entirely by the structure of that tree.
CF 105069H - 打饭
We are looking at a planning problem where a person repeatedly performs an action that has a trade-off: each unit of work produces some amount of “food value”, but also consumes some amount of stamina or effort.
CF 105069F - 乘法与加法
We are given an array of numbers and multiple independent queries. Each query focuses on a subarray defined by a left and right boundary, and a number $k$.
CF 105069G - 除法与取模
I can’t write a correct editorial for this yet because the actual problem statement content is missing. Right now we only have the title “除法与取模 (Division and Modulo)” and placeholder Input/Output sections, but none of the key details: what is given, what…
CF 105069E - 不减的数组
We are given an array of integers and the task is to transform it into a non-decreasing sequence by removing elements.
CF 105069B - rain（hard version）
We are given a set of rainfall events, each event covering a continuous segment of cities on a line. Each event has a value representing how much “rain contribution” we gain if we choose it.
CF 105069A - rain（easy version）
I can’t reliably write a correct editorial for this problem yet because the actual statement for “rain (easy version)” (Codeforces Gym 105069A) is not present in the prompt you provided, and the accessible attachment content is incomplete and mixed with unrelated…
CF 105069D - We need more and more OR numbers
The problem revolves around a sequence of numbers that is repeatedly updated using bitwise OR operations, together with online queries that ask for the current value of a particular element after all updates that affect it have been applied.
CF 105069C - There are many books and books
We are given a sequence of books arranged in a line, where each book has an identifier representing its type. The goal is to perform a minimal number of moves so that the final configuration matches a very restricted structure: the books end up split into two consecutive…