Hi! Dear MikeMirzayanov, KAN, Proof_by_QED and other admins,

sorry for disturbing you. I send this message to appeal for the skipping of my submission Submission #343358835 — Codeforces I was surprised to see Submission #343337184 — Codeforces so similar to mine, but I would provide any evidence to prove my finishing the code independently.

1. I used vs code with CPH Editor during the contest, so I have timeline of the code. I did bad and solved A at 23:09 UTC+8, after that, I started to work on B. I finished my first version of code at 23:34 UTC+8.

https://cubber.lanzoub.com/iGw5t38e4hyb

As you can see, I spent 2 mins making debugging output and finally found it was the input. If I was cheating, why I have made these silly mistakes?

1. I'm a Chinese. Known from the profile, @kondasujay2 is an American. Platforms like youtube, tiktok are banned from China. It is impossible for me to get his code.

2. The idea is easy to work out. Since nm<=2e5, a O(min(nm)nm) was obvious. Just iterate the upper and lower bound of the rectangle and then focus on the horizontal line. Using segment tree or something else would add a log to it, so I was directing to a more concise solution. It's a good choice to do a prefix minimum.

3. Vector coding is really great. I learnt it recently and was applying them to my code.

4. My competing were basicly on Atcoder before. I've started to compete on Codeforces for only months. From my performance and former code, please believe that I have the ability to keep Master. I don't need to cheat.

Above are some of my proof. You can ask more. I'm willing to coorperate.

Also, I hope for some more dependable anti-cheating rules and more accurate skipping and banning. I, with all Codeforces lovers, hope for a better environment.