ACM ICPC 2016 Brazil Sub-Regionals

Revision en6, by skavurskaa, 2016-09-12 03:49:51

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):

A — Simple ad-hoc

B — Dynamic programming on DAG, binary search, square root decomposition

C — Shortest Paths Modelling (i have a tutorial on this:

D — Simple maths

E — DP over subsets (bitmask dp)

F — Graphs

G — Range Sum Query 2D

H — Simple palindrome check

I — Greedy algorithm

J — Sweep line

K — DP, geometry

L — DFS to check connected components

My team solved 7 problems (A,C,D,G,H,I,L), we also tried to solve B and J but failed. Btw we have advanced to the regional finals! :D


  Rev. Lang. By When Δ Comment
en6 English skavurskaa 2016-09-12 03:49:51 16 Tiny change: '7 problems, we also ' -> '7 problems (A,C,D,G,H,I,L), we also '
en5 English skavurskaa 2016-09-12 03:44:08 110
en4 English skavurskaa 2016-09-11 03:00:10 17 Tiny change: '-Regionals, featurin' -> '-Regionals contest was held, featurin'
en3 English skavurskaa 2016-09-11 02:59:01 0 (published)
en2 English skavurskaa 2016-09-11 02:38:39 22 (saved to drafts)
en1 English skavurskaa 2016-09-11 02:38:12 966 Initial revision (published)