ADDMUL - Editorial

nik_sru · September 14, 2015, 7:28pm

What’s wrong with my solution?
https://www.codechef.com/viewsolution/7919583

senbihan · October 2, 2015, 11:06am

[JBAB5E - Online C++0x Compiler & Debugging Tool - Ideone.com][1]

Can you please check my code? What’s wrong with it?
[1]: JBAB5E - Online C++0x Compiler & Debugging Tool - Ideone.com

mayank_r_b · October 23, 2015, 1:08pm

Very nice question to implement lazy propagation

scorpion_ajay · June 17, 2017, 7:40pm

can anybody tell me what’s wrong with my solution?

here is the solution :
[solution][1]
[1]: CodeChef: Practical coding for everyone

rajat1603 · July 13, 2015, 3:52pm

Before switching to segtree i did square root decomposition CodeChef: Practical coding for everyone . It worked for 1st 2nd and 4th subtask but not for 3rd subtask .

ayushj10 · July 13, 2015, 4:04pm

@rajat1603: did you try applying fast I/O to your solution? it may get AC.

likecs · July 14, 2015, 9:04pm

I think your code is update all the elements in the range as you are using the statement - if(st!-end)… i.e. you are not using lazy propagation. Lazy means to update when and only required, update it leaf nodes and return immediately. For details refer to SPOJ Discussion board… Also, Please indent your code for others to understand it easily…

zacky_901 · October 25, 2018, 12:16pm

Yes someone please explain