### Jatana's blog

By Jatana, 15 months ago, translation,

Hello everybody!

Now the winter SIS (Summer Informatics School) is taking place, and we, as part of the parallel A*+ with its teachers, have prepared a complete Codeforces Round.

The round will happen at Jan/05/2020 17:05 (Moscow time) and will last for 2 hours. There will be 6 problems in each division.

The tasks of the round were invented and prepared by ismagilov.code, devid, Volkov_Ivan, Jatana, karasek, polinarria, cookiedoth, AlesyaIvanova, KhB, AliceG, D.Pavlenko, VFeafanov, LordVoIdebug, forestryks, Ilistratov, seiko.iwasawa, dim3x38on, Drozd_off under the guidance of teachers PavelKunyavskiy, VArtem, meshanya, Nebuchadnezzar.

And, of course, thanks to MikeMirzayanov for great systems Codeforces and Polygon, and 300iq for round coordination.

Good luck everybody!

UPD:

In problem E an error was made in the intended solution, an overflow of long type while calculating the answer. The first test, on which it happened, reached 4 participants (ainta aid Um_nik ecnerwala), among who two passed the pretests, and two others did not, though they should have. In automatic mode, it is not possible to test so that both answers are accepted, because the overflow changes the tests because of the way the requests are encrypted. So, we decided to test two pretest solutions on the old set of tests and the rest on the new one. As a result, three of the solutions passed the tests (congratulations!), and one received WA80 on the 17th answer inside the test, which is clearly not related to the overflow problems. Only the solution that takes into account the overflow problem can be used in upsolving.

UPD: Editorial!

• +575

 » 15 months ago, # | ← Rev. 2 →   +55 OMG, round by cyans only!!! _overrated_, where are you looking???
•  » » 15 months ago, # ^ |   +50
•  » » 15 months ago, # ^ | ← Rev. 2 →   +8 I am looking at my current color. Go go cyans!!!!!
 » 15 months ago, # |   +32 cyan round!
•  » » 15 months ago, # ^ |   -56 *Fake cyans
•  » » » 15 months ago, # ^ |   +73 *Trans-cyans
 » 15 months ago, # | ← Rev. 2 →   +87
•  » » 15 months ago, # ^ |   +3 It wouldn't be complete without Mr. Rodgers wearing a cyan shirt.
 » 15 months ago, # |   +148 I have changed my color to cyan in order to participate in this round.
•  » » 15 months ago, # ^ |   +47 Me too. Let's make it all cyan, but I hope I don't lose points and get really cyan :D
•  » » 15 months ago, # ^ |   +9 Me too
•  » » 15 months ago, # ^ |   +6 I did not change my color from cyan, but I hope this is my last cyan round
•  » » » 15 months ago, # ^ |   +13 The easiest way is probably falling to pupil -.-
•  » » » » 15 months ago, # ^ |   0 I am in the first step to achieve the goal using the hard way :D
•  » » » » » 15 months ago, # ^ |   +3 Congrats!
•  » » » » » » 15 months ago, # ^ |   +1 thaanks <3
•  » » 15 months ago, # ^ |   0 Me too :/
 » 15 months ago, # |   +18 Round by cyans and for cyans only.
 » 15 months ago, # |   -40 why everyone is specialist?
 » 15 months ago, # |   +60 How on earth is MikeMirzayanov cyan.
 » 15 months ago, # |   +40 CyanForces!
 » 15 months ago, # | ← Rev. 4 →   -33 [deleted]
 » 15 months ago, # |   +3 What happened to the time being displayed in the local time zone in the blogs?
•  » » 15 months ago, # ^ |   +3 Fixed
 » 15 months ago, # |   +34 Do I need to be cyan in order to take part in this round ?
•  » » 15 months ago, # ^ |   +19 Yes.
•  » » 15 months ago, # ^ |   +85 Yes.Don't be afraid to show your real rating, like we did. Say no to rate-shaming.
•  » » » 15 months ago, # ^ |   0 Thanks for tolerance. We really appreciate it
•  » » » 15 months ago, # ^ |   +36 It's called ratism.
 » 15 months ago, # |   +3 I thought my laptop was glitching at first.
•  » » 15 months ago, # ^ |   +12 And I thought I was colourblind.
 » 15 months ago, # |   -78 You guys made me cyan
•  » » 15 months ago, # ^ | ← Rev. 2 →   -99 Well , I changed my mind.
 » 15 months ago, # |   +3 Cyan apocalypse
 » 15 months ago, # |   -26 After two consecutive mathforces I hope this contest will not be a mathforces.
•  » » 15 months ago, # ^ |   +28 Dont worry cyans dont know math
 » 15 months ago, # |   +55 Btw
 » 15 months ago, # | ← Rev. 2 →   +12 Mike is the real Loki.
 » 15 months ago, # |   +9 Jokes on you I became cyan today. ( for a second I thought I broke the system)
•  » » 15 months ago, # ^ |   0 guess it's my turn now
•  » » » 15 months ago, # ^ |   0 That's what she said.
 » 15 months ago, # |   +5 I wonder where is UnstoppableChillMachine...
 » 15 months ago, # |   +56 Is this some kind of anti-ratist movement?let's remove colors! make them all cyan!
 » 15 months ago, # |   +22 Yesterday we participate contest with maximum no of registration and today we are going to participate contest with maximum no of writer.
 » 15 months ago, # | ← Rev. 2 →   +223 Round doesn't seem worth participating in. Maybe with 900 more of these problem setters it will equal the quality of an Um_nik round.
•  » » 15 months ago, # ^ |   +27 Our team rating is 3237.32, which is better than his rating.I've used this formula: https://codeforces.com/blog/entry/16986?locale=ru Code and result: https://ideone.com/SGTALm
•  » » » 15 months ago, # ^ |   +13
•  » » » 15 months ago, # ^ |   -9 You really can't into jokes, can you?
•  » » » » 15 months ago, # ^ |   0 Well I guess you can cross that rating today :)
•  » » » » 15 months ago, # ^ |   +46 Kak zhe tyi slab v postironii
•  » » » » 15 months ago, # ^ |   0 Well, my guess was correct. You have indeed crossed that rating.
 » 15 months ago, # |   0 Joining the cyan trend!
 » 15 months ago, # |   +167 the winter SIS (Summer Informatics School) Hold up.
 » 15 months ago, # |   +3 Specialist round!
 » 15 months ago, # | ← Rev. 2 →   0 .
•  » » 15 months ago, # ^ |   +11 Happy Birthday to you
 » 15 months ago, # | ← Rev. 2 →   +3 Why is it cyan round?
 » 15 months ago, # |   +49 The round is rated for every one with ratings between 1400 and 1600. However, all of you who wish to take part and have not rating between 1400 and 1600 , can register for the round unofficially.
 » 15 months ago, # |   +14 Is it just me, or it's actually looks satisfying to see all cyan like that
 » 15 months ago, # |   -30 cyanity
 » 15 months ago, # |   +66 Me: (Looks at setters) This is incyanity
 » 15 months ago, # |   +33 A creative use of cf new-year magic!
 » 15 months ago, # |   +4 Even if we consider the worst-case scenario, where both divisions have completely different problemsets (i.e., 12 unique questions in total), it is still way less than the number of writers for this round (which is 22). Interesting.
•  » » 15 months ago, # ^ |   +4 Every problem has been worked on by multiple people. You can easily have one person write both (english and russian) statements and 1-2 others do everything else all at the same time. Yes, every person listed as a writer is actually one, everyone had a part in making the round.
 » 15 months ago, # |   0 Go team Cyan!
 » 15 months ago, # |   0 Over 20 writers for 8-9 problems (combined in Div 1,2)... Can we expect each problem to be a mixture of multiple concepts and observations ? And will not be speedforces today ?P.S. It should be fun today. :)
 » 15 months ago, # |   +11 The round of 1000 cyan .. = the round of Um_nik
 » 15 months ago, # |   +3 Hell yeah, cyan round.
 » 15 months ago, # |   0 in respect of all the cyans
 » 15 months ago, # |   +5 Let's make cyan great again everyone!
 » 15 months ago, # |   +6 the number of authors makes me feel good about this round, but I hope it's not a mathforces
 » 15 months ago, # |   -14 When you're not cyan yet:
•  » » 15 months ago, # ^ |   +10 when you just want to write cyan in comments somehow.
 » 15 months ago, # |   +20 Does it mean that Retired_MiFaFaOvO would be participating today.
•  » » 15 months ago, # ^ |   +28 Man, your display picture is disturbing.
 » 15 months ago, # |   0 bests of cyan
 » 15 months ago, # |   -19 Cyan round?
•  » » 15 months ago, # ^ |   +58 Such an original comment!
•  » » » 15 months ago, # ^ |   -9 Yes, i know)))
 » 15 months ago, # |   0 I can be cyan after this cyan round!
•  » » 15 months ago, # ^ |   +6 WOW
•  » » 15 months ago, # ^ |   0 I need 5 points to get cyan...
 » 15 months ago, # | ← Rev. 2 →   +10 One more cyan! UPD: scores for problems?
 » 15 months ago, # |   +1 How is task complexity calculated?
 » 15 months ago, # |   +2 Seeing a strong cyan community, Hoping to become a Cyan today.Good Luck everyone!
 » 15 months ago, # |   0 Why there are some candidate masters registered in div2 and some experts registered in div1?
•  » » 15 months ago, # ^ |   +12 Because some of them registered for the contest before the Hello 2020 ratings have been recalculated.
•  » » » 15 months ago, # ^ |   0 It will be rated for them?
•  » » » » 15 months ago, # ^ | ← Rev. 2 →   0 I'm pretty sure that yes.Once I was transferred to Div. 1 several minutes before the start of the contest (I registered when I was still Div. 2), and it was rated.However I don't know if that's a global thing or not
 » 15 months ago, # |   -13 My rating is 1346, would this div 2 contest be rated for me? I am confused as it is not mentioned in above blog.
•  » » 15 months ago, # ^ |   0 Yes div2 is for rating lower than 1900 and div1 is for rating greater or equal to 1900!
 » 15 months ago, # |   -26 Is it Rated?
•  » » 15 months ago, # ^ |   -13 Yes. It's rated!
•  » » 15 months ago, # ^ |   +21 Of course NO one really want to do this round unrated .Did someone can really think that Regular Codeforces round can be unrated?
•  » » » 15 months ago, # ^ |   -37 first, you have grammar mistake: "Did someone can really think that Regular Codeforces round can be unrated?" should be changed to "could someone really think that Regular Codeforces round can be unrated?"and, I really think if the round is rated.
 » 15 months ago, # |   -29 This is the point where you need to cut down the list of authors on the Contests page to only the most relevant ones because it's tl;dr.
•  » » 15 months ago, # ^ |   +50 What do you mean by "most relevant ones"? Everyone had a part in making the contest.
•  » » » 15 months ago, # ^ |   -10 What do you mean by "most relevant ones"? Are you asking what the phrase "most relevant ones" means or who should be considered the most relevant ones? In the first case, try a dictionary, in the second case, I can tell you what I'd pick if you describe the preparation process in detail and how everyone contributed.If, for example, I made a dumb heuristic solution for some problem and a countertest for that got added, I wouldn't consider it relevant enough to call myself one of the authors of the contest. Everyone had a part in making the contest. And everyone can be mentioned for example on this page, with a shorter list posted where it would be an inconvenience to have a very long list — the Contests page, in this case. It's not like everyone who had a part in making a contest should make their own blog post about their part in it, either, right? The logic is the same.
•  » » » » 15 months ago, # ^ |   +28 So every person got assigned to a problem, with 2-3 people per problem, and each team then distributed the tasks between its members. There's really a lot to do if you're making a problem in polygon: write a statement and a tutorial in 2 languages, write several solutions (correct and incorrect ones alike), generate tests, make a checker and a validator, and each one of these tasks can pretty much be done independent of others. Of course, the harder the problem, the harder each of these tasks are, but not significantly: everyone involved knows the statements and the solutions well, so preparing any problem is pretty much a routine job. So there really are no "most relevant" problemsetters, they are all roughly on the same level.
•  » » » » » 15 months ago, # ^ |   -34 Huh, that's... unusual. Most of the time, there's someone who makes sure statements are ok, someone (possibly the same person) who makes sure translations are ok, testers who write the correct+incorrect solutions and comment on what's missing, and for each problem one, very rarely two people who do the main, initial brunt of the work — basic statement, correct solution, basic tests. each one of these tasks can pretty much be done independent of others I don't have that experience. When I'm preparing a problem, in order to make strong tests, I want to understand intricacies of the problem and the solution well enough that I might as well write it down, so making the statement, tutorial, one solution and tests is all interconnected. The same goes for the checker if a non-trivial one is required. If I do just part of it, I can miss something important, and if I divide it up with someone else, it happens too often that one of us ends up doing too much or there's just a general lack of communication, and it costs more than it offers. Then, some tasks are independent — validator, simple checker, simple bruteforce etc, and some, like good translations, then require specialised roles.In your case, it's more like when there's a prioritisation meeting at work where some bigger structured task was already explained and divided into also explained smaller parts before, it gets moved from the todo list and team members are assigned to parts of that task. Since you mentioned that each assigned person knows their problem+solution well enough.Anyway, regarding the long list: you mention 18 people + 4 teachers/coaches + some testers. Since you mention 2-3 people per problem, I assume that's the 18. If each person is mentioned just for 1 problem and only for the division where that problem appears (C is one problem), that would cut it down. Another, probably better alternative, would be to just keep the list of authors on the Contests page empty. Whoever wants to read it can read it here.
 » 15 months ago, # |   +11 What is scoring distribution!!
 » 15 months ago, # |   0 Let's all convert to Specialist
 » 15 months ago, # |   +43 Come in as a fake cyan, come out as a real cyan.
 » 15 months ago, # |   -7 i didnt registered because i didnt see starting time how can i now register there is 50 minutes remaininig?
 » 15 months ago, # | ← Rev. 2 →   +33 me at the contest cyan round was very difficult for me
•  » » 15 months ago, # ^ |   -15 Being the legendary grandmaster I was able to make TLE at B!
 » 15 months ago, # | ← Rev. 2 →   -19 good contest. specialist here i come!stuck TLE on div2B for about 1h until i found i used map changed to unordered_map and pp lol
•  » » 15 months ago, # ^ | ← Rev. 2 →   0 I passed pretests with map in 654ms. Was it intended?
•  » » » 15 months ago, # ^ |   +5 guess i implement it poorly
•  » » 15 months ago, # ^ |   0 the same thing here :D
 » 15 months ago, # |   +18 Nice Impossibleforces !!
 » 15 months ago, # |   +16 Radewoosh RIP
•  » » 15 months ago, # ^ |   0 orz Radewoosh
 » 15 months ago, # |   +18 Is this correct for D2E1/D1C1 — We ask (1,1) + (1,n) + (2,n) By (1,1) we get first character, by (1,n) and (2,n) we can get only prefix substrings. By keeping count of frequencies, we can place characters by reducing the first character one by one.
•  » » 15 months ago, # ^ |   +3 That worked for me, but asked only (1, n) and (2, n) — you get the first character for free as it is the only string of length 1 in their difference.
 » 15 months ago, # |   +15 On problem C, I spent 20 minutes debugging my code, only to find out that all I was missing was the edge case where N = 1. :(Overall, great contest in the D2 at least.
 » 15 months ago, # |   0 https://codeforces.com/contest/1287/submission/68274741Please explain why this isn't working. Time complexity is O(n*n*(k+log(n))) Can it be done in better???
•  » » 15 months ago, # ^ |   0 String concatenation is not always O(1). Better to use vector of characters. 68258848
•  » » » 15 months ago, # ^ |   +1 Thanks ..... This has made me sad now, didn't knew such a thing :(
•  » » » » 15 months ago, # ^ |   +5 worked for me by concatenating only chars to the main string...in your example in the last case, you concatenate string w to string t: char ch='S'+'E'+'T'-v[i][m]-v[j][m]; string w(1,ch); t=t+w; should be just : char ch='S'+'E'+'T'-v[i][m]-v[j][m]; t=t+ch my AC solution : https://codeforces.com/contest/1287/submission/68262300
•  » » » » » 15 months ago, # ^ |   +1 That too is just on the boundary!!
•  » » 15 months ago, # ^ |   0 My solution (pending systests) is pretty much the same idea. I only used a set instead of a map. Also I locally generated a n=1500, k=30 input locally to make sure my code does not TLE before sending it
•  » » 15 months ago, # ^ |   0 You should also note that the log(n) factor is unnecessary, and due to the strict time limit can by itself cause a TLE, assuming a badly implemented code.
•  » » 15 months ago, # ^ | ← Rev. 3 →   +3 this line t=t+v[i][m];It's inefficient, because basically you create third string and get data from the first string and second string, the total t construction after k iteration will be O(k^2) http://www.cplusplus.com/reference/string/string/operator+/It will be faster, if you change it to t += v[i][m] It will only add the second string to the first string, The total t construction after k iteration will be O(k) http://www.cplusplus.com/reference/string/string/operator+=/
•  » » » 15 months ago, # ^ |   0 my code with push_back fails..any reasons why?
•  » » » 15 months ago, # ^ |   0 thanks gegewepe ........ it worked
 » 15 months ago, # |   +1 How to solve C?
•  » » 15 months ago, # ^ | ← Rev. 2 →   -25 .
•  » » » 15 months ago, # ^ |   +3 i think he asked about div1c
 » 15 months ago, # | ← Rev. 3 →   0 never mind
 » 15 months ago, # | ← Rev. 2 →   +10 Why constraints for DIV2 C are so low? It can be solved in O(nlogn) using greedy.Update: my solution passed system tests
•  » » 15 months ago, # ^ | ← Rev. 2 →   +24 Whats the greedy solution? I could only think of a dp solution with states involving (index, oddRemaining, evenRemaining, lastOddOrEven)
•  » » » 15 months ago, # ^ |   0 Consider the parities of fixed points in order as they appear in the string. We can see that if two consecutive parities differ, then the the complexity of the substring between them is 1. So, it remains to consider the segments with same parity, sort them according to length, and give the required numbers with the same parity till we run out.
•  » » » » 15 months ago, # ^ | ← Rev. 2 →   +13 The greedy which I implemented has some annoying edge cases.Basically, you have to separately consider substrings bordered by the edge, and substrings bordered by two numbers. Plus, you have to deal with the all-zero case and the N=1 case.
•  » » » 15 months ago, # ^ |   +22 Only 4 types of gaps are possible: even-even, odd-odd, even-odd, odd-evenFor even-odd and odd-even, the minimum complexity generated is always equal to 1 (doesn't matter if you use all even or all odd or combination of both)So just take all even-even and odd-odd types of gaps in increasing order of gap value and greedily fill them. E.g. for even-even if enough even numbers are available to fill the whole gap then the minimum complexity generated is 0 otherwise 2.Gaps in start and end of the array are needed to be handled separately.
•  » » » » 15 months ago, # ^ |   +1 I thought of similar solution but couldn't implement it cause B took all the time.
•  » » » » 15 months ago, # ^ |   0 I started writing this as well, but I wasn't sure if it was correct so I just deleted everything and wrote DP, since I knew for sure that would pass.
•  » » » » » 15 months ago, # ^ |   0 How to solve using DP ?
•  » » » » » » 15 months ago, # ^ | ← Rev. 2 →   0 Define $dp[i][j][k]$ as the minimum obtainable complexity upto position $i$ such that exactly $j$ even numbers have been used so far and the last one used has remainder modulo $2$ equal to $k$.
•  » » » » 15 months ago, # ^ | ← Rev. 2 →   0 I tried that too, I immediately knew it was DP but for some reason, I went too far with the DP tbh it felt like I was drunk XDI have submitted this idea but since I was in a hurry (Badly written) there might be a bug in the code, If anyone gets accepted with this idea please link it.
•  » » » » » 15 months ago, # ^ |   0
•  » » » » 15 months ago, # ^ | ← Rev. 2 →   0 I followed the exact same greedy approach but cannot get AC on 12th test case. I am unable to find the issue with my code. Can you help? 68277187
•  » » » » » 15 months ago, # ^ |   0 You should try this70 3 0 5 1 4 2The correct answer is 2, not 3.
•  » » » » » » 15 months ago, # ^ |   0 Thanks...got the issue. I wasn't able to relate it to as a dp problem during the contest. Anyone who initially started with greedy and then moved to dp, can they share what exactly prompted them to do so?
•  » » 15 months ago, # ^ |   +71 Perhaps because the greedy (if it is indeed correct) is error-prone while not very interesting. I started with greedy and after 20mins and 2 WAs just wrote the DP which passed immediately. I actually respect their decision not to force the greedy approach.
•  » » 15 months ago, # ^ |   -9 No offense, but your solution is pretty ugly. DP produces a shorter and cleaner code.
•  » » » 15 months ago, # ^ |   +22 My point was about time complexity not implementation complexity
•  » » » » 15 months ago, # ^ |   -9 Finding the best possible complexity is nice, but to me it sounds like an upsolving excercise. During a contest, the goal is to get points ASAP, so I don't see why waste time implementing it.
•  » » » » » 15 months ago, # ^ |   +1 No offense,but when there is a solution with better time complexity,it is always better to learn it.Same question,could have been asked with larger constraints,and dp wouldn't work.
•  » » » » » » 15 months ago, # ^ |   -24 I don't think you read my comment carefully. It is good to learn the fastest solution, but it's better to do so without time pressure during contest. That's what upsolving means.
•  » » » » » » » 15 months ago, # ^ |   0 I get it,it is always better to implement a dp solution than a greedy,if it works under constraints,but I believe the intent to post the greedy solution to help others.
•  » » » » » » » » 15 months ago, # ^ |   +8 I never said his comment had a bad intent. He asked why constraints were so low, and I answered: DP was simpler than greedy.
•  » » » 15 months ago, # ^ |   0 Can you please explain your solution to $D$ ?
 » 15 months ago, # |   +278 That feel when you read that test 20 is incorrect and then get "Pretests passed".
 » 15 months ago, # |   0 How to solve B?
•  » » 15 months ago, # ^ | ← Rev. 2 →   0 you can brutefore for the two words and you can deduct the third word in the set , if the i char in the 1 and 2 words was the same than the i char in the third word will be the same else the i char should be different from the the 1 and 2 words . when you deduct the third word you can use the binary search to check if the third word exists after the second word or not if it exists add one to the answer .
•  » » 15 months ago, # ^ |   0 lets choose two strings i , j any two are valid ( try to prove it ) then you can know the third string in this way loop in those two strings if current two chars are equal then the third string must have the same char else the third string must have a char nethier equal those chars in that position
 » 15 months ago, # |   0 Terrible I have a problem with live contests usually I can solve div2A in < 15 min and div2B in < 30 min (in training) But I need to see the test cases to see why I get WA... if someone know how to get over such a problem.. Yes and i will be newbie after this round
•  » » 15 months ago, # ^ |   +24 Learn to debug and stress test.
•  » » » 15 months ago, # ^ |   0 I know how to debug but I have a problem in generating test cases by myself
•  » » 15 months ago, # ^ |   0 Try Virtual Contests, in that case, you won't be able to see the test cases.
•  » » » 15 months ago, # ^ |   0 Thanks I will train just in virtual contests maybe that will help me
•  » » 15 months ago, # ^ |   0 You can try generating random test cases or thinking of test cases with which your solution might fail.
 » 15 months ago, # |   +169 Do you really think putting these problems together in one round was reasonable choice? Already C2 was a tough one and A+B+C1+D (solving only one out of 4 hardest problems) gives me 11th place before systests.
•  » » 15 months ago, # ^ |   +33 I prefer contests like these to contests where all the top participants solve everything. It gives freedom to choose which problem to solve. Pretests could be stronger though. :(
 » 15 months ago, # |   +1 Why did i go in thinking a cyan round should be like taking candy from a baby :sobs
 » 15 months ago, # |   +220 Does this mean I have successfully hacked the judge?
•  » » 15 months ago, # ^ |   0 No
•  » » 15 months ago, # ^ |   +55 I thought that in problem called "implement a lot of stuff" implementing BigInt was just another part.
•  » » » 15 months ago, # ^ |   +35 Wow! Now I see why Codeforces doesn't support 128bit integers.
•  » » » » 15 months ago, # ^ |   +23 +1
•  » » » 15 months ago, # ^ |   +170 Ok, I think results of this round prove that Um_nik is really worth more than 21 cyans.
•  » » 15 months ago, # ^ | ← Rev. 4 →   0 What's the final resolution to this? It looks like there are no tests that overflow 64-bits now? I think that decoding via $ans \% 2^{64} \% 26$ and $ans \% 26$ both pass?
 » 15 months ago, # |   0 Any gueses what is in test 3 for Div2C?
•  » » 15 months ago, # ^ |   0 n == 1
•  » » » 15 months ago, # ^ |   0 My code gives answer 0. But I still get WA 3
•  » » » » 15 months ago, # ^ |   +14 n == 1 && p[1] == 0
•  » » » » » 15 months ago, # ^ |   +1 Yeah! In this case my code answers 1. Thanks
•  » » 15 months ago, # ^ |   +4 some ideas:6 0 0 1 0 0 0 (expects 1)5 0 2 0 4 0 (expects 4, pretest 4 is like that)5 0 1 0 3 0 (expects 2)1 0 (expects 0)6 0 0 1 3 0 0 (expects 2)looking for pretest 5 if somebody got it
•  » » » 15 months ago, # ^ |   +3 Pretests are now visible.
•  » » » » 15 months ago, # ^ |   0 Indeed, and I realized my mistake. I had something like if(condition1) if(condition2) dosmth(); else if(condition3) dosmth(); and my intention was to do if(condition1){if(condition2) dosmth();} else if(condition3) dosmth(); because the else if in the first version acted as an else for the if(condition2), and not for the if(condition3) like I wanted... What a mistake xd
•  » » 15 months ago, # ^ |   0 n=1
 » 15 months ago, # |   +11 Anyone solved C2 by asking $(1, n)$, $(1, \frac{n + 1}{2})$ and $(\frac{n + 1}{2}, n)$?
•  » » 15 months ago, # ^ |   0 how do you recover answer?
•  » » » 15 months ago, # ^ |   0 I didn't have time to implement it, which is why I'm asking others who actually solved it here. My rough idea is we should know $a_\frac{n+1}{2}$ from the beginning, then just build up the answer symmetrically from those 3 parts.
•  » » 15 months ago, # ^ |   +5 That's my solution but I kept getting WA on 12. I think I have a bug because the implementation is tough.
•  » » 15 months ago, # ^ |   +8 I think query same half would be work, thus might use one half to recover another half. waiting for editorial..
•  » » 15 months ago, # ^ |   +8 Sort of, but I have 6 cases: $n = 1, n = 2$, and $n \mod 4$. Maybe some are unnecessary.
•  » » 15 months ago, # ^ |   0 I'm not sure, but I assume that it recovers the string up to reversal, isn't it?
 » 15 months ago, # |   0 5 4 SETT TEST EEET ESTE STES Participant's output 0 Checker comment wrong answer 1st numbers differ — expected: '2', found: '0'But my dev c++ runs out 2 Can anybody explain that?=_=
•  » » 15 months ago, # ^ |   +5 You are likely dealing with some kind of undefined behavior (such as indexing an array with an invalid index or using ununitialized variables)
•  » » » 15 months ago, # ^ |   -6 Em.....Thank you for your help But I believe I didn't do that =_=!!
•  » » 15 months ago, # ^ |   0 change char kk[k]; to char kk[31] = "";
•  » » » 15 months ago, # ^ |   0 oh...I know it.. Thanks a lot.Dalao
 » 15 months ago, # |   -13 Interactive problems...Find out a solution at last but keeping 'Idleness limit exceeded on pretest 1'
 » 15 months ago, # |   +1 How to solve B ?
•  » » 15 months ago, # ^ |   0 Choose 2 strings and try to make the third one. You can see that if you have 2 strings, there can be only 1 third substring. All you have to do is to create a map to store the frequence of every string and, after you build the third string, add its frequency to the answer. Be careful, you count every triplet 3 times, so, at the end you should divide then asnwer by 3. :)
•  » » » 15 months ago, # ^ |   0 In the whole contest i can't come up with this simple approach . In the end just wrote brute to see it it can pass . haha
 » 15 months ago, # | ← Rev. 2 →   0 I got WA on D and E1 on first submission because i was missing the case N = 1... Has it happened to someone else? :)
 » 15 months ago, # |   +43 Thanks for including $n = 1$ in pretests for C1 -_-
 » 15 months ago, # |   0 Really sad. I found where I made a mistake in my prob D code after 2 minutes the contest had over.
 » 15 months ago, # |   0 How to solve Div2-D?
•  » » 15 months ago, # ^ |   +5 Start placing integers in nodes in decreasing order — When subtree size = c-value, this is max in subtree, select the one with lowest depth and decrease subtree size of all its ancestor by 1.
•  » » » 15 months ago, # ^ |   0 Can you explain what you mean by "start placing integers in nodes in decreasing order"? Should you place bigger integers before smaller ones? Or should you place integers from nodes n to 1? And what do you mean by "subtree size = c-value"? What is max in subtree of what? And what do you mean by decreasing the subtree size of all its ancestors?
•  » » » » 15 months ago, # ^ | ← Rev. 3 →   0 Should you place bigger integers before smaller ones? — YesAnd what do you mean by "subtree size = c-value — c_values given in problemWhat is max in subtree of what? — Maximum a_i among nodes in its subtree
 » 15 months ago, # |   +3 can someone please explain why this solution 68252477 for PROBLEM B of DIV 2 is getting TLE
•  » » 15 months ago, # ^ | ← Rev. 2 →   +2 Your solution is (n * n * k * k * logn) which is quite big
•  » » 15 months ago, # ^ |   0 I have similar solution, but with unordered_set.
•  » » 15 months ago, # ^ |   +3 You are using std::set, which has an awful constant on nearly all the operations. Using three ifs instead of set gave AC.
•  » » » 15 months ago, # ^ | ← Rev. 2 →   0 Thanks for replying. I don't think this is the problem but still i will give it a try once submissions are allowed and will update you update: you are correct. Just by using three loops it passed. Thanks man
•  » » 15 months ago, # ^ |   0 You did s += x to add a single character to a string, which will lead to $O(k^2)$ for forming the string. Instead do s.push_back(x), which will be in $O(k)$.
•  » » » 15 months ago, # ^ |   +3 s+=x has complexity linear in term of length of x. s=s+x has linear complexity in length of resulting string.so s+=x will lead to O(k) only
•  » » » 15 months ago, # ^ |   0 can you explain why s+= x is slower than s.pushback(x) in general ?
 » 15 months ago, # |   0 spend half an hour on alternative, correct solution for Div2-Csubmit old buggy version with 2 minutes left Sigh...
 » 15 months ago, # | ← Rev. 2 →   +19 I liked problem C, but it can be hard to spot the solution. It is kind of guessing which approach to take.
 » 15 months ago, # | ← Rev. 2 →   +97 C is probably my favourite interactive problem now, finally something that is not binary search :Dd C1Ask [1, n] and [2, n], sort strings in the answers and remove strings in the second answer from the first. Then only one string of each length remains, and those strings are all the prefixes of our string. By counting which character frequency increased from i-1th prefix to the ith, we find the ith character. C2Use C1 to find the first half of the string, then query [1, n]. The total length of the answers is $(k+1)(k+2) + \frac{(2k+1)(2k+2)}{2} = 3k^{2} + 6k + 3 = \frac{3}{4} (2k + 2)^{2} \leq 0.777 (n + 1)^{2}$ when $n = 2k + 1$.Let $cou[c][k]$ be the total number of occurrences of character $c$ in substrings of length $k$ in the last query. Then the number of occurrences of character $c$ in the first $k$ and last $k$ characters of the string is $cou[c][1] - (cou[c][k+1] - cou[c][k])$, as if the character at position $i$ is $c$, it adds $\min(i, n+1-i, k)$ to $cou[c][k]$.We know the first half of the string, now loop $k$ from $1$ to $\lfloor \frac{n}{2} \rfloor$ and find how many times character $c$ occurs in the first $k$ and last $k$ positions. We know all but one of the characters in the first $k$ and last $k$ positions, so we can this way check if the $k$th last character is $c$.
•  » » 15 months ago, # ^ |   +14 I did the same thing in C1 div1 / E1 div2, but damn, that 0.777 was scary
•  » » 15 months ago, # ^ |   +59 You can actually restore string uniquely up to reversal just by asking [1, n]. And then you can ask any [i, i] such that $s_i \neq s_{n - i + 1}$. So it can be solved by 2 queries with sum of substrings $n(n+1)/2+1$.
•  » » » 15 months ago, # ^ |   -39 How can one come up to the solution of Problem Div2C and how to solve it ?
•  » » » 15 months ago, # ^ |   +81 I don't think so, what about this:xyaxybxy xybxyaxyThese are not reverse from each other, but they have exactly the same output (up to randomness, this is, before returning sort characters on each substring and then sort all substring).
•  » » » » 15 months ago, # ^ |   +15 You hacked me. :)
•  » » 15 months ago, # ^ |   +13 I don't think that binary search interactive problems are in trend now, wow. Last such problem was on Codeforces Round #569 (Div. 1) (in summer).Last few interactives: 1270D - Strange Device, 1282D - Enchanted Artifact, 1254C - Point Ordering, 1207E - XOR Guessing, 1205C - Palindromic Paths, 1201E2 - Knightmare (hard) — no binary search!
 » 15 months ago, # |   +22 How to solve Div1D ?
 » 15 months ago, # |   -6 Just completed my very first competitive programming contest. I have no idea to solve Div2 C and my brain is burning now xd...
 » 15 months ago, # |   +70
•  » » 15 months ago, # ^ |   +11
 » 15 months ago, # | ← Rev. 2 →   -60 I hate subtasks so much!!!
•  » » 15 months ago, # ^ |   0 So go to D after solving C1?
•  » » » 15 months ago, # ^ |   +7 I thought D would be way harder than it actually was..
 » 15 months ago, # |   +3 What's wrong with this solution for div2B? I am getting TLE on pretest 10. https://codeforces.com/contest/1287/submission/68262344
•  » » 15 months ago, # ^ |   0 I think in the nested loop, you can reduce the use of set. due to too much of find, erase and insert. Maybe thats why you are getting TLE, You can check my code here, it does the same as your code using map.https://codeforces.com/contest/1287/submission/68278675
•  » » 15 months ago, # ^ |   0 Same here https://codeforces.com/contest/1287/submission/68271441. I am seeing exactly the same solutions with AC ...
•  » » 15 months ago, # ^ |   0 same, i changed map to unordered_map and pp
 » 15 months ago, # |   -32 When you are just on time.
 » 15 months ago, # | ← Rev. 3 →   +10 So what's the best ratio anyone's gotten in Div1 C2? My solution takes about $0.75N^2$ and that's likely the intended one. It doesn't feel like this would be the optimal solution.Edit:According to aid a query restores the string uniquely up to reversal, which makes the problem much simpler. I've no clue how one proves that, though.
•  » » 15 months ago, # ^ |   0 I think you can solve it with one query for the whole string and then one more question for a single string. The algorithm is rather messy so I didn't get time to implement :(Basic idea: Looking at strings of length $N-1$, you can get the first and the last symbol. Then, with some considerations, from the strings of length $N-2$ you can extract 2nd and $(N-2)$-nd symbol, and so on.There is one more consideration: the first time you encounter different characters with the above algorithm, you can ask for one of them directly. After that, you can use this difference to figure out where each character is for each different pair in the next iterations.
•  » » 15 months ago, # ^ |   +10 Look at all strings of length $n-1$. There are 2 of them. From them you can restore first and last elements, but you don't know which one is first and which one is last. If they are different, ask about the first one. Then if we restored the first and last $k$ elements, let's look at the strings of length $n - k - 1$, we know all but 2 of them. Find those 2 strings, from them we can find $k+1$-st elements. There are some cases like when we already found 2 different characters and not.
•  » » » 15 months ago, # ^ |   +10 From them you can restore first and last elements, but you don't know which one is first and which one is last. How do you handle something like aabbaa?
•  » » » » 15 months ago, # ^ |   0 We have strings "aabba" and "abbaa", from them you know that first and last elements are 'a'.
•  » » » » » 15 months ago, # ^ |   0 But those strings can also come from bbaaab. Can you elaborate your approach?
•  » » » » » » 15 months ago, # ^ |   0 But you know the number of 'a' and 'b' in the whole string. Each of the strings of length $n-1$ either has 1 less 'a' or 1 less 'b', from that you know 2 border characters.
•  » » » » » » » 15 months ago, # ^ |   0 I had the same approach, but during upsolving I found out that during restoring there can be an issue, where prefix and suffix are the same (w.r.t character frequencies), we have two different letters, and we don't know which letter goes to prefix and which goes to suffix. That's why I got WA23 :/ How do you deal with such situation?
•  » » » » 15 months ago, # ^ |   0 You know how many A's and B's there are because of the 1-length strings, so you can check which character is absent in both substrings by counting
•  » » 15 months ago, # ^ |   +28 My solution uses around $\frac{2}{3} N^2$:C1: $\textrm{query}(1, N) - \textrm{query}(2, N)$ gives you the set of prefixes of the hidden string, which is enough to construct it. It uses around $N^2$ strings.C2: With the same idea from C1 we can learn the first $\frac{2}{3}$ of the hidden string using $\frac{4}{9}N^2$ strings. Knowing the middle third of the hidden string and querying its last $\frac{2}{3}$ (an additional $\frac{2}{9}N^2$ strings) is enough to construct the final third.
•  » » » 15 months ago, # ^ |   0 Can you explain how do we get the last third of the string?
•  » » » » 15 months ago, # ^ |   +5 We want to construct a string of length $2T$. We know its first $T$ characters and we know the list of responses from querying the entire string.From the unique response with length $2T$ we know the unordered contents of the full string.Suppose that we have already figured out the last $k$ characters of the string. Initially $k = 0$ and when $k = T$ we are done. We consider all substrings of length $2T - 1 - k$. We already know enough characters at the beginning and end of the string to construct all of them which don't start at the very beginning of the string (subtract excluded letters at the beginning and end from the contents of the full string). By elimination we find the one which does start at the beginning: it gives us the $(k+1)^\textrm{th}$ character from the end.
•  » » » » » 15 months ago, # ^ |   0 Thanks
 » 15 months ago, # |   0 CAN YOU MAKE PRETESTS STRONGER?
 » 15 months ago, # |   -18 Very very very weak pretests :(
 » 15 months ago, # |   +10 Attempt 1 : TLE Attempt 2 : TLE Attempt 3 : TLE Attempt 4 : TLE Attempt 5 : Pretests passed at 1:59:32 Reason for TLE : use of set to find the character not present at a given index rather than simple if else.  setse; se.insert('S'); se.insert('E'); se.insert('T'); se.erase(s[i]); se.erase(b[i]); char a = *(se.begin()); 
•  » » 15 months ago, # ^ |   0 I used policy based data structure so my solution got accepted at last
•  » » 15 months ago, # ^ |   0 please can someone tell me why using set give TLE
•  » » » 15 months ago, # ^ |   0 set.insert() and set.erase() are not O(1) operation but O(logn) operation, although n here is equal to 3, i didnt expected that to be huge issue
 » 15 months ago, # |   +5 https://codeforces.com/contest/1287/submission/68275963 this solution give output 0 for n=7,p={0,0,0,7,0,0,0}, but actual output is 1
 » 15 months ago, # |   -10 That's not the way on how to write problem B for Div 2.
•  » » 15 months ago, # ^ |   0 i agree, was getting a lot of tle on tc 10. but finally corrected it.
 » 15 months ago, # | ← Rev. 2 →   +63 Duh, getting $O(3^n)$ is not that hard in F, definitely more doable than anything like $O(2^n n^{10})$ and indeed as I expected both accepted solutions are $O(3^n)$ -.-
 » 15 months ago, # | ← Rev. 10 →   +42 never give up :))))
 » 15 months ago, # |   +17 unordered or ordered map ? In some problems unordered passes while ordered fails, while in others exact opposite happens.
•  » » 15 months ago, # ^ |   -19 Always use map,unordered map's time complexity depends on nature of input,if a solution passes for unordered map but fails for map,then it's either bad implementation or bad question
•  » » 15 months ago, # ^ |   0 Unordered map is faster, provided that you have a good hash function. The reason why unordered_map is sometimes slower than regular map is that there exist special techniques of generating worst-case tests for unordered map, where standard hash functions give a lot of collisions.See this blog for more details.
 » 15 months ago, # |   +5 The contest was raely nice but I had a better idea on itIt was realy nice to add a simple problem at the begining of the Div. 2 then you change the n of the problem Div 2. D to 1e5(solveable with easy dfs).so the contest would be better to solve.And also D was easier than C and swaping them was a good idea.Thanks CyanForces!It was good at all.
•  » » 15 months ago, # ^ |   +9 can you tell your approach for d, i find dp solution of C much easier than d.
•  » » » 15 months ago, # ^ |   +8 as a dfs return a vector and make this like:insert all of the vector of kids of v togetherthe insert v as c[v]_th element (if impossable "NO")then get the vector of rootthen for all i, ans[a[i]] = ithen output the ans[i] for each iAnd I think it is the best problem fo teaching dfs to someone :)
•  » » » » 15 months ago, # ^ |   0 Can you explain why that works?
•  » » » » » 15 months ago, # ^ |   +6 Because every vertex is the c[ i ]_th it it's kid's set.Because we inserted it as c[ i ]_th element in the vector :)Do you agree? so now we came to find out what numbers to assign vertex to get the order v1, v2, ..., vn.so we assign 1 to v1 and 2 to v2 and ... .now we have some numbers that are the c[ i ]_th in their SubTree. :)
•  » » » » » » 15 months ago, # ^ |   +5 Yes, thank you!
•  » » 15 months ago, # ^ |   +9 How would you do div. 2 D with n = 1e5?
•  » » » 15 months ago, # ^ | ← Rev. 6 →   +3 Do like the comment on top but with a little diffrent.First with an easy dfs check if every vertex's (SubTreeSize[v] <= c[v]); If not output("NO");Here we go:take an ordered set Insert all 1 to n in the setFor each vertex in the dfs erase the c[ v ]_th element and it would be ans[ v ] and it's ans sequence is the same as This (try to prove it by Mathematical Induction and the delete the root and it is ok for the tree's made by deleting it and so on ...And output ans[i] for every i.
•  » » » » 15 months ago, # ^ |   +5 Good one! Actually, just implicit key cartesian tree gives nlogn if vector is replaced with it. Code for n^2, which can be modified with tree instead of inserting into vector
•  » » » » » 15 months ago, # ^ |   0 Yes bro got it right!it was the idea behind it.
 » 15 months ago, # | ← Rev. 2 →   +10 What is the time complexity of writer's solution of problem F? I think coming up with O(3^N) solution is not so hard, yet I was able to fit it to TL by pruning: 68281697
•  » » 15 months ago, # ^ |   +72 $O((1 + \sqrt{2})^n + \log{n} \cdot n^2 \cdot 2^n)$
•  » » » 15 months ago, # ^ |   0 another sweets complexity?
 » 15 months ago, # |   0 Could someone please, tell me, where I went wrong. 68273158
•  » » 15 months ago, # ^ |   -11 I can't tell the error but i solved it using dynamic programming. dp[i][odd][even][prev] be the minimum complexity we can get till i using odd odds and even evens and the prev element tells whether we filled or intially previous element was odd or even. now transition is very simple. i really liked this round. can anyone help me with div1B.
 » 15 months ago, # |   +6 How to solve DIV1B/2D numbers on tree.
•  » » 15 months ago, # ^ | ← Rev. 3 →   +3 I solved in this way: Keep the number of nodes in the subtree for each node(let it S[]). If there exists i such that S[i] <= C[i], then the construction is impossible. Otherwise, the construction is always possible. Keep 1, 2, 3, ... n originally in a set data structure(e.g., treap?); let the the set B. From the root, run DFS and make each A[i] value to C[i]+1th smallest value of B, and erase the value from B. Then, the number of smaller nodes in the siblings are exactly same to C[i].
•  » » » 15 months ago, # ^ |   0 Then, the number of smaller nodes in the siblings are exactly same to C[i]. Do you mean number of smaller nodes in the subtree?
•  » » » » 15 months ago, # ^ |   0 Yes. As we wish to be. :) 68267213 This is my submission. I feel ashamed to be in public(cause the code is dirty..).. But maybe it would be helpful under the function predfs. I used treap data structure to keep the set and find kth element from it. But there would be many alternative solutions like indexed tree + binary search, or etc.
•  » » » » 15 months ago, # ^ | ← Rev. 2 →   0 Cleaner submission with Fenwick Tree and binary search(to find kth element): 68289460. (O(nlog^2n))
 » 15 months ago, # | ← Rev. 2 →   -14 Sorry, but it was a coincidence.
 » 15 months ago, # |   0 My solution for C was 100 lines in python (making lists of gaps with different ends then sort etc) there should be some shorter approach to avoid this spaghetti mess.
 » 15 months ago, # |   +35 When tutorial will be published???
 » 15 months ago, # | ← Rev. 2 →   0 in problem B, TLE code in contest time 68259187. Ac code after contest 68286650. just modified a simple function named f(). I think it should not matter. please have a look.
•  » » 15 months ago, # ^ | ← Rev. 2 →   +1 Well, you were using map in the function that gave you overhead
 » 15 months ago, # |   +13 It was a good contest.
 » 15 months ago, # |   -33 Can someone tell me why this code gives WA on div2A?  #include using namespace std; int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t, n; string s; cin >> t; while(t--){ cin >> n >> s; int mx = 0, counter = 0; for(int i = 0; i < n - 1; ++i){ if(s[i] == 'A' && s[i + 1] == 'P'){ i++; while(i < n && s[i] == 'P'){ counter++; i++; } mx = max(mx, counter); counter = 0; } } cout << mx << '\n'; } return 0; } 
•  » » 15 months ago, # ^ |   0 APAPP, add i-- after while loop and it should be correct
 » 15 months ago, # |   +1 How to solve Div.2 C/Div.1 A?
•  » » 15 months ago, # ^ | ← Rev. 2 →   +2 Think dp! The state is dp(index, odd remaining, even remaining, parity of last element). See this:https://codeforces.com/contest/1287/submission/68272946
•  » » » 15 months ago, # ^ |   0 Thank you!
 » 15 months ago, # |   0 I m newbie can someone tell me where is the editorial?
•  » » 15 months ago, # ^ | ← Rev. 2 →   0
 » 15 months ago, # |   0 When will editorials be officially pubished?
 » 15 months ago, # |   0 https://codeforces.com/contest/1287/submission/68290995 wrong answer on case 12 which doesn't have a value at index 0.https://codeforces.com/contest/1287/submission/68290894 wrong case on case 8 which also doesn't have a value at index 0.https://codeforces.com/contest/1287/submission/68290844 wrong on case 12 which also doesn't have a value at index 0.https://codeforces.com/contest/1287/submission/68290780 wrong on case 19 which also doesn't have a value at index 0.please help me with this error .My approachi am not able to manage what should be done first .My approachin some cases assigning to first works in others after assigning to all gaps first and last are checked. Only 4 types of gaps are possible: even-even, odd-odd, even-odd, odd-even For even-odd and odd-even, the minimum complexity generated is always equal to 1 (doesn't matter if you use all even or all odd or combination of both) So just take all even-even and odd-odd types of gaps in increasing order of gap value and greedily fill them. E.g. for even-even if enough even numbers are available to fill the whole gap then the minimum complexity generated is 0 otherwise 2. Gaps in start and end of the array are needed to be handled separately.70 3 0 5 1 4 2 The correct answer is 2, not 3 , my code is giving 3.Please help me fix it.should i sort the gaps in increasing order of length before filling?
•  » » 15 months ago, # ^ |   0 yes sort the gaps,before filling numbers My code: 68283299
•  » » » 15 months ago, # ^ | ← Rev. 2 →   0 Please help me i have done everything still this is not working on test 12 but working fine till 18 tests other than 12th one.Thanks in Advance.
•  » » » » 15 months ago, # ^ |   0 uncommented code is very difficult to read,try random test cases,compare the output with that of an accepted code
 » 15 months ago, # |   0 Editorial???
•  » » 15 months ago, # ^ |   +10
 » 15 months ago, # | ← Rev. 2 →   +28 div1 F O(3^n) can spend only 300msmy code
•  » » 15 months ago, # ^ |   +10 Impressive
 » 15 months ago, # |   +3 can someone tell me why i am getting tle on problem(B. Hyperset) here is my solution https://codeforces.com/contest/1287/submission/68274322
•  » » 15 months ago, # ^ |   0 Isn't string concat in C++ $O(n)$? In which case your approach is $O(n^2k^2)$.
•  » » » 15 months ago, # ^ |   +3 here is one solution(https://codeforces.com/contest/1287/submission/68268204) in which string concat is performed but it got accepted.
•  » » 15 months ago, # ^ |   0 you should change st=st+s[i] to st += s[i] read my comment above for a little explanation
•  » » »