Codechef January Long Challenge starts in less than 24h.
Setters: VladProg, amit_dwivedi,rishup132, KMAASZRAA,sahi1422, Kalam, Morphy
Taster: Enchom
Statement Verifier: Xellos
Translators: Mediocrity [Russian], Team VNOI [Vietnamese], solaimanope [Bengali], Akash Shrivastava [Hindi], Ioser [mandarin]
I challenge top coders to AC everything in less than 5h.
See you in the ranklist!
do you mean January long challenge? :x
What is Taster? O_O
according to google translate: "a person employed to test food or drink (or problems) for quality by tasting it"
You get to taste the problemset first, I suppose. Yummy-yum.
Enchom And did you find it Yummy-yum?, The problem set. :P
Absolutely
How can I register?
Codechef doesn't require prior registration.
thank you
Your pepe profile is very haunting
(including both challenge problems)
To clarify — in the challenge problems, even a 0 score counts as AC, correct? (Since it is relative scoring)
There's an AC verdict and a WA verdict, which is independent of score. It's pretty damn hard to get so few points that they'd be rounded to 0 though.
That wouldn't be much of a challenge though.
How to solve ARMYOFME?
https://discuss.codechef.com/t/armyofme-video-solution/50232
How to solve ENGLISH?
What was the intended complexity for the solution to ENGLISH?
I saw solutions of order $$$O(n * (n + 1) / 2 * maxlen)$$$ that passed with a few optimizations
Yeah, I saw some solutions using trie which I think was intended and is fast enough but some solutions seemed to be using brute force with complexity same as what you wrote. Can anyone explain the solution to this question in detail please?
BRIEF EXPLANATION
You are given N words and the beauty of a pair of words (w1, w2) is computed as min(length of the common prefix between w1 and w2, length of the common suffix between w1 and w2) ^ 2.
Find a way to pair the N words such that the total beauty of all the pairs is maximum and it's ok not to pair a word at all.
Hope this helps.
Congrats to the winners!
Div 1.
Div 2.
Are codechef long challenge div1 problems similar to ICPC problems? Or are the made to be more time consuming?
I noticed some legends like ACRush solve everything in ~8h. When we have superhard problems it is solved in 2 or even 4 days.
The main difference with ICPC (other than partial scoring) is the tie-break problem, in which contestants spend a lot of time (in some problems the winner wrote more than 2^11 lines of code!).
Is there a resource for problems similar to challenge problems? Or any resources to learn how to solve them better?
CodeChef has some editorials. Unfortunately sometimes the editorialist is not well versed in approximate problems and we end up without editorial.
Also you can see topcoder marathon matches.