### Iron_man_3000love's blog

By Iron_man_3000love, 5 weeks ago,

Hello codeforces !

Muhammad_Saidul_Islam and I glad to invite you to our First round " Noobs Round #1 (div. 4) " .. The round will not be rated for any participants since it is unofficial.

You can virtually participate in the contest by clicking this link:

You can participate whenever you want, just click the link above and virtually participate. After enter in the problem-set we will give you 2.5 hours to solve the problem . After 2.5 hours you can not enter the problem-set again.

You will be given six tasks and 2.5 hours to solve them. The problems were created and prepared by Iron_man_3000love and Muhammad_Saidul_Islam for users with a rating range from 0 to 1400 But anyone is welcome to participate in the round!

We would like to thank everyone who was involved in the round preparation:

• wan-_-s ,AST_thecoder for testing the problems and providing useful feedback.
• MikeMirzayanov for Polygon and Codeforces platforms.
• You for participating in this round. Thanks!

Even though the contest is unrated we believe it is a really good way of practice, especially for Div 4 users. We tried our best to keep the statements short and clear and we hope you will like our problems!

Good luck and Have Fun !

• It's our First contest But we tried our best. So please consider our mistake . And if you find any unclear / wrong statement then please comment below .
• If you use any illegal way . we will remove you from standing !

N.B. Editorial will be posted September 28 by Muhammad_Saidul_Islam or Iron_man_3000love. And We will open it for practice after 27 September , requesting you to wait .

Congratulations to everyone !!

• +111

 » 5 weeks ago, # | ← Rev. 3 →   +5 You will be given six tasks and two hours to solve them. it's 2.5, isn't it?
 » 5 weeks ago, # |   +10 Statements are not clear at all sir. "if Alice or Bob go any box that called visited for both" and what does this line actually mean ?, looks like lack of English Translators.
 » 5 weeks ago, # |   +5 Problem B is same with recent problem on codechef ARRGAME
•  » » 5 weeks ago, # ^ |   +7 It's a practice contest for beginners. What are you expecting!?
•  » » » 5 weeks ago, # ^ |   +25 yeah, but
•  » » » 5 weeks ago, # ^ |   +4 Is it really any practice if you've solve the same problem before?
 » 5 weeks ago, # |   +19 I feel like I saw this announcement before. :thonk:
 » 5 weeks ago, # |   0 Can we get a div 5?
•  » » 5 weeks ago, # ^ |   +1 And here I was hoping for a Div 6. Maybe I expected too much
 » 5 weeks ago, # |   +2 How to solve F?
•  » » 5 weeks ago, # ^ | ← Rev. 2 →   +1 You solve the length part by dp. Make a 2D dp,where dp(i,j) means, maximum length subsequence upto i, such that the last letter is ('a'+j). Maximum length will then be the max of dp(n-1,j) for all j from 0 to 26. Let this be L.Then to reconstruct the answer, you can check from the end whether you should take this character or not. Find the first character for which dp(i,j) = L. Take this character and decrease L by 1. Then move to its index and continue from there.
 » 5 weeks ago, # |   0 Was problem D solved using greedy technique like some binary search stuffs. Or there was something else? If anyone can share the approach. Thanks!
•  » » 5 weeks ago, # ^ | ← Rev. 3 →   0 binary searchfirst sort the array then check for every element in array from 0 to mid are there different numbers which are greater than or equal to 3* element if yes return true else false codefor(int i=mid-1,j=v.size()-1;i>=0;i--,j-=2) if(v[i]<3*v[j] || v[i]<3v[j-1]) return false; return true;
•  » » » 5 weeks ago, # ^ |   +2 I did greedy. The max answer possible in n so its always optimal to get lowest n killed. So just sorr the array and then take two pointer one for person getting killed and others for their competition mates of higher energy
 » 5 weeks ago, # |   +26 Statements are written quite badly, more proofreading is required before making contests public...
•  » » 5 weeks ago, # ^ |   +7 I agree. Tasks need more explanations.
 » 5 weeks ago, # |   +46 First off, please don't take anything I say personally. I'm well aware of how difficult it is to prepare a contest, and I thank problem setters for taking the time to do this; I just want to provide feedback for next time. Kudos for successfully setting a round!Pros: I thought B was a very cute/nice problem (although a shame that apparently it's appeared on Codechef before, according to some other comment). The problems were a reasonable difficulty for Div 4 (maybe a little bit hard?). Cons:As others have mentioned, problem statements were difficult to parse and had lots of mistakes. In particular: Capitalization and Bolding: The way I skim problem statements is I look for visual cues like bold words to find the key components of the problem, and capitalization to see where sentences start and end. Sentences like "vovuh can select every three players and They fight between them." throw off the flow of reading because "They" is randomly capitalized in the middle. Lack of bold also means problem elements are hidden in the flavor text, increasing the likelihood of misunderstanding the problem. Lack of Latex/Pretty Formatting: When stuff isn't put in latex formatting, it's not immediately obvious it's a function/variable (e.g. I didn't realize n('A') was a function denoting the number of occurrences of 'A' in the string for a long time). The unformatted pseudocode in problem E was off-putting. I think $N$ and $a_i$ were also not formatted in some instances.
 » 5 weeks ago, # |   0 It felt like participating in div2 :D
 » 5 weeks ago, # |   0 Somebody, please explain D.
•  » » 5 weeks ago, # ^ |   0
 » 5 weeks ago, # |   +3 The fact that i cannot view contest after competing is so annoying.. people cannot upsolve and if they want to, they need to create alt accounts to do so which is annoying..Thanks for the contest btw.
 » 5 weeks ago, # |   +8 very bad description in problem A. You should give a clear statement as well as a clear image.
 » 5 weeks ago, # |   -10
 » 5 weeks ago, # |   0 How to solve B??
•  » » 5 weeks ago, # ^ |   0 They didn't correctly copy the conditions from Codechef. Check out the Codechef link in a comment above.