eolymp
bolt
Try our new interface for solving problems
Problems

Icebergs

Icebergs

Tania is a marine biologist. Her goal is to measure the impact of climate change on the population of Macaroni penguins. As most species of penguins, Macaroni penguins live in the southern hemisphere, near Antarctica. Tania is primarily focused on the population of Macaroni penguins near the "Iles Nuageuses" (in English, "Cloudy Islands").

During summer, the ice around the islands melts and the islands become too small to host all the birds. Some penguins live on the icebergs floating around. For her study, Tania needs to measure the area of those icebergs.

Using satellite imagery and image recognition, Tania has obtained a map of the icebergs, and your goal is to measure their area. The island studied by Tania is quite small and the Earth can locally be approximated as a flat surface. Tania’s map thus uses the usual 2D Cartesian coordinate system, and areas are computed in the usual manner. For instance, a rectangle parallel to the axes defined by the equations x1xx2 and y1yy2 has an area of (x2 - x1) * (y2 - y1).

In Tania’s representation, an iceberg is a polygon represented by its boundary. For each iceberg Tania has noted the sequence of points p1, ..., pk defining the border of the iceberg. The various icebergs never touch each other and they never overlap. Furthermore the boundary p1, ..., pk of an iceberg is always a “simple” polygon, i.e. no two segments in [p1; p2], ..., [pk; p1] cross each other.

Input

The first line contains an integer n (1n1000), describing the number of polygons. Then n blocks of lines follow, each describing a polygon and composed of:

– on the first line, an integer P (3P50), the number of points defining the polygon border, – on the next P lines, two space-separated integers x and y (0x, y106), the coordinates of each border point.

Output

The output should contain a single integer: the total area rounded to the nearest integer below. In other words, the output should be a single line containing a single integer I such that the total area A of the polygons described in the input is comprised between I included and I + 1 excluded (IA < I + 1).

Time limit 1 second
Memory limit 128 MiB
Input example #1
1
4
0 0
1 0
1 1
0 1
Output example #1
1
Input example #2
2
5
98 35
79 90
21 90
2 36
50 0
3
0 0
20 0
0 20
Output example #2
6100
Source 2019 ACM Southwestern Europe Regional Contest (SWERC), Paris, January 26 (2020), Problem F