CS-E4595 - Competitive Programming D, Lecture, 5.9.2022-30.11.2022
Kurssiasetusten perusteella kurssi on päättynyt 30.11.2022 Etsi kursseja: CS-E4595
Osion kuvaus
-
HOMEWORK BEFORE WEEK 7
In week 7 we are continuing with the theme of graph algorithms. The topics are the lowest common ancestors in trees, representing graphs as matrices, and flows. Read about LCA in chapter 18.3, Floyd-Warshall algorithm in chapter 13.3 and Ford-Fulkerson algorithm in chapter 20.1 in the Competitive Programmer’s Handbook. Prefereably also implement all of them: LCA, Matrix representation, Flow
MONDAY CONTEST
On Monday (October 18), we will have a solo contest.
The contest will be available at cses.fi/414/list/. The contest will automatically open at 16.20 sharp, and it will end at 17.50 sharp. Please make sure you use your personal CSES user account to take part in the contest.
Once the contest is over, please fill in the form below to record your score.
WEDNESDAY CONTEST
On Wednesday (October 20), we will have a team contest. We will assign students to teams at random at 16.15, so please be in the class room punctually!
The contest will be available at cses.fi/415/list/. The contest will automatically open at 16.20 sharp, and it will end at 17.50 sharp.
We will create one CSES account for each team. Please make sure all team members use the same team account to take part in the contest.
Once the contest is over, please fill in the form below to record your score.
HOMEWORK FOR WEEK 8
(Will be announced later.)