This week's episode features monsoon as a special guest. Tomasz Idziaszek was an ICPC World Finalist from 2005 and a TCO Finalist from 2004-2005. He is an author of over 100 problems, including many hard and interesting problems from Algorithmic Engagements. He was an editor for the polish educational magazine Delta and the famous competitive programming book "Looking for a Challenge?". In 2018 he was a problem setter for the IOI. He also maintains the website http://www.algonotes.com/ that offers interesting educational materials on advanced algorithms.
In this episode we discuss the history behind "Looking for a Challenge?" and his famous problem Termites (online judge), which was included in the book. This problem is truly beautiful and I hope many of you will enjoy the episode.
Update: Anyone interested in the getting a copy of the Looking for a Challenge book can find information in this blog post. You can also solve the recommended Woodworms task by seeing the problem statement at this link and on an online judge in this link.
Huh. I've never seen algonotes before but it looks really high quality from the content there so far.
Auto comment: topic has been updated by tehqin (previous revision, new revision, compare).
You can solve the problem here: https://szkopul.edu.pl/problemset/problem/-Y5h4NdpbUjmI2CzEC23hTDb/site/?key=statement
The statement is only in Polish, but you can see the English statement above.
I will try to upload the English version as well, but later...
Do you know if there is an online judge for the Termites problem?
Sure: https://szkopul.edu.pl/problemset/problem/Wa4p6tM-ZrLBEsLFQF1ZTAZf/site/?key=statement
Thank you. I added your link to the description. :)
There is this basic problem Deque from a recent AtCoder dp practice contest. Its the coins in a row problem you talked about in the video. You are supposed to do the n^2 dp solution but you can practice the O(n) solution too. Here is my implementation of it. Btw. found the episode really entertaining to watch, great job!
I'm glad. I slept poorly the night before recording this episode and was a bit tired. So I didn't sound as excited as I was. Discussing this problem with Tomasz was really fun. :) My personal favorite part was the two games induction proof of the greedy move principle.
I'm glad there is AtCoder included this problem in their DP round so people can implement the O(n) coins solution. Your implementation is very clean. Nice work!
Auto comment: topic has been updated by tehqin (previous revision, new revision, compare).