{"trustable":true,"prependHtml":"\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e\nYou want to hold a party. Here\u0027s a polygon-shaped cake on the table. You\u0027d like to cut the cake into several triangle-shaped parts for the invited comers. You have a knife to cut. The trace of each cut is a line segment, whose two endpoints are two vertices of the polygon. Within the polygon, any two cuts ought to be disjoint. Of course, the situation that only the endpoints of two segments intersect is allowed.\n\u003c/p\u003e\n\n\u003cp\u003e\nThe cake\u0027s considered as a coordinate system. You have known the coordinates of vexteces. Each cut has a cost related to the coordinate of the vertex, whose formula is \u003cvar\u003ecost\u003csub\u003ei, j\u003c/sub\u003e \u003d |x\u003csub\u003ei\u003c/sub\u003e + x\u003csub\u003ej\u003c/sub\u003e| * |y\u003csub\u003ei\u003c/sub\u003e + y\u003csub\u003ej\u003c/sub\u003e| % p\u003c/var\u003e. You want to calculate the minimum cost.\n\u003c/p\u003e\n\n\u003cp\u003e\n\u003cstrong\u003eNOTICE: input assures that NO three adjacent vertices on the polygon-shaped cake are in a line. And the cake is not always a convex.\u003c/strong\u003e\n\u003c/p\u003e\n\n\u003ch4\u003eInput\u003c/h4\u003e\n\n\u003cp\u003e\nThere\u0027re multiple cases. There\u0027s a blank line between two cases.\nThe first line of each case contains two integers, \u003cvar\u003eN\u003c/var\u003e and \u003cvar\u003ep\u003c/var\u003e (3 ≤ \u003cvar\u003eN, p\u003c/var\u003e ≤ 300), indicating the number of vertices. Each line of the following \u003cvar\u003eN\u003c/var\u003e lines contains two integers, \u003cvar\u003ex\u003c/var\u003e and \u003cvar\u003ey\u003c/var\u003e (-10000 ≤ \u003cvar\u003ex, y\u003c/var\u003e ≤ 10000), indicating the coordinate of a vertex. You have known that no two vertices are in the same coordinate.\n\u003c/p\u003e\n\n\u003ch4\u003eOutput\u003c/h4\u003e\n\n\u003cp\u003e\nIf the cake is not convex polygon-shaped, output \"I can\u0027t cut.\". Otherwise, output the minimum cost.\n\u003c/p\u003e\n\n\u003ch4\u003eSample\u003c/h4\u003e\n\u003ctable class\u003d\"vjudge_sample\"\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\u003e3 3\n0 0\n1 1\n0 2\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e0\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\n"}}]}