### Tlatoani's blog

By Tlatoani, 2 years ago,

Hi!

On Aug/16/2020 17:35 (Moscow time) we will host Codeforces Global Round 10.

This is the fourth round of a 2020 series of Codeforces Global Rounds. The rounds are open and rated for everybody.

The prizes for this round are as follows:

• The top 30 participants get a t-shirt.
• 20 t-shirts are randomly distributed among those with ranks between 31 and 500, inclusive.

The prizes for the 6-round series in 2020 are as follows:

• In each round, the top 100 participants get points according to this table.
• The final result for each participant is equal to the sum of the points they got in the four rounds where they placed the highest.
• The top 30 participants over all series get sweatshirts and place certificates.

Thanks to XTX for supporting the global rounds initiative in 2020!

The problems in this round were prepared by KLPP, zscoder, qlf9, golions, MagentaCobra, and me. We would like to give a huge thanks to the following people:

We had a lot of testers as the problemset of the round changed significantly throughout testing! As a result of the huge amount of feedback, we think that we've managed to make the round really high quality and hope that you'll enjoy it :)

You will be given 3 hours to solve 9 problems. The score distribution will be announced at some point in time before the contest starts. Good luck!

UPD: Score distribution:

500 — 750 — 1000 — 1500 — 2000 — 2500 — 3000 — 3500 — 4000

UPD: Editorial

UPD: System tests have finished. We hope you liked the problems! We apologize for the weak pretests on A and B — that was a major oversight on our part. Hopefully you were still able to enjoy the contest regardless :)

Congratulations to the winners!

Announcement of Codeforces Global Round 10

• +1170

 » 2 years ago, # |   0 Auto comment: topic has been updated by Tlatoani (previous revision, new revision, compare).
 » 2 years ago, # |   +88
•  » » 2 years ago, # ^ |   +4 Cute anime girls solving cute problems
 » 2 years ago, # |   +132 As a problem writer, I really hope this round is truly rated for everybody
•  » » 2 years ago, # ^ |   -39 it will be unrated ofc it's 3 hours long, so it's very likely that something wrong will happen
 » 2 years ago, # |   +368 I tested this against my will. I demand financial compensation.
•  » » 2 years ago, # ^ |   +304 I wrote this contest against my will. I demand therapy sessions paid for by antontrygubO_o
•  » » 2 years ago, # ^ | ← Rev. 3 →   +112 +1.I demand my pending 2 cf t-shirts. I'm waiting for them for the last 3-6 months. SpoilerTesters and problem setters of https://codeforces.com/blog/entry/79745 are a subset of this round's setters and testers.Notorious Coincidence indeed.Still waiting for this random top 500 T-shirt.
•  » » » 2 years ago, # ^ |   -12 one question comes to my mind everytime I see these waiting memes: Who the hell steals clothes from the dead body and leave it naked??
•  » » » » 2 years ago, # ^ |   +3 The world is very bad outside, be inside and save your clothes as well :P
•  » » » » 2 years ago, # ^ |   -12 MAY that dead body would have weared codeforces global round winners Tshirt..
•  » » » 2 years ago, # ^ |   +18 'Notorious coincidence indeed'are you trying to say that the problems are going to be stolen from round 655? o_O
•  » » » 22 months ago, # ^ |   +8 You don't have dick?
•  » » » » 20 months ago, # ^ |   0 -1 for the name
 » 2 years ago, # |   +164 As a tester, I regretted that I can't participate this as an official contest...! The tasks are very interesting, glhf!
•  » » 2 years ago, # ^ |   -34
•  » » 2 years ago, # ^ |   -8 Yes the problems were very interesting.
•  » » 2 years ago, # ^ |   -8 Yes, Best round of CF's history, i really enjoyed it. Thank You CF !! CF should put such rounds every week.
 » 2 years ago, # |   +73 As a tester, i like the contest.
 » 2 years ago, # |   +230 As a tester, I tested it when it was a div.2 :))
•  » » 2 years ago, # ^ |   +198 As a tester, Me too :((
•  » » 2 years ago, # ^ |   +161 As a tester, me three.
 » 2 years ago, # |   +8 Is there any specific reason to give a 3 hour contest as it rarely happens :P
•  » » 2 years ago, # ^ | ← Rev. 2 →   -23 Usually a div 2 contest has 6 problems and is for 2 hours, a ratio of 1/3 hours per problem. This one has 9 problems, therefore to maintain the 1/3 hours per problem ratio, contest needs to be 3 hours long.
•  » » » 2 years ago, # ^ |   +17 What us div2 people going to do for the rest of 2 hours watch the standings :XD
•  » » » » 2 years ago, # ^ |   +34 Celebrate pretests passed before we face the wrath of Wrong answer on test 11
 » 2 years ago, # |   +25 You are missing unrated tester :D
 » 2 years ago, # |   -78 is it rated?
 » 2 years ago, # |   +113 As a writer, I recommend you to read all problems :)
•  » » 2 years ago, # ^ |   +144 last time I read such comment from writer/tester, I lost 170+ rating :)
•  » » » 2 years ago, # ^ |   +40 last time I read such comment from writer/tester, I gained 132+ rating :)
 » 2 years ago, # |   +6 Goodjob!
 » 2 years ago, # |   0 How many did he reject XD ?
 » 2 years ago, # |   +20 Colorful testers!
 » 2 years ago, # |   +8 So many testers?!!
•  » » 2 years ago, # ^ |   +271 You mean hostages
•  » » » 2 years ago, # ^ |   +8 Really? I think being a tester is a great feeling!
•  » » » » 2 years ago, # ^ |   +129 Many of us tested because it was div2. Then it became a global round, so we lost the opportunity to participate in a rated contest.
•  » » » 2 years ago, # ^ |   +75 At that time, we tested only 4 current problems and now we can't participate rated.
 » 2 years ago, # |   +121 (-__-)
•  » » 2 years ago, # ^ |   +11 Just approach any problem writer,too simple!
•  » » » 2 years ago, # ^ |   +11 Really?? You got the testing opportunity by approaching the problem setters?? Also, how will I know who's gonna host a contest in the coming months? What did you do? How did you know they'll be hosting a round?
•  » » 2 years ago, # ^ |   +17 I would say that you have to know some of the problem setters to have a chance of being invited , since there's a lot of information that has to be kept confidential.
 » 2 years ago, # |   +85 [Your text to link here...](from Imgflip Meme Generator)
 » 2 years ago, # |   +27 As a tester i would like to say that the problems are really interesting and you all should enjoy participating in this!!!
•  » » 2 years ago, # ^ |   +20 I was thinking about skipping this round as I have an exam the day after this round but your comment made me ignore the idea :D
 » 2 years ago, # | ← Rev. 2 →   +4 We seen many specialist testers in the last few contests and now, we got a newbie too.
 » 2 years ago, # |   +2 Nice to see authors from all round the world tester from all colors.
•  » » 2 years ago, # ^ |   +18 Global round indeed
 » 2 years ago, # |   0 9 problems
 » 2 years ago, # | ← Rev. 2 →   +19 Do longer contests cause bigger rating changes (on average)? It would make sense to me that in a 3 hours contest rating changes 1.5 times as much as in a 2 hours contest.
•  » » 2 years ago, # ^ |   +143 How high were you when you wrote this?
•  » » 2 years ago, # ^ |   -16 The average rating change after every contest should be theoretically zero.In reality, recently the average rating changes have been a small negative value. If you want to check the average rating change of any contest,use this codeCode Author : farmersrice
•  » » » 2 years ago, # ^ |   +36 The fact that the rating change should be close to zero has nothing to do with what Round_Dice said
•  » » » 2 years ago, # ^ |   +46 Variance vs expected value.
•  » » » » 2 years ago, # ^ |   +14 Yeah, variance or standard deviation makes more sense. What I meant when I wrote it: Average of the absolute values of individual rating changes, which is called average/mean absolute deviation.
 » 2 years ago, # |   +45 The writers picking people to test their round:
•  » » 2 years ago, # ^ |   -16 Still couldn't make strong pretests for A,B
 » 2 years ago, # | ← Rev. 2 →   +6 Really happy to see so many testers. Especially because there is so much variation in the colors: All colors from grey to black-red are there among the testers <3.
 » 2 years ago, # |   +7 9 Problems with 3 hours?? Awesome
 » 2 years ago, # | ← Rev. 2 →   +36 I still get flashbacks from global round 9
 » 2 years ago, # |   +206 what is the point of tourist, Benq and their gang getting CF t-shirts every global round? these guys must be using CF t-shirts as wipers.
•  » » 2 years ago, # ^ |   +191 Hey, I understand that you want to make a point, but don't you think tagging them is unnecessary? I believe noone likes to be tagged just to see themself being joked about by random people.
•  » » » 2 years ago, # ^ |   +72 Sexpert hi
•  » » » 2 years ago, # ^ | ← Rev. 2 →   +16 Sexpert hi Spoilerorz
•  » » » » 2 years ago, # ^ |   +186 Guys, please don't tag Sexpert unnecessarily.
•  » » » » » 2 years ago, # ^ |   -7 Oh trust me, Ari would not be mad at me because I tagged unnecessarily and said orz.
•  » » » » » 2 years ago, # ^ |   +91 Why are you tagging Sexpert though
•  » » » » » » 2 years ago, # ^ |   0 Looks nice maybe
•  » » » » » 2 years ago, # ^ |   +5 Guys seriously stop tagging Sexpert.
•  » » » 2 years ago, # ^ |   +29 Fair point. I did not think about it. Usually I use handles to make my comment colorful
•  » » » » 2 years ago, # ^ | ← Rev. 2 →   +25 Alternatively to make your comment colourful, you can use css inline styling by using any html tag like, span.
•  » » 2 years ago, # ^ |   +151 I didn't win a t-shirt last time ...
•  » » » 2 years ago, # ^ |   +2 I wonder how many t-shirts programmers like you have.
•  » » » 2 years ago, # ^ | ← Rev. 2 →   +5 No problem. Even those who won don't get a T-shirt. click
•  » » » 2 years ago, # ^ |   +17 As someone who frequently ends up in the top 30 places, do you think it makes more sense to distribute the t-shirts to top 30 participants who have not received CF t-shirts before? This way will get many more participants excited about the global round. First time receiving CF t-shirt, you will get excited, the second time hmmm maybe a bit, the third time I am sure you would not even track the cargo.
•  » » 2 years ago, # ^ |   0 well maybe if they actually receive the t-shirts... I'm starting to wonder whether these CF t-shirts are actually real
•  » » 2 years ago, # ^ |   0 Personally, I do so with mine, not from cf though.
 » 2 years ago, # |   -58
 » 2 years ago, # |   +232
•  » » 2 years ago, # ^ |   +3 Literally me this round :( CF-Predictor predicted that I would lose 98 rating.
 » 2 years ago, # |   -40 As a participant give me contribution.Thanks for downvotes :)
 » 2 years ago, # |   -41 Will this be rated for div-2?
•  » » 2 years ago, # ^ |   +1 Global rounds are rated for every division. Read the announcement carefully. It says "The rounds are open and rated for everybody."
 » 2 years ago, # |   +36 question for administrators. are there any team contests planned in the near future, its so funny and interesting when you and your team can sit and solve problems in sports programming
 » 2 years ago, # |   -12 BEST WISHES EVERYONE ...!
•  » » 2 years ago, # ^ |   +34 oh hi kira
•  » » » 2 years ago, # ^ |   +28 hi
•  » » » 2 years ago, # ^ |   +32 oh shit...!!!
•  » » » » 2 years ago, # ^ |   +30 got you. ;-)
•  » » » » » 2 years ago, # ^ |   0 Nice one both of you. Ohh sorry Mohsin only.
 » 2 years ago, # | ← Rev. 2 →   -36 f
•  » » 2 years ago, # ^ |   +4 Depends on your performance
 » 2 years ago, # |   -16 Why the next contest is after 9 days?
 » 2 years ago, # |   +100 God damn it if it was 8 problems and 2 hours I would've made a joke about Barcelona
•  » » 2 years ago, # ^ |   +25 We are done with that shit. #BARTOMEU_OUT
 » 2 years ago, # |   +7 I like this contest ,because we have high competition in this,and problems are found to be so much interesting in global rounds.
 » 2 years ago, # |   +9 I hope that difference between the difficulty of two consecutive task (especially D and E) will be at most 400!
 » 2 years ago, # |   -40 I am new to codeforces. Please let me know if this contest is rated?
•  » » 2 years ago, # ^ |   +17 I think u have the ability to read the announcement carefully!
 » 2 years ago, # |   +4 Looks like antontrygubO_o is famous for rejecting problems.
 » 2 years ago, # |   +2 Nine days without contest ... FeelsSadMan
•  » » 2 years ago, # ^ | ← Rev. 2 →   -20 There's usually a Div. 3 contest between long waits, lets hope it gets added later
 » 2 years ago, # | ← Rev. 5 →   +1 .
•  » » 2 years ago, # ^ | ← Rev. 2 →   -21 As someone who had 0 involvement in the making of this round, I also guarantee this contest is great!
•  » » » 2 years ago, # ^ | ← Rev. 3 →   0 .
 » 2 years ago, # | ← Rev. 2 →   -48 .
 » 2 years ago, # |   +28 ![ ]()
•  » » 2 years ago, # ^ |   +29 You should come visit us in div1.
•  » » » 2 years ago, # ^ |   +11 Definitely, I will!
 » 2 years ago, # |   +3 Till now I am bearing the damages of two global rounds.
 » 2 years ago, # |   +4 When will be the 2nd Div-4 contest?
•  » » 2 years ago, # ^ |   +38 When mike need to have some load test of server.
 » 2 years ago, # | ← Rev. 2 →   -37 :)
 » 2 years ago, # |   +6 Blog posts of non-educational rounds before the contest begins -> 150+ comments, many memes.Blog posts of educational rounds before the contest begins -> 20-30 comments, hardly any memes.Why does CF community like to comment and post memes more on non-educational rounds? Number of contestants are similar in both round types. I was just wondering.
•  » » 2 years ago, # ^ |   0 maybe general people like me are afraid of the name "education" :D
•  » » 2 years ago, # ^ |   +23 Educational rounds has traditional copy pasted announcement and same author,co-ordinator,testers. Non-educational different author, testers and sometimes different style of writing announcement. Memes and most of the comments are based on this writing styles, no of tester, color of tester, what happened on author's previous rounds ,wish and expectation from new author and so on
 » 2 years ago, # |   0 Guess that "Rainbow Dash" thingie from round #662 had its effect on the testers.
 » 2 years ago, # |   -18 Will this harder than facebook hackercup 2020 round 1? Cause hackercup for me is hard af :(( and may i get a T shirt for free :> user desire :<<
 » 2 years ago, # |   +18 meme...
 » 2 years ago, # |   -29
 » 2 years ago, # |   +2 No more "Read all the statements" message ? :))
 » 2 years ago, # |   +3 9 problems! Rated for all! It would be great if it was told at which problem Div2 coders should stop, and start seeing leaderboard for rest of the contest.
•  » » 2 years ago, # ^ |   0 It's not really easy to determine. In Div2 rounds there are many different categories of Div2 participants — beginners, intermediate, upper-intermediate, advanced, etc. Beginners may solve B or C, intermediate may solve D, upper-intermediate may solve E, etc. Not all Div2 participants are same. :)Read all the statements, have fun and try to solve as much as possible! At least you'll meet some new concepts. :)
 » 2 years ago, # |   -17 Hope it won't be a QueueForces or ThinkForces
 » 2 years ago, # |   0 Newbie and Pupil testers give me hope
 » 2 years ago, # | ← Rev. 2 →   0
 » 2 years ago, # |   +13 All the best everyone for the round :)
 » 2 years ago, # |   +7 queue forces
 » 2 years ago, # |   -25 long queue?
 » 2 years ago, # | ← Rev. 2 →   -28 Great questions and thank god the queue was not too long. Any help for D?
 » 2 years ago, # |   -27 3 hours for this long queue?
 » 2 years ago, # |   -27 tourist on fire !! Solved 4 out of 5 questions first till now.
•  » » 2 years ago, # ^ |   -21 he solved ABC in 3 minutes damn.
•  » » 2 years ago, # ^ |   0 why downvotes ?
•  » » » 2 years ago, # ^ |   0
•  » » » » 2 years ago, # ^ |   0 F, sorry
 » 2 years ago, # |   -44 Another Unrated Round I guess !! Long Queues ... feeling sad.
•  » » 2 years ago, # ^ |   -8 Don't worry Lord Omkar will Give you Power to defeat all your Worries !
 » 2 years ago, # |   -6 Wow. What an excellent contest guys. Well prepared, interesting problem statements, you guys nailed it on this one!!
 » 2 years ago, # |   0 Incredible contest, this is the first time I solved 4 in 1h30m, the problems are so good that you feel amazing after solving it.
 » 2 years ago, # |   +24 Really Bad Pretests :(
 » 2 years ago, # |   -7 Yay! I managed to solve only B! Maybe I should stop competing for a while.
 » 2 years ago, # |   +9 Pretest kinda suck ngl
 » 2 years ago, # | ← Rev. 3 →   +96 36 testers and 900 hacks
•  » » 2 years ago, # ^ |   -19 I don't know why people complain about this every time.It's not against the rules that pretests are weak. It might be a questionable choice by the authors but it is not automatically a sign of shitty preparation.
•  » » » 2 years ago, # ^ |   +105 It is a very questionable choice on combined rounds. The top standings being determined by who hacked the most div 2 contestants is pretty dumb :/
•  » » » » 2 years ago, # ^ |   +27 IMO the existence of combined rounds is a very questionable choice :P
•  » » » » 2 years ago, # ^ |   -48 I think hacks should not give extra points.
•  » » » 2 years ago, # ^ |   -23 It seems strange to me that some participants in top-100 can get extra 200-400 points by hacking grey or green guys. At least it adds some randomness to the competition.
•  » » 2 years ago, # ^ | ← Rev. 4 →   +18 My solution to B in testing would've been hacked. Just because there are a lot of testers doesn't necessarily mean that authors use all of their solutions to check if tests are strong. I don't know why wasn't $t \leq 10^4$ which would've allowed random test cases to catch most bugs.Though i did help with test cases by trying to submit an unordered_map and gp_hash_table solution to A which both got AC and later realized that in those solutions didn't clear the hash table after each test case so then pretest 2 in A was changed to break solutions which don't clear the hash table/map after each test case.
 » 2 years ago, # |   +16 Good problem set. How to solve F?
•  » » 2 years ago, # ^ | ← Rev. 2 →   0 Does the solution use parity of heights?
•  » » » 2 years ago, # ^ |   +21 No, just the sum.
 » 2 years ago, # |   +1 Someone has a hint on E?
•  » » 2 years ago, # ^ | ← Rev. 2 →   +27 a[i][j] = 2^(i+j) * (i % 2). You can figure out where to go by checking k & (2^(i+j)).
•  » » » 2 years ago, # ^ |   0 Thanks! That is smart.
•  » » 2 years ago, # ^ |   0 How many bits do you need per diagonal in order to be able to reconstruct the solutions? How can you make sure you get this information?
 » 2 years ago, # |   0 Was D Dp? I tried but was getting the wrong answer on one sample case.SubmissionStates were dp(index, prev_selected, current_selected, next_selected)
•  » » 2 years ago, # ^ |   +3 Just calculated the minimum number of changes to prevent 3 same characters ($LLL$ or $RRR$) in a row. Let's see if it passes the system test.
•  » » » 2 years ago, # ^ |   0 I did the same, tried to prevent the 3 same characters in a row. Hope this will work
•  » » » » 2 years ago, # ^ |   0 Worked like a charm.
•  » » 2 years ago, # ^ |   0 I did with DP, the pretests were passed. I did with 3 DP states, (index,curr,prev). Since I am not storing the next state, I had to specifically check for every possible starting state (as it is cyclic dp). You could check my submission here. 90129512.
•  » » » 2 years ago, # ^ | ← Rev. 2 →   0 I tried the same too with 3D dp). But it failed on the same case. So I tried implementing in 4D, maybe if I am missing some cases. At last, wasted my whole contest time debugging without knowing where I am getting a mistake.
 » 2 years ago, # |   +27 I know I should blame myself. I also know that complaining about this is not good but...How did you make the pretests?
 » 2 years ago, # |   -57 Video Tutorial for D. Omkar and Bed Wars
•  » » 2 years ago, # ^ |   0 :(
•  » » 2 years ago, # ^ |   0 Are you gonna continue doing this for each new contest?
•  » » » 2 years ago, # ^ |   0 Are you gonna continue getting rickrolled for each new contest?
 » 2 years ago, # |   -16 Pretest2 in D is a bi*ch
 » 2 years ago, # |   0 How to solve D?? Any thought process would be appreciated
 » 2 years ago, # |   0 What were the hack tests for A and B?
•  » » 2 years ago, # ^ | ← Rev. 2 →   0 For A181 1 2 2 2 8 16 32
•  » » » 2 years ago, # ^ |   +5 answer please
•  » » » » 2 years ago, # ^ |   0 There is always answer 1 but if all elements of array are same,answer is n(size of array).
•  » » 2 years ago, # ^ |   0 For B 1 1 1 -10000000
•  » » » 2 years ago, # ^ |   0 Why would this test case hack solutions?
•  » » » » 2 years ago, # ^ |   +1 Many people initialize max with $0$.If the input was all-negative then it will break.
•  » » » 2 years ago, # ^ |   0 give k value and answer please..
•  » » » 2 years ago, # ^ | ← Rev. 2 →   0 I initialised max as long_min and still failed test case 23. Nvm. Im stupid. I thought 1e-9 is same as -1e9.
•  » » 2 years ago, # ^ |   +1 B Hacked :(
 » 2 years ago, # |   +9 Very weak pretest of B:90095907I think every number in pretest are greater than 0 and it makes so many hacks...
 » 2 years ago, # |   +7 How do u construct the grid in E ?
•  » » 2 years ago, # ^ | ← Rev. 2 →   +12 From every point, you can reach two new points. Ensure these two points have different values. Use uniquely identifiable values (0,1,2,4,8,16...) for each unique manhattan distance from the start point. You may repeat values, as long as two points touching at a corner don't have the same value.So for example, 0 1 0 4 ... 0 2 0 8 ... 0 4 0 16 ... . . . Essentially at each point in the grid, you can determine the next move (left or down) because each of those two values will be different.
 » 2 years ago, # |   +1 How to solve E?
•  » » 2 years ago, # ^ |   +15 a[i,j] = fib(2*i + j) fib(0) = 1 fib(1) = 2 fib(n) = fib(n — 1) + fib(n — 2)
•  » » » 2 years ago, # ^ |   0 How do you prove that there won't be any paths with the same sum?
 » 2 years ago, # |   +67 Thanks for the not-ultra-strong pretests in the easier problems which left a healthy amount of hacking opportunities.
•  » » 2 years ago, # ^ |   -18 but so many are fu*ed by not-ultra-strong pretests
 » 2 years ago, # |   +6 It Was Amazing
 » 2 years ago, # |   0 Task E: How does this solution get TLE? My complexity 2 * n * q = 50,000 https://codeforces.com/contest/1392/submission/90167797
•  » » 2 years ago, # ^ |   +9 not flushing output
 » 2 years ago, # |   +5 Fantastic round! Lot of variations in the set. Problem E stands out, really enjoyed that one in particular. Thank you authors and testers.By the way, here is problem D on OEIS: https://oeis.org/A007040
•  » » 2 years ago, # ^ |   0 can you explain a bit
•  » » » 2 years ago, # ^ |   0 Calculate the minimum number of changes so that there is no $LLL$ or $RRR$.
•  » » » 2 years ago, # ^ |   0 That's the total number of distinct strings of length n where all the players are acting logically according to Bed Wars strategy.That sequence is the number of (marked) cyclic n-bit binary strings containing no runs of length > 2, so it essentially tells you what to solve here, which can be done with a trivial DP.
 » 2 years ago, # |   +2 Problem C was a repeat. https://codeforces.com/contest/205/problem/B
•  » » 2 years ago, # ^ |   0 Not the same problem, there is no nondereasing condition on the chosen subarray...
•  » » » 2 years ago, # ^ | ← Rev. 2 →   0 Its same. I took a random code and now its accepted for today's C Soluton
•  » » » » 2 years ago, # ^ |   0 Not the same problem, there is no nondecreasing condition on the chosen subarray.The fact that the solution is the same doesn't mean it is the same problem, at least in this case when equivalence isn't obvious.
 » 2 years ago, # |   +10
•  » » 2 years ago, # ^ |   +8 Jebaited (no NTT involved on the problem with 998244353 but FFT is involved in I XD)
 » 2 years ago, # | ← Rev. 2 →   0 Nice round. I just wish there were fewer easy problems. 9 problems (in total) is too many. 7 or 8 next time please.And more geometric scoring, obviously. It's bad that every next problem is worth only ~15% more points.
•  » » 2 years ago, # ^ |   +18 Its rated for every body(global), not only for div1..
•  » » » 2 years ago, # ^ |   +8 Yeah, and div2 participants didn't really touch the hardest problems. If only it was possible to give different problem sets to div1 and div2...
•  » » » » 2 years ago, # ^ |   +3 Understandable, have a nice day
•  » » » » 2 years ago, # ^ | ← Rev. 2 →   -6 .
 » 2 years ago, # |   0 someone please explain problem C
•  » » 2 years ago, # ^ |   0 From i=0 to i=n-2, search for all peak values and find the differences between the peak values and the immediate next value, and then find the sum of those differences.Example: 5 6 7 1 2 3 4 5 1 2 3 5Here, the peak values are in index 2 (7) and index 7 (5). Sum = (7-1) + (5-1)It was quite easy for a C problem. Even I didn't check it out during the contest, thinking my skills wouldn't suffice for a Global Round C problem. Alas! :(
•  » » » 2 years ago, # ^ |   0 What is the logic behind it?
•  » » » » 2 years ago, # ^ |   0 You take the last two segments. If the last is smaller than the prelast we need to add some hight to the last. Repeat for all i.
 » 2 years ago, # | ← Rev. 5 →   +3 For me, problem E has a huge pitfall, and I debugged it for an hour:(1 << (i-1)) is treated as an int rather than a long long(if you want to get long long) , so you need to obtain it by: 1LL << (i-1) // to complete the operation of h = 1<<(i-1)
•  » » 2 years ago, # ^ |   +29 1LL << (i - 1).
•  » » » 2 years ago, # ^ |   0 Thanks a lot, now I get it.
 » 2 years ago, # |   +10 Great contest,problems are so interesting,I solved 4 problems but 6 wrong submission before it.
 » 2 years ago, # |   +45 :)
 » 2 years ago, # |   +3 Fun problems, thanks!What would be the solution to F if the initial array was non-decreasing instead of increasing?
•  » » 2 years ago, # ^ |   +15 I think my solution handles nondecreasing as well: https://codeforces.com/contest/1392/submission/90123388I maintain a stack of positions of "flat" segments.
 » 2 years ago, # |   +10 RIP Newbies :)
 » 2 years ago, # |   +13 Anyone solved E with a non-greedy approach? I think the constraints were chosen carefully to disallow such solutions, but did anyone manage to pass? I'm particularly interested in randomized/backtracking solutions for E. Did anyone solve using that way?
•  » » 2 years ago, # ^ | ← Rev. 2 →   0 I was also trying the same but no luck, got WA and TLE.
 » 2 years ago, # |   -8 Thanks for the interesting problems.
 » 2 years ago, # |   0 Tnx for your fast responsiblity at contest
 » 2 years ago, # |   +10 Thanks for the careful preparation and interesting problems.
 » 2 years ago, # |   0 Seeing how good this was , setters should be paid twice.
 » 2 years ago, # |   -9 Bad pretests. Lots of solutions are getting hacked & wrong answer in main test. :(
 » 2 years ago, # |   +7 A,B,C in like 15 minutes, and turns out all other not even close to a working solution. Not that exciting problem coice from my point of view.
•  » » 2 years ago, # ^ |   0 How to solve c???
•  » » » 2 years ago, # ^ | ← Rev. 2 →   +1 You need to sum $a[i-1]-a[i]$ for all i.
•  » » » » 2 years ago, # ^ |   +3 Correction : if and only a[i] < a[i — 1]
•  » » » » » 2 years ago, # ^ | ← Rev. 3 →   -9 one more correction : i != 0.... :)
•  » » » » 2 years ago, # ^ |   -6 Was C a standard problem?
 » 2 years ago, # |   -76
 » 2 years ago, # |   0 Anyone else feeling the same after getting B hacked or failed at system testing because of initialising maximum as -1. F for me
 » 2 years ago, # |   -19 I am back, whether you were waiting for me or not, but I am here.
 » 2 years ago, # |   0 Really great contest... Appreciating the effort
 » 2 years ago, # |   +5 hello problem setter or admin I don't understand this .when this contest is running then hack my code in B problem (https://codeforces.com/contest/1392/submission/90140478) .But when contest end showing Final standings then i submitted same code then show code is Accepted(https://codeforces.com/contest/1392/submission/90171270)
•  » » 2 years ago, # ^ |   0 I think it's because not all successful hacks become system tests
 » 2 years ago, # |   -9 is it real to solve this problems with python? i had rly big execute time at A and B while it's almost insta launched in my jupyter notebook, any opinions? or u should know c++ ideal to solve contests like this?
•  » » 2 years ago, # ^ |   0 This blog should help you.
 » 2 years ago, # | ← Rev. 2 →   0 Can someone point out my mistake? Thanx in advance. https://codeforces.com/contest/1392/submission/90167944UPD: I got it.
 » 2 years ago, # |   -27 It is unrated ?
 » 2 years ago, # |   0 No rating changes yet? Why so late?
 » 2 years ago, # |   +1 For problem C, once I read the solution, I can understand why it works, but I am not sure how I would have arrived at the solution from scratch. Somebody help me?
•  » » 2 years ago, # ^ |   0 Solutionassume an array like this 8 9 10 , 7 8 9 , 2 3 4 , 1 2 => ans=0non- decreasing sub-arrays are separated by commasnow consider last two sub arrays - increase last sub-array by ans+=(4-1)situation changes like this8 9 10 , 7 8 9 , 2 3 4 4 5 -> array 1again consider last array => ans+=(9-2)8 9 10 , 7 8 9 9 10 11 11 12 -> array 2again consider last array => ans+=(10-7)8 9 10 7+3 8+3 9+3 9+3 10+3 11+3 11+3 12+3 -> array 3resulting array 3 is non decreasingso answer is absolute difference between comma separated element of array 1hoping this solution will help you
 » 2 years ago, # | ← Rev. 3 →   0 Leave it!
•  » » 2 years ago, # ^ |   0 explanationfor every possible k -> (according to your given values of grid)there should be a unique pathif there are two paths that have same sum then you don't know which one is correct path so every path should have different sum -(so you can use bitmask for it)
•  » » 2 years ago, # ^ | ← Rev. 2 →   0 The point is if you set every element to a constant say 1, then no matter what path duck will take sum will always be same, and if you output any path which is satisfying the sum i.e. in this case "any path" then your answer will be considered wrong as a specific path is to be printed which is hidden in the test case
 » 2 years ago, # |   +1 Why is the next contest scheduled after so many days? Anyone has any clues?
•  » » 2 years ago, # ^ |   +17 The group of people who run this website do so primarily to protect themselves. In reality, however, they form a secret organization to fight the evil in the world. In a few days they will return from their undercover assignments and then organize the next contest.
»
2 years ago, # |
+113

My congratulations to the t-shirt winners:

List place Contest Rank Name
1 1392 1 boboniu
2 1392 2 maroonrk
3 1392 3 ecnerwala
4 1392 4 tourist
5 1392 5 Petr
6 1392 6 ksun48
7 1392 7 tmwilliamlin168
8 1392 8 sunset
9 1392 9 whzzt
10 1392 10 hos.lyric
11 1392 11 qwerty787788
12 1392 12 molamola.
13 1392 13 Benq
14 1392 14 LayCurse
15 1392 15 Egor
16 1392 16 dreamoon_love_AA
17 1392 17 conqueror_of_tourist
18 1392 18 TLEwpdus
19 1392 19 nonamefour0210
20 1392 20 KAN
21 1392 21 ainta
22 1392 22 yosupo
23 1392 23 duality
24 1392 24 Errichto
25 1392 25 atomicenergy
26 1392 26 zeronumber
27 1392 27 okikust
28 1392 28 receed
29 1392 29 imeimi
30 1392 30 risujiroh
41 1392 41 blackbori
44 1392 44 LynCean
74 1392 74 Rewritetxdy
76 1392 76 wangziji
87 1392 87 Pa.Nic
91 1392 90 Nachia
127 1392 127 Azteca
200 1392 200 MForest
212 1392 212 IntoTheNight
271 1392 271 codelegend
276 1392 276 auto_mowu_machine
308 1392 308 Yongaron
331 1392 331 Clovers
336 1392 336 Nson
357 1392 357 yzc2005
387 1392 387 CHelle
431 1392 431 deyan
462 1392 462 leocp1
496 1392 496 nehan_der_thal
 » 2 years ago, # |   -16 when will be next div 3 contest
 » 2 years ago, # |   0 This is a very good contest.