Logo
(追記) (追記ここまで)

3800번 - Art Gallery 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 128 MB83242132.812%

문제

The art galleries of the new and very futuristic building of the Center for Balkan Cooperation have the form of polygons (not necessarily convex). When a big exhibition is organized, watching over all of the pictures is a big security concern. Your task is that for a given gallery to write a program which finds the surface of the area of the floor, from which each point on the walls of the gallery is visible. On the figure 1. a map of a gallery is given in some co-ordinate system. The area wanted is shaded on the figure 2.

입력

The number of tasks T that your program have to solve will be on the first row of the input file. Input data for each task start with an integer N, 5≤N≤1500. Each of the next N rows of the input will contain the co-ordinates of a vertex of the polygon – two integers that fit in 16-bit integer type, separated by a single space. Following the row with the co-ordinates of the last vertex for the task comes the line with the number of vertices for the next test and so on.

출력

For each test you must write on one line the required surface - a number with exactly two digits after the decimal point (the number should be rounded to the second digit after the decimal point).

제한

예제 입력 1

1
7
0 0
4 4
4 7
9 7
13 -1
8 -6
4 -4

예제 출력 1

80.00

힌트

출처

ICPC > Regionals > Europe > Southeastern European Regional Contest > SEERC 2002 D번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /