i have been practicing coding for 2 years,but i have still this problem that after even finding out solution to a problem,i take too much time to implement its code , sometimes for very easy ones. Can anybody please suggest me a good strategy to overcome this thing because it has been a very negative effect for me.

If we are unable to participate in onsite round of ACM ICPC REGIONALS , shall we be provided certificates for qualifying online round and can we write in our resume "Qualified ACM ICPC" and show those certificates as proof?

I am learning link cut tree. Can anyone please provide me some questions to solve related to link cut tree in increasing order of difficulty?

My teacher asked this question to me but i could not give a answer to that. The question is : can you find out for each vertex in a graph whether it's a part of a cycle or not?

Why do we require a 4*n memory for each of the answer array and the flag array in segment tree with lazy propogation.Can not we work with 2*n memory for each of these arrays and also can not we do this thing that instead of using a flag in the parent node for indicating that it's children needs to be updated we set the flag in the children itself indicating that these needs to be updated.