22485번 - Area Folding 스페셜 저지다국어

You are given one polygonal line, which is a collection of line segments. Your task is to calculate the sum of areas enclosed by the polygonal line.

A point is defined to be "enclosed" if and only if the point is unreachable without crossing at least one line segment from the point at infinity.

The first line contains one integers N (2 ≤ N ≤ 100). N is the number of segments.

Each of the following N lines consists of two integers X_i and Y_i (-10⁵ ≤ X_i, Y_i ≤ 10⁵, 1 ≤ i ≤ N) which represents a vertex. A polygonal line is the segments which connect (X_j, Y_j) and (X_j+1, Y_j+1) ((X_j, Y_j) ≠ (X_j+1, Y_j+1), 1 ≤ j ≤ N-1). The distance between a segment S_j and all vertices except the end points on segment S_j is guaranteed to be greater than 0.01.

Output the answer in a line. The answer may be printed with an arbitrary number of decimal digits, but may not contain an absolute or relative error greater than or equal to 10^-6.