{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cbr\u003eIn the game \u0027Heroes of keyboard and mouse\u0027 there are some cities at the plane; each city is situated in a point. The player can build some new cities. All the cities are surrounded by a polygonal wall of minimal length. When a city is built, the wall may be rebuilt to include it. Your task is to determine the area inside the wall each time a new city is built. Of course, the cities are in distinct points.\u003cbr\u003e\u003cdiv align\u003d\"left\" style\u003d\"margin-top: 1.0em;\"\u003e\u003cb\u003eInput\u003c/b\u003e\u003c/div\u003eThe game starts with three cities with coordinates (\u003ci\u003ex\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e,\u003ci\u003ey\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e), (\u003ci\u003ex\u003c/i\u003e\u003csub\u003e2\u003c/sub\u003e,\u003ci\u003ey\u003c/i\u003e\u003csub\u003e2\u003c/sub\u003e) and (\u003ci\u003ex\u003c/i\u003e\u003csub\u003e3\u003c/sub\u003e,\u003ci\u003ey\u003c/i\u003e\u003csub\u003e3\u003c/sub\u003e), which are given in the first line of the input. The initial area inside the wall is non-negative. The second line of the input contains single integer \u003ci\u003eN\u003c/i\u003e (1≤ \u003ci\u003eN\u003c/i\u003e≤ 100000), being the number of cities to be built. Each of the next \u003ci\u003eN\u003c/i\u003e lines contains the coordinates of a city to be built. All the coordinates are integer and do not exceed 10\u003csup\u003e8\u003c/sup\u003e by absolute value.\u003cbr\u003e\u003cdiv align\u003d\"left\" style\u003d\"margin-top: 1.0em;\"\u003e\u003cb\u003eOutput\u003c/b\u003e\u003c/div\u003eThe \u003ci\u003eK\u003c/i\u003e-th line of the output (1≤ \u003ci\u003eK\u003c/i\u003e≤ \u003ci\u003eN\u003c/i\u003e) must contain an integer, being the doubled area inside the wall after building \u003ci\u003eK\u003c/i\u003e first cities (as listed in the input, not including the first three).\u003cbr\u003e"}},{"title":"Sample 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e1 0 0 3 3 2\n5\n1 2\n2 1\n3 0\n2 3\n0 1\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e8\n8\n12\n14\n16\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"","value":{"format":"HTML","content":"\u003cbr\u003e\nNovosibirsk SU Contest #2, by Novosibirsk Team #1"}}]}