Hi!

The Codeforces Round #464 (Div. 2) is going to be held on Saturday, 17 February 2018 at 10:05 UTC for participants from division 2.

The round is based on XIV Nizhny Novgorod Olympiad in Informatics named after V. D. Lelyukh for high school students, which will take place on Saturday in Nizhny Novgorod. However, the problems for the Olympiad and for the round are not completely identical.

The problems were prepared by KAP, ashmelev, ZhNV, kuzmichev_dima, demon1999, SYury, mmatrosov and me. Thanks to mike_live and vepifanov for testing the problems, and gritukan and MikeMirzayanov for helping us to host the round on Codeforces!

As usual, participants from division 1 can take part out of competition.

Good luck and have fun!

UPD: There will be 6 problems with the following scores: 500-1000-1500-2000-2500-2750.

You will be able to view submissions and tests after the end of the olympiad in Nizhny Novgorod around 13:30 UTC.

Congratulations to winners!

Div. 2:

Div. 1:

The editorial is here.

It's Codeforces Round #464 Div.2 not #265 Div 1. Correct me if I was wrong.

Thanks, corrected!

Hope that the problem statements are as short as the announcement.

i hope so

high rating for every one :D

4 days 4 amazing rated contests!!

i'm feeling lucky!! 4 days doing favorite thing! XD

4 rated contests?

It's including tomorrow's contest! I'm sure that it will not go unrated! And ya 4 rated contest for div 2 XD

How many problems in Round #464 ?

I think 5.

If it is 5,generally saw that div2 C problem is solve more than 1000. if it is more than 5,C is solve besides 1000.

if someone will become div. 1 in this round .. Is (Educational Codeforces Round 38) will become unrated for him ?

UPD: Sorry i didn't see that Hack is opened 12 hours only in this round xD

No, because hack period for this educational is only 12h length so the rating will be updated until the cf 464 will start

yeah , i didn't see that xD .. Thanks

Hey, your expectation was justified!

Participiant MiteshAgrawal became Div.1 on Educational

Codeforces Round 38 (rated for Div. 2)and got +139 onCodeforces Round #464 (Div. 2).Here is the link to standings: click.

"Just take advantage of bug :v"

Oh, there is also somebody who became Div.1 on

Educational Codeforces Round 38 (rated for Div. 2)and fell to Div. 2 onCodeforces Round #464 (Div. 2).Look!.

sadly even I did.

It is rated for Div.2.4 days 4 amazing rated contests!!

NO

It is rated for Div. 2. XD

Will the scoring distribution be announced soon?

Look at the first line of the announcement — It should be "Hi, Codeforces". I'm afraid that the author should be a litle more careful.

He forget to thank KAN for preparing the contest either :)

the "He" you are referring to is KAN XD

Yeah, it's only a joke

i Understood bro, just pulling your leg XD XD!

Can you please extend time for half an hour.

Perfect time for Chinese users!

But it could be better! ---- I'm having dinner during this time.

It is very good to have a contest when I am working, not sleeping!

Finally a contest when I'm not working :)

Back to back contests. Passed a great weekend.

What a pitty! I hava to have dinner when the contest starting.

4 days 4 rated contests for div.2... perfect ending of

valentine's week...xDWhen will be the rating updated for "Codeforces Educational round#38"???

probably till the start of next contest i.e #464

Probably it is the first time for Div-2 users when their ratings will be updated twice a day.

But in December ratings of Educational round 35 updated at the same time with Goodbye 2017.

This because the Goodbye 2018 is held for two division (div1 + div2 combine). However, this contest is only for div 2.

to newbieeeeeee

Could you please update the information about the number of problems and their scoring distribution?

Seldom to see so friendly a round time for East Asia and Southeast Asia participants!

How many problems are there in this round?

For technical reasons, system testing of Educational Codeforces Round 38 (рейтинговый для Див. 2) is delayed until the end of this round. After the round, the following sequence of events will happen: system testing of Round #464, system testing of Educational Round #38, rating updates for the Educational Round, rating updates for Round #464, in that order. Ratings for Round #464 will be updated for participants who were in div. 2 prior to the Educational Round.

So rating updates for Round #464 will be ready by tomorrow???

For problem A, do A,B,C need to be distince planes?

it doesn't matter because f[i]!=i

When local time in the 1-st timezone is 1 hour, local time in the i-th timezone is i hours.How

3 hours (in first timezone) is equal to 1 hour (in the second timezone) and 2 hours (in the third timezone)?Please ask questions with "ask a question' button on the page with problem list.

I wasn't aware of that.

Did someone notice? They added the feature to copy the sample test cases of a problem. Thank you Codefroces, keep going!

a bit buggy, but still very wonderful feature

How to solve E?

Ternary Search!

My solution is this:

It's easy to prove that we will always pick the max element in the sequence, and then we can ternary search for which prefix should we use.

Hope I won't FST. (UPD: AC in system test)

It can be done faster: notice that if we pick new max element, amount of elements in answer can't decrease, so we can use 2-pointer algorithm

Great idea, I didn't found that in the contest, lol.

Why ternary? I'm fine with binary search:)

My implementation is doing binary search on the slope.

However, I am used to call it ternary search because I'm ternary search on the value.

How can we update prefix' sum fast?

Things are given in non decreasing way, so we can simply maintain prefix' sum like this:

Is n the size of multiset?

yes(maybe size of multiset+1), my bad

Omg, dude. I've just looked through the statement and noticed that:

1 — Add a positive integer to S, the newly added integer is not less than ANY number in it.

During a contest I thought that the newly added integer is not less than minimum number in it.......

Now I understood how easy the problem is :(((

I don't see why it's true that we always pick the max element. Also why is there only a single peak for the prefixes?

I figured out why there must be one peak. But still don't see how it's always optimal to pick the overall max.

Let’s assume that we have an optimal choice, where max element is

m_{1}and sum of other elements isS.So we can conclude that (

Mis the max element in the original set)nm_{1}-S+m_{1}≥nM-S+Mm_{1}(n+ 1) ≥M(n+ 1)m_{1}≥MWe know that nothing could greater than

M, som_{1}must beMI still don't see it. For

m_{1}it's possible that the optimal choices forSandnare different from the optimal choices forM. (so we can't assume that theSandnon the left side are the same as theSandnon the right)m_{1},Sandnis optimal, so any subset won’t greater than it.Then, I simply replacem_{1}withMtrying to get another subset, but we can prove that it’s the same subset containingm_{1}Understand it now, thanks!

You needn't use binary search or ternary search. You can first choose the biggest number, and then choose some small numbers to make the average value as small as possible. If you use C++, you can use priority_queue. (upd. AC in system test)

Thanks , your solution was helpful . pity that i missed the trick during contest

You don't need a priority_queue, too. You can just use an pointer pointing the last element you choose. (This one)

How to solve F?

Wondering too.

Just a DP with segment tree is ok.

dp_{i, j}stands for the minimum times of flipping, if the face now is cookedjseconds at the end of intervali(i.e.r_{i}).It's obvious that we don't need to flip more than two times in an interval. So just consider how long every face get fried, this yields a Θ (

n^{2}·k) dp.Notice that the points that a state affects is always an interval, so we can use a segment tree with interval-minimum modify and single-point query(or single-point modify and interval-minimum query).

This yields a solution, which suits the time limit. (Actually it runs very fast, because there are lots of useless states in the dp, ignoring these can make this solution run in about 200

ms)Hope this will help.

Sorry, what's minimum times meant for? It's time for what?

我怕我英文說得不好，這裡用中文寫一下我的問題：可不可以跟我解釋一下反轉魚的最小時間（也就是DP的意義）是什麼，我的理解他是j，可是這就很奇怪了

Sorry, the time means the number of operations. (I don't know a better explanation) It doesn't mean the time when you flip it.

我怕我英文說的不好，這裡用中文回答一下你的問題：DP的意義是翻轉魚的最小次數，不是時間。英語中time做不可數名詞的時候是時間，可數的時候是次數（可能還有其他用法）。j是當前被烤的那一面，被烤的時間。dp就是說，考慮了前i個區間，被烤的那一面烤了j秒，所需要的最小翻轉次數。

Oh!!!! Great Thanks.

My English is so poor, I didn't notice the 's' after "time".

Thanks for your wonderful explanation.

An alternative solution:

Still, use dynamic programming, and dp[i][j] stands for stands for the minimum times of flipping, if the face now is cooked j seconds at the end of interval i.

It's easy to get dp[i][j] = min(dp[i — 1][j — r[i] + r[i — 1]], min(all elements within dp[i — 1][(j — r[i] + r[i — 1]) ... (j — l[i] + r[i — 1])]) + 2, min(all elements within dp[i — 1][(r[i — 1] — j)...(r[i — 1] + r[i] — l[i] — j)]) + 1).

Notice that: 1. dp[i — 1][(j — r[i] + r[i — 1]) ... (j — l[i] + r[i — 1])] is an interval. 2. As long as j0 < j1, (j0 — r[i] + r[i — 1]) <= (j1 — r[i] + r[i — 1]) and (j0 — l[i] + r[i — 1]) <= (j1 — l[i] + r[i — 1]) (Either of the terminals of the interval 0 is on the left of the corresponding terminal of the interval 1).

So it's not hard to see that two pointers + deque trick can be used to optimalize this algorithm.

More detailed: 35414333

Try to use the fact that in each l[i] to r[i],whatever possible can be achieved with atmost two flips. So use seg tree(or sparse table or multiset) to update dp values of each level based on previous level,

Now we need to find what all states contribute to i using len length segment we can get from i+len%2,i-len%2,i+2+len%2,i-2-len%2, and so on till within limits. So segment tree on odd and even positions should be maintained.

My solution took 2500ms but some solutions took 61ms. So I believe some other nice way exist.Can someone explain???

you can update the dp in O(N) using a deque,so it becomes O(N * K)

Yeah.Nice So was that the optimisation that gives 61ms??

i think so,mine runs in 31ms

Hope that I handle the output criteria of C more careful. Half an hour wasted with 4 wrong submissions because of the mistake.

Anyway, the problems and pretests are good. Thanks :D

P/s: Is problem E solvable with a greedy approach and two (but technically one)-pointer(s)?

I have written such solution in E and it have passed pretests

Same with mine. However I feel quite uncertain — like

Is it that easy, or there is a trap, or it was just me thinking that the problem is easy?.I am quite confident that it is a solution, even if mine will fail sys.tests, cause I am bad at coding without bugs :D

Well just give yourself a faith. Good luck. ;)

Yeah I wrote such a solution and it passed system tests. There is a proof sort of for it.

Can you elaborate the proof? ;)

Yeah. Initially when you consider adding all occurrences of a number and you find the difference between the current and the previous one, and if it is positive then you can take that number into account.

Consider n/sum — (n+occ*ai)/(sum+occ)

If difference is -ve you can stop.It is beacuse:

a/b<(a+occ*x)/(b+occ) for all x>1

Hence the greedy approach works.

It's clear enough ;) also by reading this I know that my thought during contest time was equivalent ;)

Thanks! :D

Was F just dp but instead of having an O(n) transition you change it to O(1) by choosing whether or not to flip at some time (if valid) and return the number of seconds one side is cooked for (and then keep the minimum number of moves in a different dp table)?

What's pretest 5 in problem C, if someone was stuck there?

I think pretest 5 involved the wraparound condition. Where people of last x timezones and first f-s-x timezones participated Edit: f-s-x, not s-f-x

I think is something like that:

Input: 3 3 1 5 1 3

Output: 2

gotcha !

no chances for problem hack a and b...."pretty straightforward"

showoff

Any idea what was the pretest 5 in C??

http://codeforces.com/blog/entry/57819?#comment-414901

Thanks :)

Our comments have 2 minutes time difference xD

I solved E literally 2 seconds after the contest got over :(

I hope it doesn't get accepted when I submit later.

I solved that 5 minutes after the contest lol

Don't feel upset if it gets accepted, though. Whether or not we are able to solve a problem is more important than "the ratings we could've gotten," in my opinion.

When I realize that only one digit '1' needed to be changed to '0' in the code to get AC...

problem E would have been a much better problem had the numbers been not in increasing order.

How to solve it? Use some Data Structure to maintain it?

The only way I can think of is binary search +segment tree

Maybe some kinda ternary search tree?

binary search and Prefix And，I thinnk (前缀和加二分） (倍增法也可以）

There are data structures which allow you to emulate an array with the possibility of insertion in the middle (complexity changes to O(logn) instead of O(1)). Treaps are an example of such a structure. So the problem wouldn't have changed much. Just had to use a data structure instead of an ordinary array.

whoa, I totally didn't notice that numbers were given in increasing order. I overkilled my solution :')

same :D so during contest I implemented ternary search + segment tree but time wasn't enough :D

Does failing a pretest during the contest affect your rating? I've looked through contest rules etc couldn't see that part discussed.

I don't get exactly what you meant, but this is what I think.

If you haven't submitted any solutions, and then you submitted a "WA/TLE/etc. at pretest X", your rating would start to be affected, since from this point you're set as

reallyparticipated in the contest.If not, then it's similar to any failed submissions — just a minus 50 points of penalty.

Apologies, I see what you mean the question wasn't clear enough.

That makes sense. Is there a difference in the penalty between a "WA/TLE/etc. at pretest X" and failing on system testing? Or are they both just considered a failed submission -50 points?

Thanks for the reply.

Well, technically, they both mean -50. But that penalty is considered only when you managed to have a correct solution after.

And in this case, system test failures are assured to not gaining or decreasing your points at all (since you have no chance to re-submit oficially and get points).

Oh I see! I think this is what I was missing. I thought the penalty was -50 from your overall points for the contest, but it is a penalty on the total points that you can gain from submitting the correct solution for that particular question.

Thanks Akikaze

WA in D(pretest 6). can anyone check whats the problem?? link to my solution of Problem D

Using this test case

your code gives an incorrect answer. I'm not sure what's wrong though.

return dfs(graph[i][j], fd); This line of code gives you the error. You are not considering all the adjacent nodes and just returning the value from the first adj node you visit. Eg. the graph consisits of: (a, b) (a, c) if you search for a c again it would return false as first 'b' is visited in adjacency list of 'a' and thus it returns false

Light-speed System test. Amazing!!!!

what could have been the pretest 4 for problem C?

I failed on that one too (several times). From my observations, it's the first test with s>1

Before the announcement on B, I submitted B and locked it.

For any case where we can not take any box, I printed -1 0 because I have no idea what to print in such case as the question is unclear.

But my solution failed in System Test.

This should be got AC because, at first the statement was not clear.

Your solution probably failed somewhere else. My code also printed 1 0 in case of using no box and I have got an AC.

My solution printed

-1 0Printed a random number too.Luckily got hacked after which i noticed that it should be a valid index 1<=i<=n .

I think that was clear even without the announcement. It's technically not different from any other case.

but, what is the meaning of taking zero box of a specific type? nothing logical here before the announcement!

The fastest system testing ever!

For D, was there a better method than finding the edges of the minimum spanning forest of the graph?

You can find the connected components of the letters. In each component, all letters have to become the same. So a single DFS or BFS is enough

Oh! That's clever. Thanks!

dsu p[26]

Worst pretest ever!!

After how much time of the system testing can we submit the solutions in Practice? Cant now

After 13:30 UTC as mentioned in the update.

Hadnt seen the update. Thanks

How to solve C?

I used a sliding window kind of approach.Passed the pretests but my solution failed on last system test due to silly mistake. It was just because of using

<instead of<=.I also thought of the same solution as you but just couldnt implement it properly :(

What's wrong with my solution of C?

cant see ur sol. post here or give another link.

For N timezones :

1, 2, ... N, and contest length = 4.We may end up with the best answer by letting these timezones participate {N-1, N, 1, 2}

Also, answer should be in range [1, N]

an6285 what's wrong with my approach?

something going wrong in test case 20 in the problem B.

I got WA in test case 20 because I used "%d" instead of "%lld" for long long in scanf() function

When will the contest be available for virtual participation?

After 13:30 UTC as mentioned in the update.

Can anyone prove this? 35412837

What is pretest 13 of problem A?

As its not possible to view the test cases currently did any one else get a runtime error in test case 19 of B? If yes then do you know why?

I managed to hack a few solutions by forcing RE with the following tests:

and

For the first case the typical mistake is that maxValue is initialized to INT_MAX or LONG_MAX instead of LLONG_MAX or the equivalent, which is >=n.

This is my code. http://p.ip.fi/67F5.

It gives an answer of

`1 9313`

on the inputNo run time error though

It should give 1 55.

P.S In your code array a should be long long type

Alright thanks :(

why cant we submit the solutions to the problems now??

is this contest is rated?

Link

System test is finished and still we can't submit ?!

We probably need to wait until yesterday's educational round finishes its testing.

What would happen if a participant with rating above 1900 participates in div2 contest? Does it effect his/her rating ?

No. It won't affect his/her rating.

OK thanks

Can someone please post the questions asked in the Nizhny Novgorod Olympiad, that this contest was based on ?

Problems were same as of Codeforces Round #464 (Div. 2).

It is written that the problems are not identical in the announcement thread.

The problems are in Russian, so it won't work if I just post them. Let's go through problems of Codeforces Round:

nwas 500 000.Thank you so much for your reply !

Can you tell what the easy problem was ?

So why in the Codeforces round, the constraint on

kof problem F was 100, but in the test data it never exceeded 20? I think if it became 100, a lot of solutions will getTLE(but mine will not :P). Can you explain it a little bit? Is it a bug or a feature? Thx a lot.Why will nklogn solutions get TLE? The time_limit is enough for nklogn when k is 100.

but.. I still don't know why my O(nk^2 log32 /64) solution can pass the testcase within 62ms.

But the segment tree runs a little bit slow... Those who runs more than 1

swill likely getTLE, actually there are a lot of them."The round is based on XIV Nizhny Novgorod Olympiad in Informatics for high school students named after V. D. Lelyukh, which will take place on Saturday in Nizhny Novgorod."

Wow, there is an Olympiad for high school students that are all named after V. D. Lelyukh? That's amazing!

What's wrong with my code of problem A?

`if (n==2){ cout<<"NO"<<endl; }`

probably, i printed YES for that case.There have to be "NO", triangle with two elements can't exist

my comment was incorrect.

your solution is right, it works correctly with two elements. And remember that plane can't love himself:)

It's supposed to be NO. I think the mistake is because for the case n=2, the line NO would be printed twice.

Thanks a lot.

3 1 2 2 try this input data

Since the problem states that f_i != i, I don't think that would be a valid test case.

You should return 0 from the if condition after printing NO.

Thanks very much.

Feeling sad my C failed on the last System test :( By the way nice contest.

It's 13:45 UTC now and we still can't submit solutions.

My B is hacked :( ...

can anyone give me some test case...

Is

`99999999999`

sufficient?Edit:

N= 10^{18},K= 1,a_{1}= 4756234141534.oh shit....

Apparently the succesful hacks have not been added to the final system tests. What is the reason for this?

Hacks are only added to final system tests in Educational Rounds.

Enable upsolving please!

Why is the right answer 4 in fourth C test? 10 7171 2280 6982 9126 9490 2598 569 6744 5754 1855 7 9 If we begin round at 4, only participants from 4, 5 and 7 time zones take part in it, and if we begin round at 10, participants from 1, 8 and 9 time zones take part, so in first case we have 9126+9490+569=19185 participants, and in second case 7171+6744+5754=19669 participants. ???

The time zones which has time

fwill not participate. It's said in the problem statement.But I consider it. In first case 6th zone has

ftime, and in second one 10th zone has it.So why does time zone 7 take part in it in the first case? !

The round start at 10 and finish at 1. It starts later than 7, finish earlier than 9 and it doesn't start at 9. What's wrong?

For E Can we pick max and min element get their average and then pick all less elements than Average?

I don't think so. As you add more small elements the overall average decreases. At a certain point adding new elements will start to increase the average, even if it's less than the original average.

I solved it using this idea but changing the average as I insert the elements... This way is very simple and doesn't need ternary/binary search.

Take a look: my submission

We always use the max and a prefix of the elements, and this prefix always increases, so it's very easy.

thnx,your idea is very well!!

When will the ratings be updated?

I have a tremendous fear of kidney stones. Why on earth have you chosen such a handle, may I ask??

Because I actually have them in my kidney.

Well, I don't understand why you would "love" them, but hope you stay safe!

How to solve C?Anyone please explain .

Let's find the max sum on each segment with the size of (f-s). First segment will be s...f-1, second s-1...f-2.

Ok. But there is 1 detail: the beginning of the segment can be in the end of our array and the end of it can be in the beginning of our array.

I hope my code'll help you to deal with it

`10`

`7171 2280 6982 9126 9490 2598 569 6744 5754 1855`

`7 9`

Why here answer is 4? Please explain :)What is the correct answer you think?

This problem can be solved in O(n). Initialize an array with value 0 of size n. Consider 1st timeline as the starting point and can be represented as 1 2 3 4 ... n. While, 2nd timezone can be represented as 2 3 4 ... n 1 (wrt to 1st timezone) and so on... Replace the indices with the participants. And then do an array addition from s to f-1 for each timezone in the initial array. The index corresponding to max value is the answer.

Before this round my rating in div 2 But after by education round my rating was 1954. Is calculate my rating this round?

Oh no. Now my rating 1816 :(

I think rating has been updated without considering performance of educational round. This should be fixed.

In problem C, why this test case is 4 and not 5

Because （9126 + 9490） is maximum

Explain,he knows that is maximum.

I think he can understand

Thank you brother :) got it properly . But when there are many answers,how do i select the best? Upd : Solved

Congratulations, I believe you can do better next time contests.

I'm blessed !

Obviously the maximum is 9126+9490. So we want the contest to start at 7 hours in the region with 9126 to cover the two. Now we need to find at what hour it will start in the first timezone.

In 8th hour,answer is being maximum which is 5 in timezone.So,why the answer is 4 ?

If we start when it is 5 in the first zone, we will actually get 9490 + 2598 which is not maximum. Because in the zone with 9126 it will be only 6 hours the time which is too early to participate (<s)

Some people who became div-1 in the Educational round was rated in this round. If you go to the rating changes of this round you can see some purple guys got their rating updated which shouldn't happen as this round is for div-2. This should be fixed.

List:

MysteryGuy2, RCG, Timsel, WORLD_OF_TANKS, winner, andrew, faustaadp, furys, Chefer, levapnilirbuz, smusmu, killer_god, Trote_w, hands_yhy, Sugardorj, Gorix, win11905, kzyKT

35423572 can someone debug this solution for problem C?

EDIT : My approach for the problem: I made the array of twice the size so that round or wrapping condition for the end & beginning timezones is considered. I calculated prefix sum for 2*n +1 size array. Then, I searched for maximum diffrence of (a[i+f-s-1] — a[i]). Then calculated corresponding value for the time in the first time zone.

ayu111, I had this exact problem. In case there are multiple subarrays with same (max)answer, you have to output the one which leads to minimum start time in timezone 1.

For everyone failing on Pretest 9 of problem C, Try this: 6 1 3 4 1 3 4 1 3 correct ans : 3 your ans : 6

More than 20 Candid Master have there rating change in this Div 2 round.This should be fixed.

MikeMirzayanov

KAN has mentioned it in his comment here : http://codeforces.com/blog/entry/57819?#comment-414872 . He said those who

were in div. 2 prior to the Educational Roundwill be considered as div. 2 and has rating changes.Can someone tell me, what's wrong with my approach in C?

I used range updates to add a[i] to (s + i — 1 , p — 3 + i), and then checked the maximum.

Here's my code.

The only thing you needed was to find the segment with max sum in.

First segment is [s,f). Second — [s-1,f-1); If segment number two has the max sum, answer is two. If segment 3 has the max sum, answer is three, and so on.

Look through my solution. At least it looks easier than yours ;)

In problem A, why starting the loop from 0 instead of 1 gives a wrong answer !?

If you start from 0 you should read a[i] and then decrease it (a[i]--).

yeah I know, but I don't understand why what's the difference

"There are n planes on Earth,

numbered from 1 to n, and the plane with number i likes the plane with number fi," Here's the sample:3

3 1 2

You consider that person number 0 likes person number 3. But if you start from 0 there is no person #3. (a[0],a[1],a[2])

Can somebody explain what's wrong with my solution of C? 35398638

Will never use cin and cout in my life again! Problem E. :/

std::ios::sync_with_stdio(false)

Do you add this?

When the universe just sided with you..

？？What is the difference between Educational Codeforces Round and Codeforces Round?

I always thought Educational Codeforces Round wouldn't change the rating......

so after Educational Codeforces Round24 i didn't take part in it any more

It used to be unrated. But now it is rated for div2 users.

thnx

Suddenly became frozen when I realized my E got WA just because of the precision problem:

35399314

UPD: get accepted after adding "fixed" and "setprecision(10)" : 35434902

That's why I always write

`cin.precision(25);`

in any task with floating numbers.What's the wrong with problem F? The problem statement shows the maximum

kis 100 that I think the algorithm can't solve this problem, but among all the testdata the maximumkis 20.There are many cheat passed D

Excuse me , but where is the tutorial of Codeforces Round #464 Div.2 ? Can someone give me a link?

What is wrong with my solution (Problem C)?

Answer is: http://codeforces.com/blog/entry/57819?#comment-415133.

Where is the editorial? I look forward to getting the solution of problem E

I think you can understand the other people's code. There are many ways to solve the problem.

Thank you.Just now I thought out a way to solve it.

Yeah,there is already 24 hours and we still can't find any editorial.

Maybe they have something urgent to do ⁄(⁄ ⁄•⁄ω⁄•⁄ ⁄)⁄

━━∑(￣□￣*|||━━

Why does problem 939E - Maximize! have to give numbers in non-decreasing order? This makes it much easier than usual.

I didn't see this phrase so decided not try to solve this in 20 minutes before ending :P

i am not used to

EandDtasks easier (in some way) thanC...i think so

Excuse me but editorial?

editorial please?

24 hours passed,but we still don't have the editorial.

Editorial ?

may be editorial?

Editorial?

Editorial please?