Checker Problem Solution from COCI 2019-2020 #2
This problem involves verifying whether a given set of diagonals forms a valid triangulation of a convex polygon and, if so, whether the coloring of edges satisfies the "very good" condition. Key Observations The first input value T denotes the subtask number, not the number of test cases....