During Codeforces Round 1065 (Div. 3), I wrote problem H and defined a segment tree. I queried max to m+n+1 but forgot to expand my tree[MAXN<<2] array, so it should cause a UB. Unexpectedly, I passed the problem and my friends all failed to hack me. Can somebody hack me or explain the reason why it can pass? Thanks so much.
Submission ID: 349946106
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
Please hack him, because I made a bet with him. If anyone hacks him, I will get a McFlurry.
You will lose XD
It got RTE on my computer but somehow got AC on codeforces. I don't understand how.
welcome to the realm of unexpected behavior
u need to stop gooning to anime sir