Competitive Programming (CC3036)

	Presentations
	Pedro Ribeiro - DCC/FCUP

Problem Presentations

Date: 22nd of January of December, 2020
Room: to be defined
Duration: each presentation should be prepared to last around 10 to 12 minutes
(send a PDF of any slides you want to use beforehand until 8h30m of that day )
What to present: give a rough idea of the problem and explain your solution to it, including if possible complexities and any difficulties you had.
You can create auxiliary images, show code, use the board, or any other method you prefer, but the idea is that your colleagues can understand the main points of your solution

Time	Student	Problem	Volume
9:00	Leonardo Santos	[CodeForces 818F] - Level Generation (graphs + ternary search)	2
9:15	Inês Rocha	[SPOJ LITE] - Light Switching (segment tree + range updates w/ lazy propagation)	3
9:30	Rúben Dhanaraju	[SPOJ RACETIME] - Race Against Time (sqrt decomposition, range queries + single update )	3
9:45	Carlos Pinto	[SPOJ HORRIBLE] - Horrible Queries (BIT with range update + range query)	4
10:00	Vasco Cruz	[SPOJ CCOST] - Calculate The Cost (BITs - "naive" will not fit on memory)	4
10:15	Guilherme Guia	[SPOJ MIXTURES] - Mixtures (Matrix Chain Multiplication variation)	5
10:30	Duarte Pereira	[UVA 959] - Car Rallying (DP in DAGs)	6
10:45	José Ferreira	[UVA 11420] - Chest of Drawers (DP Counting - non "trivial" state)	6
11:00	Tomás Mamede	[UVA 11283] - Playing Boggle (Trie + DFS with backtracking)	7
11:30	Nuno Soares	[UVA 872] - Ordering (Topological Sorting)	8
11:15	Niklas Lupkes	[CodeForces 508D] - Tanya and Password (Euler Path)	8
11:45	Fábio Reis	[SPOJ ARBITRAG] - Arbitrage (Floyd-Warshall or Bellman-Ford)	9
12:00	Wouter van Lil	[UVA 12144] - Almost Shortest Path (Dijkstra Adaptation)	9

Pedro Ribeiro - DCC/FCUP | Last update: 3/2/2020 00:28:56