Comments

Thanks! I guess that's the best way, just have to throw more money. And cache should be large enough to store data of all my users (even if they are in Billions?), and should also have a backup server in case master goes down. I wonder how Mike does this...

On MikeMirzayanov → SIT STAR Contest, 6 years ago
+3

Problem K was dp right?? States are obvious but first we will have to sort on pre(t[i])+d[i]. How to solve it? My logic was to find dp (dp[i][j] = min cost to select j elements till index i) then backtrack to find elements.

-17

Instead, why don't you try to earn it!?

Hey, I got a referral from Amazon but they said the process is going very slow, so I am not sure when will the interviews get schedule. I guess you have a offer from directI, do you know if they are still hiring?

That's why I posted this blog here, because we have all the best coders and developers on cf from all over the globe and in different different companies. So it will be easier to get the status and situation here. I am sure there are more people like me whose offers get revoked so I thoughts it might be helpful for those too.

You are absolutely right, that's exactly what I thought. The only thing that I'm scared of is a long recession of more than 6 months.

No, I'm in my final year. Will graduate after 2 months

In 5th question I used simple BIT (point update and range sum query) with map but was getting TLE for large x.
How to optimize it?

Why don't you make it unrated for all those participants whose rating is decreasing xD
P.S. : My rating is increasing.

*codes