I have a few questions concerning competitive programming and the GCJ in particular. I, unfortunately, know only how to use Python.
Do you know a place where I can find very fast code (and simple to modify if possible) for most algorithms and data structures like maximum matching in bipartite graph and others in Python? I would like to use them to solve problems for the GCJ. As a specific example, for the GCJ 2019 round 2 problem 3, you have to use an algo to find maximum bipartite matching. But on the server, the hopcroftkarp library doesn’t work. So what should I use instead? Please note that I have a lot of experience in math, but unfortunately, I am new to competitive programming and I know very little about it. I am trying to become more efficient at writing code for competitive programming and do code reuse as much as possible instead of writing everything from scratch. Even if I know the solution, I am quite bad at implementing it fast. Also, Python seems sometimes on the slow side for GCJ. As an example, for the GCJ 2018 round 2 problem 2, my Python solution would work with a bound of 470 but not the 500 as demanded. Is it possible to do really well at the GCJ using only Python or are you at a significant disadvantage? It might seem evident, but do you have a good reference (maybe a book) for competitive programming (especially the GCJ but also for competitions that look like interviews for big tech companies)? Just by curiosity, does C++ have the algorithms and data structures libraries mentioned above that are easy and fast to use in competitive programming? I wish I would know it since all the best performers at GCJ seem to use only C++. I apologize for these very basic questions. It seems not so easy to find this information online for competitive programming. Thanks a lot for your time, Louis-François -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/be1c6220-7645-456e-b984-bc249aa749ab%40googlegroups.com.
