| Evaluation | Lists and Rankings | Classes | Online Judges | Study Material | Other Similar Courses |
Discord ("instant messaging" for questions and answers)
Evaluation
- Evaluation Formula
- Weekly Problems
- #00 - Introduction to the course and the online judges (not counting to grade)
- #01 - Sublinear complexity data structures (map, set, priority_queue)
- #02 - Sorting, binary search, ternary search, bisection
- #03 - Sqrt decomposition, segment trees and variants
- #04 - Cumulative sums and fenwick trees (BITs)
- #05 - Dynamic Programming I (classic)
- #06 - Dynamic Programming II (partitions, games, dags, counting, search)
- #07 - Graphs I (DFS, BFS, topological sorting, articulation points, bridges, euler paths, ssc)
- #08 - Graphs II (distances: Dijkstra, Bellman-Ford, Floyd; MST: Prim+Kruskall; max flow)
- #09 - Strings (KMP, Aho-Corasick, tries, suffix trees, suffix arrays)
- #10 - Computational Geometry (points, lines, polygons, intersections, areas, inclusion, convex hull)
- Competitive Events
- 1st Contest: 05 Nov (see results) [individual, ICPC style]
- 2nd Contest: 17 Dec (see results) [individual, partial points]
- 3rd Contest: 12 Feb (see results) [individual, partial points]
Lists and Rankings
(Predicted) Classes
- [24/09] #00 - Introduction to the course and the online judges
- [01/10] #01 - Sublinear complexity data structures (map, set, priority_queue)
- [08/10] #02 - Sorting, binary search, ternary search, bisection
- [15/10] #03 - Sqrt decomposition, segment trees and variants
- [22/10] #04 - Cumulative sums and fenwick trees (BITs)
- [29/10] No Classes (FCUP Activities Week)
- [05/11] 1st OnSite Contest
- [12/11] #05 - Dynamic Programming I (classic)
- [19/11] #06 - Dynamic Programming II (partitions, games, dags, counting, search)
- [26/11] #07 - Graphs I (DFS, BFS, topological sorting, articulation points, bridges, euler paths, ssc)
- [03/12] #08 - Graphs II (distances: Dijkstra, Bellman-Ford, Floyd; MST: Prim+Kruskall; max flow)
- [11/12] #09 - Strings (KMP, Aho-Corasick, tries, suffix trees, suffix arrays)
- [17/12] 2nd OnSite Contest
- [optional] #10 - Computational Geometry (points, lines, polygons, intersections, areas, inclusion, convex hull)
Online Judges
Study Material
- Awesome Competitive Programming (A curated list of awesome Competitive Programming, Algorithm and Data Structure resources)
- USACO Guide | resources (A free collection of curated, high-quality resources to take you from Bronze to Platinum and beyond.)
- Main recommended books (available for free):
- Other books:
- Algorithmic Tutorials:
- Implementations/Notebooks (you are strongly advised to implement by yourselves before seeing how others did)
Other Similar Courses
Pedro Ribeiro - DCC/FCUP | Last update:
