Today the ACM ICPC 2016 Brazil Sub-Regionals contest was held, featuring 12 problems and having more than 600 teams trying to advance to the Latin America Regional Finals that will happen in November. I created this thread so we can talk about the problems in the contest.↵
The problems can be viewed in this link (Portuguese): http://maratona.ime.usp.br/maratona.pdf↵
↵
A — Simple ad-hoc↵
↵
B —(?) Dynamic programming on DAG, binary search, square root decomposition↵
↵
C — Shortest Paths Modelling (i have a tutorial on this: http://mirror.codeforces.com/blog/entry/45897)↵
↵
D — Simple maths↵
↵
E —(?DP over subsets (bitmask dp)↵
↵
F —(?)Graphs↵
↵
G — Range Sum Query 2D↵
↵
H — Simple palindrome check↵
↵
I — Greedy algorithm↵
↵
J —(?) Something similar to convex hull trickSweep line↵
↵
K —(?)DP, geometry↵
↵
L — DFS to check connected components↵
↵
My team solved 7 problems, we also tried to solve B and J but failed. Btw we have advanced to the regional finals! :D
The problems can be viewed in this link (Portuguese): http://maratona.ime.usp.br/maratona.pdf↵
↵
A — Simple ad-hoc↵
↵
B —
↵
C — Shortest Paths Modelling (i have a tutorial on this: http://mirror.codeforces.com/blog/entry/45897)↵
↵
D — Simple maths↵
↵
E —
↵
F —
↵
G — Range Sum Query 2D↵
↵
H — Simple palindrome check↵
↵
I — Greedy algorithm↵
↵
J —
↵
K —
↵
L — DFS to check connected components↵
↵
My team solved 7 problems, we also tried to solve B and J but failed. Btw we have advanced to the regional finals! :D