I thought this was my comment lol.

Can E (Getting Deals Done) be solved using Ternary search?

Same logic and I still can't figure what's wrong with test 7.

This should be NO right? I still can't figure what's test 7.

Apparently to hide the bound in G

don't try to justify that, I am pretty sure your solution passed, doesn't mean it's a great problem.

Let's say I get over it, it doesn't change the fact the the problem setter did a shitty job.

KAN look into the issue.

It shouldn't be problem B div2 is shit.

I give up.(ignore)

I don't think a lot of people get that reference.

so have you figured out why is it so fast?

Is it because they haven't included stronger test cases yet?

How to solve D, I think it's dp but I can't find it. :'(

Still a minute to go.

is it?

In problem C Div2 what do S^2,P^2 mean, since both are sets?

well it wasn't explicitly mentioned that if both cw and ccw satisfy then you should call it undefined, anyway probably my mistake because more than 3000 people were able to understand it.

That was the reason why I didn't submit any solution, I couldn't figure out why this is undefined for half an hour, it should have been mentioned in the question.

wow I ended up thinking about this problem for half an hour and ended up not taking part in the contest.

what about now?

Why aren't ratings updated yet?

go and check out any accepted solution, you can see the test cases now.

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

Can you explain it a bit?

Yes, but with a very large Constant. I mean ok my bad.

What is your approach?

EDIT: I don't think it could be solved in O(n) you gotta atleast sort man.

EDIT2: Ok I guess it could be done in O(n)

I was using Binary search to find the elements which do not overlap, and segtree to find the minimum in them, I don't know how do I avoid Binary search here?

Can adjacency list be used to answer rmq?

How to solve C? I had a O(n*log(n)*log(n)) approach using segment tree and binary search, but I thought it wouldn't pass. Is there a better approach?

Can you please tell me what does upd[i] hold? Actually I don't undersatand what this operation "upd[a[i]+i]++" is doing.

I was going to ask that, and I also don't understand how do I deal with linear recurrences in 2D, I am aware of how to use matrix expo for 1D linear recurrence but isn't it 2D? send_nodes

How to solve Problem C? EDIT: Sorry I didn't see that the editorial is already out.

because let's say one is even positive and other is odd positive, then the answer would be NO.

here you go.

ohh. I did?

meaning?

Why does it say I am out of competition? PLEASE EXPLAIN? PLEASE!!!

I thought you were talking to yourself. lol.

I got WA too on that test.

but since it passed the pretests, they probably allowed that too.

what was pretest 6 in C? :'(

I think it is fixed now.

Danm man! I could have got it correct. Thanks a lot.

Hi! In div2 C, I did exactly what I am supposed to but it didnt pass. Can anyone help me please. http://codeforces.me/contest/810/submission/27247180 ____I don't understand whats wrong with this.

I don't understand D?

How do I unregister for Atcoder Regular contest, because I registered for RC but I would rather appear for beginner contest, and I don't know how do I unregister?

My solution is saying in queue for the last 5 minutes. :( and only 10 minutes are left for the contest.

There's always that one guy who asks this question.