Algorithms, competitive programming, coding interviews. I make educational videos and coding live streams, always sharing my thought process.
My name is Kamil Dębowski (or Errichto) and I'm quite good at competitive programming. I'm a finalist of multiple big programming competitions like ICPC, Facebook Hacker Cup and Google Code Jam (even got 2nd place in 2018). I also organize competitions, which means inventing and preparing problems.
There is another very easy solution to this problem (maybe not as efficient) So it goes like this : First you make two copies of the given input array. ~O(N) Now you sort one of them by x coordinate and the other one by y coordinate. ~O(NlogN) Now in both lists, find out the pairwise distances (consecutive pairs only) and store the minimum found in both the sorted lists. ~O(N) Now simply return the minimum of the two minimums found ~O(N) So the overall complexity comes out to be O(NlogN). Hope this helps!
This is necrocommenting but maybe there is a chance to get an answer. Do you have a plan of learning hard algorithm or just use a "random walk", so find random articles/blog posts on the Internet and maybe follow references from them?
yo errichto i've heard you say in an interview with Joma tech that you've done most of 'introduction to algorithms' by Cormen and then after that your competitive programming skyrocketed; so you have done that book until what chapter please ?
ROU is a surprising abbreviation for Romania? Aren't they consistently at the top of these contests, as well as Math, Physics and others? It's a bit difficult to miss them...
1. What's happening? 2. What are their required tasks? 3. How is the point system graded/distributed? 4. Why are they on discord coding? 5. Why am I so hungry? 6. Why did Judas betray Jesus? 7. Why did you read all 7 questions?
Ah! Should have seen this video first. Learned Fenwick tree first and then this one. Could have avoided it. Nevertheless, no knowledge is ever wasted :) Thanks for the great explanation!
*Summary* *General Tournament Information:* * The video is about the 1v1 Coding Lockout Championship Finals. * There are three divisions: open, intermediate, and closed, based on rating. * Competitors are given 6 problems ranging from 100 to 600 points in difficulty. * First to 1100 points wins. If no one reaches 1100, whoever has the most points after 45 minutes wins. * Once a problem is solved by one competitor, the other competitor can't solve it. *Open Division Finals (Egor vs. KAN) (**1:40**):* * Egor started with the 300-point problem (Alternating Sum), but got a Wrong Answer. * KAN solved the 500-point problem (Tree Painting). * KAN continued to the 400-point problem (Tufarama), but mistakenly started solving the already solved 200-point problem (Binary Numbers and Sum), costing him valuable time. * Egor meanwhile solved the 300 and 200-point problems, taking the lead. * Both then focused on the 600-point problem (Cleaning Robots), a DP problem about partitioning a tree into disjoint paths. * Time ran out before either solved the 600-point problem, so KAN won with 900 points to Egor's 500. *Open Division Finals (Omnic vs. neal) (**1:16:00**):* * Omnic started with the 400-point problem (Numerical Sequence), a surprisingly easy problem from a Division 3 contest. * neal started with the 500-point problem (Illien Roads). * Omnic quickly solved the 400-point problem and moved onto the 500-point problem, solving it before neal. * They then raced on the 200-point problem, with neal submitting just a few seconds before Omnic. * The same thing happened on the 300-point problem (Rebus), with neal submitting just before Omnic again. * Omnic moved onto the 600-point problem (Alex and Complicated Task) while neal was still working on the 300. * Omnic solved the 600-point problem, winning the match with 1500 points to neal's 500. *Intermediate Division Finals (Stephduska vs. Sunny c-s-a-n-i):* * Close match with Sunny leading 300 to 200 before the 500-point problem (Fill the bag). * Both attempted the 500-point problem. Stephduska solved it first, securing the win with 700 points to Sunny's 300. *Post-match Discussion (**2:59:00**):* * The commentators and competitors discussed various strategic considerations for lockout tournaments, including the value of starting with different difficulty problems, the risks and benefits of holding submissions, and the potential for using misinformation through intentional wrong submissions. * The overall format of the tournament was deemed successful, but with potential improvements like best-of-three formats and possibly slightly harder problem sets for higher divisions. * The issue of forbidden problems due to contestants coming from different locations was raised as a challenge for future tournaments. *Overall Winner:* * Omnic won the Open Division, defeating Egor in the semi-finals and Eknerwala in the finals. i used gemini 1.5 pro to summarize the transcript
