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

ALL MY FRIENDS ARE SUFFERING FROM THE JUDGE QUEUE BECAUSE OF THE F**KING BOTS.

THE BOT ACCOUNTS ARE EASY TO FIND OUT.

THANK YOU.