(Hard) Servers from BOI 2021, O(N*log(N)) solution @Errichto2
(Hard) Servers from BOI 2021, O(N*log(N)) solution  @Errichto2
Uploaded April 2021 | Updated November 2026, 3 hours ago
I will implement a more efficient solution for problem Servers boi2021.de/wp-content/uploads/2021/04/statement-boi2021-1-servers-en.pdf
Official editorial: boi2021.de/wp-content/uploads/2021/04/servers-spoiler.pdf

Streaming schedule: calendar.google.com/calendar/embed?src=0qldhlvr0oqd867pdi8nkm8s04%40group.calendar.google.com

- FAQ & GitHub Wiki: github.com/Errichto/youtube/wiki/FAQ
- Discord: discord.gg/YWb3Bmg
- Twitch: twitch.tv/errichto
- Main YT channel with educational videos: youtube.com/errichto
(Hard) Servers from BOI 2021, O(N*log(N)) solutionCodeforces Round #694 Solutions(Hard) Number Theory, Atcoder Grand Contest 50 E(Hard) Atcoder Grand Contest 49 ECodeforces Problem-Solving (short stream)Facebook Hacker Cup UpsolvingLeetcode Coding Interview Problems live!Codeforces 718 (Div. 1 + 2)Can AI solve Codeforces problems?(Hard) Atcoder Grand Contest 48 (chat at https://www.twitch.tv/errichto)AtCoder Beginner Contest 479Codeforces #673 Screencast (6th place)
Errichto Hard Algorithms |

(Hard) Servers from BOI 2021, O(N*log(N)) solution

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER