I have solved it.
Hi there, this was really a very good video. Thanks for making it.
There’s no segtree solution for flipcoin in python, the one I tried (iterative, algorithm from codeforces) gave TLE. Did anybody manage to get an AC in python3 using segtree or are the constraints too tight?
User @alexthelemon has a solution using BIT so I’m looking to figure that out.
A good resource for learning segment trees
lazy[node<<1] = 1-lazy[node<<1]; lazy[(node<<1)+1] = 1- lazy[(node<<1)+1] ;
@u_seem_surprsd what are we doing by this ??
Great! Interesting how you have used the condition for lazy update → (end-start+1) - ST[node]
Is it possible for any range based problem to have a suitable condition for lazy update?
Hello,can you please help me, i am not able to spot my mistake in the code.
Thanks in advance.
I am not able to find my mistake in the code.
Can anyone please help me out.
Thanks in adavance.