CommonLounge is a community of learners who learn together. Get started with the featured resources above, ask questions and discuss related stuff with everyone.
Q&A Session with Sumeet Varma, Codeforces India #1by Keshav Dhandhania
Hey there! I’m Sumeet Varma. I am extremely interested in Algorithms and Data Structures and so I do a lot of competitive programming. I am also a big fan of Counter-Strike, Politics and reading random answers on Quora.
My team (FruitSalad) came 1st in ACM ICPC ‘17 Kharagpur Regionals, 2nd in Kolkata Regionals and 7th in India Finals and we have qualified for World Finals. Also, I have been Red on Codeforces and the highest rated Indian programmer on Codeforces, Hackerrank and Topcoder in the past.
Currently, I am doing an internship at Directi (Bangalore) as a part of my project for final semester at DA-IICT, Gandhinagar.
Ask me anything!
Moderator note: We are very excited to host Sumeet for a Q&A session! He has a max rating of 2515 on Codeforces and 2173 on TopCoder, and you can see the graph going up consistently over the last 2.5 years. It's time to find out more about the person behind ...
Read more…(190 words)
Need Help with INOI 2019 Problem 1 - Processor Scheduling.by Sheharyaar Tausif
I was attempting INOI 2019 Problem 1 - Processor Scheduling. I came with a greedy solution to carry out all the classified jobs until the first public job time and then carry out the public job. I am getting WA. I am unable to understand DP states here. Need help from scratch.
PS: I am able to solve ZCO DP problems but INOI DP problems are getting difficult to me. I have done the tasks in Intermediate section. Please can anyone help me with more material and problems. I am unable to find INOI level DP problems. Thank You.
Read more…(109 words)
Need Help With INOI 2019 Problem 2by Sheharyaar Tausif
I was trying to solve INOI 2019 Problem 2 - Interesting Sequences. I have tried the DP solution.
My approach -
1) Sort array and check for elements with same values and store the maximum answer possible.
2) LIS type DP to check the maximum answer.
3) Print the maximum of answers obtained from 1 and 2.
My approach is giving WA. I have tried to understand other's solutions and I have noticed they are something like binary search + DP. I cant understand it. Please help.
Now I get it, I was misinterpreting question all this time. Actually after finish of each round, lead is not the difference between points of that round. But the lead is difference between the points achieved through all rounds including current round - Lakpa Tashi Bhutia