Painters problem

#1

I think my logic is correct from my side can u plz check it

#2

@ajayrajsingh_817 please provide the ide link of your code.

#3
#4

@ajayrajsingh_817 the way you are checking for possibility of answer is wrong, you need to check if for the current mid values is it possible to allocate the work among all the painters. So try to make a separate function for it, which will return true/false on basis of possibility.
Also don’t sort the array, it is given in the question that “any painter will only paint contiguous sections of board”, so order matters here.

#5

sir can u check my monotonic search space is it correct or not???

#6

monotonic search space is in tym domain s=maxboard size*time and e=sum of board size *time is it correct???

#7

yes the search space is correct, just correct the checking condition.

#8

sir plzz help me out in checking that condition

#9
#10

it gives wrong ans can u plzz check why this happens

#11

some of the test cases didn’t pass

#12

I have wrong the possible function with proper comments, please have a look at this, and let me know in case of any doubts https://ide.codingblocks.com/s/229718

#13
#14

can you plzz check my code it passes only 2 cases

#15

@ajayrajsingh_817 The start should be maximum value from the array, since we are not sorting it taking a[n-1] will not work, take maximum from array.

#16

rest code correct hai???

#17

@ajayrajsingh_817
why are you multiplying ans*t , it is already taken into the account.