Hello CodeForces Community!
Chef is ready with 4 exotic dishes which will be served in September Lunchtime. We would like you to take part in Lunchtime and showcase your coding skills by eating all of the dishes. So pull up your socks and get ready for September LunchTime (https://www.codechef.com/LTIME52). Joining me on the problem setting panel, we have:
- Contest Admin: kingofnumbers (Hasan Jaddouh)
- Problem Setter: Ioser (Hanlin Ren)
- Problem Tester & Editorialist: Xellos (Jakub Safin)
- Language Verifier: (Priyank Jaini)
- Russian Translator: CherryTree (Sergey Kulik)
- Mandarin Translator: huzecong (Hu Zecong)
- Vietnamese Translator: Team VNOI
I hope you will enjoy solving them. Please give your feedback on the problem set in the comments below after the contest.
So, note down the details and be there when the contest starts:
Time: 30th September 2017 (1930 hrs) to (2230 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone.
Details: https://www.codechef.com/LTIME52
Registration: You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to register in order to participate.
Prizes:
- Top 10 performers in Global and Indian category will get CodeChef laddus, with which the winners can claim cool CodeChef goodies. Know more here: https://www.codechef.com/laddu. (For those who have not yet got their previous winning, please send an email to winners@codechef.com)
Good Luck! Hope to see you participating!!
One hour is left to start. This contest will have interesting problems for all levels of participants!
UPD: The contest starts in 5 minutes! (Hint: the geometry problem is always the hardest.)
The editorials are written, just gotta wait for them to be published. Meanwhile, hints for the last 2 problems:
The same algorithm as for counting palindromes in a shorter string: hashing+binsearch, just applied to q and differences of p. Some casework depending on whether the center of the palindrome is zero or non-zero.
Centroid decomposition. Think about how to solve subtask 3 using it.
Centroid decomposition. Needs using twice, separately on tree 1 and tree 2. Needs some work on compressing tree 2 depending on which subtree of tree 1 we're processing.
"CHEFTRAF" is quite heavy-coding.
I am 11th, please tell me that only top 10 getting free laddus ?
P.S. If answer yes and I am getting nothing, you give 33 extra laddus that I can finally buy one t-shirt... (4th long , 11th here, top 3 challenge and first to solve one task were enough to get something :D)
They do not have the stock of T-shirts since May (consistently mailing them). I left that dream (of having Codechef tshirt) now.
May ? I am waiting since last year xD
Last year ? I won t-shirt 28.6.2015 :P
The stock has been updated and now codechef T-shirts are available.
Why aren't solutions of other participants visible??
Also as always solution of tester and editorialist aren't visible. Please fix this!!