Yes, they do lose a rated contest. It's impossible to add them to the leaderboard, too many differences in the problem set.

most of them will probably lose two rated contests if they are competing on-site

You'll get all the photo updates tomorrow during the live contest. :)

And the contest will last for 2 hours.

Happy New Year !!!

It's probably the technical issue that caused the divisions to be combined :P http://codeforces.me/blog/entry/43838

finally positive rating changes :))))

It's never written about ACM, so I think it will be standart CF

Oh god, not again.

6*6*6*6*6 = 7776 won't time out and neither will 6^6 = 46656

Considering that the length must be between 2 and 6 inclusive, I really don't think that generating all the possible strings will be a problem

46656 total strings possible in worst case and O(n) operation per string. Why should it tle? And no chance of overflow as total possible strings are 46656

You can only use 'a', 'b', 'c', 'd', 'e' and'f', the test case you provided is invalid

D. Max-flow with some tricks: Binary search on the answer. For answer being tested edge capacity equals maximum number of bears that can go through it. Calculate max flow. If it's more or equal than number of bears — such answer is achievable.

E. Let's consider graph with all non-forbidden edges (G). G' = G with vertex 1 removed. Proposal: Answer is possible if and only if following conditions are met:

1. Degree of vertex 1 in G more or equal than k.

2. Number of connected components in G' is less or equal k.

3. Each connected component in G' is connected to vertex 1 in G.

In D, I did the following:

1). I used binary search on the answer.

2). How can we check if we can use this weight?

2. 1). Calculate the weight that one bear carry. It will be totalWeight / x.

2. 2). Now, for each edge, we can count how many bears can go through this edge.

2. 3). Count maximum flow. The weight capacity of the edges in the graph will be the values we've counted in 2. 2).

2. 4). When we've counted maximum flow, it will be maximum count of bears. If this value will be more or equal than x, then the bears can carry this weight.

D: Binary search on doubles the check with maxflow if you can travel to the end with each bear's weight equal to the current middle in the binary search.

soon

Iterate through the array if you found a bad index i then you must swap i or i + 1. So try swapping i and i + 1 with the rest of the array and check if each swap will fix all the bad indices.

I think that you can find all "invalid" positions (d[i] <= d[i+1] or >=, whatever), and brute force to "fix" it with swapping with any other position. It's not hard to see that invalid positions cannot be too many (i set limit = 9, but should be <= 6 or smth), and you need a O(1) checking then.

Considering positions i and i+1 as invalid if sequence[i] >= sequence[i+1], for odd i, or if sequence[i] <= sequence[i+1], for even i.

You must notice that if there are more than 6 invalid positions then a single swap won't fix it, so you output 0.

When there are 6 or less invalid positions just test all possible changes with them.

The complexity is O(6*N) if you check if one change makes the sequence nice in O(1).

is it bad?

Did you copy-pasted Ford-Fulkerson from some site? I got WA when used some apparently broken max-flow algorithm from e-maxx.

Feel the same...

Thank you. I myself would not have found.

http://codeforces.me/blog/entry/43860?#comment-285024

How to solve F from this problem set?

my solution for B( codeforces) and E ( hackerearth) has a complexity n*26*q .code

I know that feel bro, same sh_t with MLE, so now I catched -27 to my rating

Wow so you just submit and don't wait to see whether you passed the pretests?
#justgrandmasterthings

I had a similar issue.

I've noticed that I actually got TL for C only after successful submission for D. I'm pretty sure that I've seen "Pretests passed" for C and I think that it is the issue of twitchy status line that can change from "Running on pretest 7" to "Running on pretest 3" and back several times before showing an actual verdict. That's pretty sad :(

A total rating change of 0 in last 24 hours :P

Time limit for this problem was intended to be 1 second or 2 seconds for slow languages like Java to avoid these kind of solutions.