how is the answer equal to 2?

ohh nice one! but can you look into my dp solution? (its short and easy to understand). I cant figure out why its wrong.

your input is not valid.

Any approach for problem E? i used dp on trees but it failed on pretest 3. My solution

In problem D, flow worked. Constraints were not tight.

I am not able to solve the problem. can you please look into my submission.

Not able to hack solutions

I am not able to pass problem E with the same complexity mentioned in the editorial. I think the time limit is too tight. Please check the solution.

I will talk with organizers about this.

Auto comment: topic has been updated by daga (previous revision, new revision, compare).

Auto comment: topic has been updated by daga (previous revision, new revision, compare).

The contest has started. Happy Coding!!

get updates: https://www.facebook.com/events/195338937517187/198023660582048/

For Div1-B problem, I used binary search to solve the problem but i am getting wrong answer for case 16. i cant figure it out, can anyone help my solution: http://www.codeforces.com/contest/650/submission/16875724

Yes It will work too.

The same algorithm can be extended if we have k different edge weights. We would be needing k queues and to find the minimum among all the heads of the queues the order will be O(k). I was thinking to reduce this complexity using some data structure but could not do it. Does anyone has any idea?

Edit: This can easily be done using segment tree where each leaf node correspond to the head of the queues. On poping out the head of the queue, update the segment tree with the new head of the queue. For getting the minimum among the queue heads, query for the minimum value in the segment tree.

The overall complexity will be O(Elogk). If k is much lower than V, than I it can be seen as a linear time in E.

Its recently that I have become purple, so I still like giving DIV 2 :D :P

It is good to see codeforces coming up with different types of contests. It really helps a lot.

Can anyone explain solution to problem F? I cant get the editorial.

thanks xD

hope it will be my last div2 :D

short and nice questions...enjoyed solving :D

I cant understand the downvotes, i had a query and i asked it.

Will it be rated round?

In problem E i am getting wrong answer at pretest 2 but for the given test #2, i am getting right answer on my machine as well as on custom invocation. are they different test cases?

how to solve jump on buildings?? any hints??

I am not getting how update operation is done.

Can you explain?

statement of problem div2 B was very poorly made

in div2 D is the graph directed...because otherwise no loops dont make sense??

"Wish you accepted solutions and successful hacks!" sarcastic :P

thanks :D :P

hope this would be my last div2 contest :D

very long questions :(

Why no div1 :/

looking forward for your first set of problems :D

O(N^3) how? I did it in O(N^2).

geometry geometry and geometry :P

Why no div1 :/

I am getting wrong answer on test case 38 of 555D. Any help would be appreciated. Here is my solution.

The order of questions seemed like a fairy tale :D

can you explain??

Div1 C or Div2 C ??

It does not allow to view others solution so early so be patient :P

It was fun solving the problems. A different contest from rest ones.

feeling like imo paper

Div1A felt harder than Div1B :(

Yeah :( The time limit should have been 2 sec. It would be worth solving it.

D can be solved in n^2logn using some concepts of geometry. It would be a nice one if time limit would have been 2 sec. You can see my code here

Thanks man for the help. The writing makes a good sense.

question was nice...it was a good manipulation of knapsack