Algo Talk with Errichto: Joining Points
Kamil (Errichto) and I discuss a cool IOI problem called Joining Points! See our second video about a really cool problem Parade on his channel: • Algo Talk with SecondThread: Parade Original IOI Statement (from 2006): https://ioinformatics.org/page/ioi-20... Generalized Version to submit: https://codeforces.com/contest/1045/p... General version also appeared on this contest, if you read russian: https://codeforces.com/blog/entry/76716 Timestamps: 0:00 Good Morning! 1:10 Joining Points Statement 4:12 Spiral ideas + Line sweeps 9:33 Divide and Conquere Solution Idea 14:35 Runtime to n*log(n) 18:52 Generalized Version 19:50 Impossible Cases 22:43 Possible Cases 25:33 General Runtime 26:35 General runtime to n*log(n) 29:34 Similarities to Delaunay 30:35 Goodnight!

Algo Talk with SecondThread: Parade

My manager called it - Road to LGM

Algo Talk with Errichto: Robot Cleaning

The Most Courageous Competitive Programmer in ICPC World Finals

At Thanksgiving, My Sister Discovered I Had $15 Million And My Family Demanded. | Soft Revenge

Ones and Zeros Multiple (SPOJ / Polish Olympiad)

ASMR Best Triggers For Sleep Collection (No Talking) 3 Hours of Tapping & Scratching

Matrix Exponentiation + Fibonacci in log(N)

How I would learn Leetcode if I could start over

The Strange Math That Predicts (Almost) Anything

Road to LGM - Global Round 23 Highlights

The Best Competitive Programmer in the US

Episode 33 - Maximum Flow Intuition

This Problem keeps Math Olympians up at night...

Segment Tree Beats: Segment Tree On Steroids. Part 1

Segment tree beats | IOI preparation #6

Mastering Dynamic Programming - How to solve any interview problem

AlgorithmsThread 8: Tree Basics

How To Learn So Fast It’s Almost Unfair

