| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 142 |
| 5 | Errichto | 139 |
| 6 | adamant | 136 |
| 6 | AmShZ | 136 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
This is the problem (https://codeforces.me/group/wlb0UYQSQF/contest/644248/problem/H)
It was asked last year in indian ICPC mock contests..
I had solved it before! I used the same code, coz why not? Its allowed..
And testcases are weak too, i had by mistakenly ignored all elements greater than N+64, and still got AC!
Auto comment: topic has been updated by Hyder1102 (previous revision, new revision, compare).
Auto comment: topic has been updated by Hyder1102 (previous revision, new revision, compare).
Auto comment: topic has been updated by Hyder1102 (previous revision, new revision, compare).
Source of the provided problem if we dig even deeper: Link
XXI Open Cup, Grand Prix of Korea, problem H.
However, I believe contest quality was good. Thanks for the authors!
Is your avatar Natsumi? She's so cute
Yes, Natsumi Kyouno
I think that's just a normal observation. If we assume that a 0 is worth 1 point and a 1 is worth 1 point, then making a 2 requires a 0 and 1, or at least 2 points, making a 3 requires a 0, 1, and 2, so 4 points, 8 points, etc. So increasing the mex takes a horrifically exponential amount of points and you correctly concluded that it won't happen beyond like 40 or 50 or 60.