Codeforces Round 738 - All Solutions (A-E) + Screencast

Contest link: codeforces.com/contest/1559
My submissions: codeforces.com/submissions/ga...
Blog for E about complexity: discuss.codechef.com/t/more-i...
More help for E (this helped me to understand the trick, a lot): www.quora.com/How-do-I-find-t...
Decided to do heavy commentary again, and this time it cost me a lot more... imagine having less points than someone with fewer problems
Also, what happens when you forget to register
Timestamps:
Intro 00:00
A (solving) 01:06
B (solving) 05:00
C (solving) 30:24
D1 (solving) 37:44
D2 (solving) 1:00:10
Intermission 1:06:28
Finishing D2 1:12:02
E (solving) 1:33:26
Contest review/opinions 1:50:04
A (solution + code) 2:01:04
B (solution + code) 2:04:58
C (solution + code) 2:15:24
D1 (solution + code) 2:26:00
D2 (solution + code) 2:33:45
E (solution + code) 2:47:48
Outro 3:01:12

[@vernick8823]

It was a very nice round, thank you for the solutions.

[@josephwong2832]

learning a lot from your streams colin !

[@sobieso]

colin cracked

[@nirajandata]

philosophie

[@ajayreddy7043]

Thanks a lot for solutions Helping many people

[@muhammeda3328]

as usual , like before watching and save to watch later 😊🙃

[@glaucoa.9214]

I love yours videos....

[@sahilsoni8507]

couldn't understand at 2:33:29 mine is like union by size and it will manually relabel the nodes in the smaller component nlogn also I don't know what's a dsu and could you show a problem like D1 where greedy won't work and how would we solve then ?

[@mojojojo890]

Weird that codeforces uses problems like D1 where the proof(the entire proof or to the point where u can convince urself that it is correct) needs work more than the time for the entire contest

[@aurrum4654]

In time codes at the end D1 solution is written 2 times :)

[@ColinGalen]

Thank you, fixed! dumb copy-paste errors...

[@anuragtomar2850]

Ohh, I also forgot to register for this one

[@gauravarora194]

I think in B The one which is not passed is because you have used The condition that rp !=n-1 but it can be n-1 as if last character of string is not ? and there are ? before it you are not changing them
as in in your wrong code ??B will not work

[@sahilsoni8507]

also if you forget register try solving C first idk if it will help u get a better rating but solving A and B in the first 3 min will make you feel bad when you wouldn't be able to submit in the first 10 min also thank god there is extra registration lol i have missed a registration a lot

[@HAL--vf6cg]

I really want some chicken wings