CF 105537C - Capybara Cozy Carnival
We are given a convex polygon with $n$ vertices arranged in order, forming the boundary of a “cake.” Each vertex must be assigned one of $k$ colors.
CF 105537C - Capybara Cozy Carnival
Rating: -
Tags: -
Solve time: 28s
Verified: no
Solution
Problem Understanding
We are given a convex polygon with $n$ vertices arranged in order, forming the boundary of a “cake.” Each vertex must be assigned one of $k$ colors. Additionally, there are $m$ non-crossing diagonals drawn inside the polygon, and these diagonals split the polygon into $m+1$ regions.
The coloring restriction is not local to the original polygon edges only. Two vertices are considered adjacent in a constraint sense if they either lie next to e