82 teams scored 5560 points on this task, for a maximum score of 100, an average score of 68 and a median score of 100.
Giorgio and Luca, while looking through old stuff in the basement of the OIS mansion, found a treasure map! However, the map has faded and is now impossible to understand the exact location of the hidden treasure. The map M can be represented as a two-dimensional grid with R rows and C columns, where each cell can either be land or sea. In particular, for the cell on the i-th row and j-th column, M[i][j] = 1 if the cell represents a portion of land, otherwise M[i][j] = 0 if it is part of the sea. They want to find the treasure at all costs and are ready to start a trip to visit all islands on the map. An island I can be defined as a set of land cells satisfying these three conditions: (1) Maximality. There are no land cells outside I sharing a side with a cell of I; (2) Connection. It is possible to move from any cell of I to any other cell of I by repeatedly moving between side-adjacent cells of I; (3) Insularity...