Is there a reliable rating predictor available as of today? This one doesn't seem to be working accurately any more.

Hey!
Yes, the lectures will be simultaneous, but I'm pretty sure that the recordings will be available afterward.

15 minutes into the contest: Will make it 2200+ today.
After about an hour and a half:

I commented to make those people feel better, who weren't able to solve it. xD

The problem A didn't seem like a Div.2 A

Was the round harder than normal or is it just me?

Uploaded solution videos for A-E on this link.

https://www.youtube.com/playlist?list=PLl4Y2XuUavmuDC4ZST4F_peD1jO_xvVfW

Uploaded solution videos for A-E on this link.

https://www.youtube.com/playlist?list=PLl4Y2XuUavmuDC4ZST4F_peD1jO_xvVfW

https://www.youtube.com/playlist?list=PLl4Y2XuUavmsf8Os2QTsRgi6Gn5M1dWO8

Uploaded solution videos of problems A — D2 on this link.

https://www.youtube.com/playlist?list=PLl4Y2XuUavmsf8Os2QTsRgi6Gn5M1dWO8

Will be uploading solution videos of problems A — D2 on this link.

(I don't understand the reason behind so much hate (-25). A to C have been uploaded, D1 & D2 will be uploaded soon)

UPD: Solution videos of D1/D2 and E have been uploaded

https://www.youtube.com/playlist?list=PLl4Y2XuUavmtjmxnbqOAb_UNyRK1soQZw

Will be uploading solution videos of all questions on this link.

Nice solution. I was checking if there exists a subarray of length exactly mid such that it is dominated, if no, I assumed that there will not be any dominated subarray with length less than or equal to mid, which clearly is wrong.

Yeah, but you applied binary search to get the index where a[i] occurs next. I was applying it to find the optimal length.

Who else, first, thought of Binary Search for C? xD

Your comment gave me goosebumps.

Got it. Thanks!

Got it. Thanks!

https://codeforces.me/contest/1251/submission/63338046 https://codeforces.me/contest/1251/submission/63344390

These are two of my submissions for problem D. The 1st one gave run-time error on test-2 and the 2nd one got accepted. The only difference between these 2 submissions was in cmp() function. (I used > in 2nd one whereas >= in the 1st one)

Can anyone please help me figure out why did 1st one give run-time error whereas the 2nd one got accepted?

https://discuss.codechef.com/t/icpc-online-round-2019-updates/42035

Finally, they officially acknowledged that something did go wrong.

Wasn't Div2-C easier than Div2-B ?

Agreed.

Am I the only one who experienced problems with the website today?

Isn't the LCM problem harder for a Div2 C problem?

All the best everyone. Aag laga dena India vaalon (*fire emoji)

For D, I noticed that O(n^2 * N) (where N denotes number of different values of x that had to be checked) solutions have also been accepted. This made me sad. :P