ACM ICPC Beginner Competitive Programming 5 Trees

>> YOUR LINK HERE: ___ http://youtube.com/watch?v=N-wrpjeX-TE

Welcome back to your journey through competitive programming! ACM ICPC at UCLA is back with Beginner CP: a continuation of the popular Introduction to Competitive Programming workshop from Fall 2020. • Continuing with Graphs and modeling various relations, this time we're going to cover Trees! Join us to learn more about seeds, roots, leaves and photosynthesis! Kidding, of course :) • A tree is a special kind of graph with a very natural inherent structure. From representing the file structure of your computer to most familial structures, they are a really useful and simple data structure. Moreover, they are seen all the time in CP in some way or another. • For our Valentine's Day Weekend edition of Beginner CP, we will study graphs! Graphs are a data type that can model all kinds of relations (even romantic ones 😉). These graphs store all kinds of valuable information, and searching allows us to answer questions like what's the shortest path to my valentine ? Graphs are seen all the time in competitive programming and are a very fundamental concept. We'll cover some exciting algorithms such as BFS, DFS, cycle detection and more! ✨ • Whether you are completely new to CP, an expert looking for a quick review, or just an algorithm and problem-solving enthusiast, we promise you will find the workshops interesting and fun! • ⏱ Timeline • 00:00 Recap and Hash Maps • 15:49 Trees and Spanning Trees • 27:30 Problem A: firetrucksarered • 37:52 MSTs and Prim's Algorithm • 53:41 Problem B: lostmap • 1:08:03 Feedback Form • 1:08:54 Contest • Website: https://icpc.uclaacm.com

#############################

New on site