Schedule Management || Codeforces Educational Round 131 Div2 Problem C

🔥𝐏𝐚𝐲 𝐀𝐟𝐭𝐞𝐫 𝐏𝐥𝐚𝐜𝐞𝐦𝐞𝐧𝐭
Newton School's 𝐅𝐮𝐥𝐥 𝐒𝐭𝐚𝐜𝐤 𝐂𝐨𝐮𝐫𝐬𝐞 𝟐𝟎𝟐𝟐 - bit.ly/FullSta...
Newton School Official WhatsApp Support Number: [phone]
-----------------------------------------------------------------------------------
📌𝐓𝐞𝐥𝐞𝐠𝐫𝐚𝐦:
📌𝐋𝐢𝐧𝐤𝐞𝐝𝐈𝐧: / newto. .
📌𝐈𝐧𝐬𝐭𝐚𝐠𝐫𝐚𝐦: / newtonschoo. .
📌𝐅𝐚𝐜𝐞𝐛𝐨𝐨𝐤: / newtonschool.co
------- 𝐀𝐛𝐨𝐮𝐭 𝐍𝐞𝐰𝐭𝐨𝐧 𝐒𝐜𝐡𝐨𝐨𝐥 -------
🔵NEWTON SCHOOL is an online Edtech company providing the highest-rated FULL STACK DEVELOPMENT PROGRAM for professionals, graduates, and women.
🌕NEWTON SCHOOL is your gateway to a high-paying tech career in 6 months with Zero fees till placement, transforming you into a rockstar full-stack developer earning 5-40 Lakh per annum salary. Newton School’s students are already working in more than 150+ top companies of India including Zomato, Unacademy, Deloitte, Nutanix, etc.
🔵To watch more videos on programming, Data Structures, Android Development, Data Science, C++, Java, React, subscribe to our channel.
- - - - - - - - - - - - - -
If you're reading this far down, hello, you look nice today :)
Guess The String || Codeforces Educational Round 130 Div2 Problem D
#NewtonSchool #NS #Fullstack #FSD #Datascience #MS #Postgrad #webdeveloper #programming #programmer #programmers #developer #coder #programmingmemes #coders #coding #frontenddeveloper #backenddeveloper #html #softwaredeveloper #hacking #python

[@asalaalmasry8163]

Thank you very much, I watched more than 3 videos explaining this problem, and you are the only one who really made me understand it.

[@competitivecoding-newtonsc9601]

Glad it helped

[@manikantrai7384]

Yeah, same for me as well

[@yashkhatwani3198]

Nice Explanation . I though of binary search but was not able to think about isPossible function .

[@competitivecoding-newtonsc9601]

That's a nice improvement. Even if you were able to think about it.

[@JEMohammadAtif]

Your explanation and intution is LIT! I wish one day i could tackle questions as you do !!

[@competitivecoding-newtonsc9601]

Thanks

[@sidharthdhiman4522]

thanx for this beautiful explanation , i though of binary search but i wasn't abel to form the logic of help and left this is great appraoch ,thanx for this solution

[@competitivecoding-newtonsc9601]

Thanks Sidharth

[@chessmemes-]

I really want to thank you your explaining way is very good and it made me understand it very well

[@competitivecoding-newtonsc9601]

Thanks :)

[@035asadali8]

i learn a lot from this question and from your explaination

[@competitivecoding-newtonsc9601]

Thanks Asad

[@gentleman7060]

greatest explanation of this problem

[@competitivecoding-newtonsc9601]

glad it helped

[@leoara8019]

thank you so much.. i understand the solution very well by watching your video

[@competitivecoding-newtonsc9601]

Happy to help

[@RudraSingh-pb5ls]

Good explanation 👏
Only the last part where u tried to explain why it's optimal to use x hours to complete ur pending tasks first and then help someone else was little bit confusing (though i have understood it) . Else everything was good .

[@competitivecoding-newtonsc9601]

Thanks Rudra

[@davidbalaban1228]

excellent ! can you guide how to solve it if one task can be selected by multiple workers ? thanks

[@shreelbansal3026]

Thanks!!

[@competitivecoding-newtonsc9601]

No problem!

[@parthokr]

map gets default value of 0 if not initialized so no need to manually do a rep and setting it to zero

[@competitivecoding-newtonsc9601]

I know partho, but its still good to assign values to 0, as I have sometimes faced TLE due to this.

[@omarfarhat7479]

thanks

[@abhishekgupta9705]

please explain how you choosed higher and lower value

[@competitivecoding-newtonsc9601]

as atleast one task needs to be completed, minimum time i.e. low will be 1, in worst case you have only one worker who does all m tasks, so maximum time i.e. high = 2*m. But in reality you will never use 2*m time.

[@uva4416]

Make editorial for d

[@competitivecoding-newtonsc9601]

will upload in the morning

[@shehapeldien7025]

thx bro : )

[@competitivecoding-newtonsc9601]

Glad it helped

[@anchitjain2002]

Unable to solve c even ones ,could u suggest something unable to get the intuition

[@ardaucar9006]

I think its all about seeing as many type of problems as you can

[@competitivecoding-newtonsc9601]

Try to solve previous Div2C's, that would help I think.

[@sakshamsharma3156]

Sir how to tackle such problems by ourselves?

[@MangoLassiYT]

why isnt the op to second tc 1 cause its the minimum time required

[@competitivecoding-newtonsc9601]

can you please write which case you are talking about?

[@belaluddin6554]

You are requested to share your code always .

[@competitivecoding-newtonsc9601]

That encourages people to copy code. You can find all the submissions in my CF profile epsilon_573

[@puneetdwivedi122]

Your views on the problem.

[@competitivecoding-newtonsc9601]

The problem was nice. Greedy solution was tricky to implement I think, so people who thought of binary search did better in terms of speed.

[@mkitrixxmusic4023]

@@competitivecoding-newtonsc9601 please explain the greedy one too i did it with binary but others are doing it with sets infact after watching their code i m not able to get it
if(*it2+2>=*it1)

[@almuzahid1]

Still, I can not understand. Sorry... Does anybody help me, please?

[@competitivecoding-newtonsc9601]

Which part?

[@almuzahid1]

@@competitivecoding-newtonsc9601 I am not good at binary search. But I already learned binary search. But at 13:44 what is the left & what is the helped? How it actually works? Can you briefly tell about this?

[@035asadali8]

@@almuzahid1 first go and learn binary search then watch the viideo

[@afshanshekh5474]

Hey...Sahil today I m able to solve C...but not regularly 4 of 10 times...any suggestions for me??

[@competitivecoding-newtonsc9601]

I would recommending solving more binary search/ adhoc problems and try to solve C problems of previous Div2 and edu rounds.

[@kabboghosh1853]

plz uploqd D

[@competitivecoding-newtonsc9601]

will upload in the morning.