(2^k-1)*(n-1)

yeah thanks for amazing insights...

i also feel like this approach is mostly correct...

but definitely added this type of thinking in my thinking set(thanks for this).

mohammedehab2002

In problem B its N^K i guess not K^N Fix it

This Contest Goes too bad for those who don't know how to search on google while contest is running.

can u explain for the same. i am noob at math or number theory

how to solve C?

do you guys noted this thing?

for those image is not loading : image

what about score distribution?

We Want vovuh in upcoming div3 rounds :P

can you explain div2 B,C?

hardforces!! ( atleast for me don't know about others )

here you got +26. ratings are like a roller coaster sometimes up sometimes down.

[DELETED]

now i know the basic O(N^3) solution with help of some and your comments. can you explain how to reduce it to O(N^2) time complexity?

someone please Explain C ..... the editorial is too complex at least for me

how to solve C? it didn't get the editorial nor the comments. can someone explain it breifly?

solve problems with difficulty level ( your current rating + 200 ).try this you will see change very soon.

thanks for your efforts

but after giving 2.5hours+ still i am not comfortable that how this is working ..... i know this is a valid pattern but unable to answers whether i can think this on my own in or after contest..

at the end ..... waiting for editorial.......

how to solve C

Thanks for stolen problem as well.

for reference : https://www.geeksforgeeks.org/find-local-minima-array/

is there any prizes?

can someone explain where i am wrong in Probem E

i am getting WA on test 5

although i did similar as mentioned in editorial.

SUBMISSION

yeah just got it thanks!!

yeah just got it thanks!!

are u serious Ashishgup?

can someone explain Problem E i didn't get what editorial wants to say

Thanks Ashishgup for such an amazing contest!! liked problemset

Thanks :P

Thanks :P

Thanks :P

what is proof of using fibonacci pattern in problem D

Can someone explain the logic behind using fibonacci pattern in problem D

Yes i got it Sir :) Thanks for such a amazing explanation.

Thanks i got it now :)

I am talking ABOUT XOR TREE PROBLEM

i didn't got what is a+b or what does these inequalities say?? can you explain little more??

can you tell me why resulting graph do not contain cycle??

I know a lot of people solved C. But for Those who are unable to think why greedy works or unsatisfied with editorial can read this :)

so we have to fill our knapsack such that sum(wt)<=w and sum(wt)>=(w+1)/2. let say there is one element which is satisfying above condn output that. otherwise elements are present in combo of ai < w or ai > w now do you want to include an item which has size > w in knapsack?? no because taking that in any situation will deny our requirements so let's shrink the array to only those elements which has size<w/2

Now we have all elements < w/2 if sum of all remaining elements <w/2 that means we can't make req. config output -1

now there is always a way to make sum>=(w+1)/2 and sum<=w how?? sort it. iterate in reverse manner. stop where sum>=w/2.

now why let define number line as ----region1-----w/2----region2------w---region3------- now if we are on region 2 we are ok output now many of you are thinking it may be possible we are at end of region 1 and some number comes and we promoted to region 3 right?? so my dear friend promoting from region 1 to region 3 requires w/2+something value which is not present in our array. because if it was there we can output that :)

If something is still unclear let me know :)

Thanks, when there is so simple explanation written by slycelote then why people are not writing just this. in two lines i got the whole logic behind this. Thanks again

Perfect!! 4 years old comment still helps!!. Thanks Mucosolvan

it is better to drop problem link so that we can land over there.

Perfect. but it is hard to come up with a solution like this At least for me in contest time or may be after that :).

true :(

Thanks, i have one doubt why you did summation in last 3rd line??

Perfect!! Thanks ExplodingFreeze.

what is wrong with this approach for problem D we will fill the value in increasing order for example if we have queries like + + 2 + 1 + 3 + 4 bla bla bla so for (first 2 pluses ) we will assign 2 and 4 next we will assign 1 and so on but this gives wrong answer can anyone explain.

Got it by Offline. if you have another way Please Make sure to share it :P

Weak Pretests, Long Queues, Unexpected Errors and Rated :(. Make it Unrated :P

Weak Pretests, Long Queues, Unexpected Errors and Rated :(. Make it Unrated :P

can you tell me why?? i am looking for such a comment.

Thank's i Got it

can you provide link for question 1