刷题记录

题目#include<iostream>#include<string.h>#include<math.h>#include<stdio.h>#include<algorithm>#include<vector>using namespace std;typedef long long ll;const in...

DescriptionThere is a polygon A1A2…An (the vertices Ai are numbered in the clockwise order). On each side AiAi+1 an isosceles triangle AiMiAi+1 is built on the outer side of the polygon, and angle Ai...

#include<iostream>#include<string.h>#include<math.h>#include<stdio.h>#include<algorithm>#include<vector>using namespace std;const int N=1e3+7;const int maxp...

Description给定一些点的坐标，要求求能够覆盖所有点的最小面积的矩形，输出所求矩形的面积和四个顶点坐标Input第一行为一个整数n（3<=n<=50000）从第2至第n+1行每行有两个浮点数，表示一个顶点的x和y坐标，不用科学计数法Output第一行为一个浮点数，表示所求矩形的面积（精确到小数点后5位），接下来4行每行表示一个顶点坐标，要求第一行为y坐标最小的顶...

Problem DescriptionEach person had do something foolish along with his or her growth.But,when he or she did this that time,they could not predict that this thing is a mistake and they will want this ...

D. Large Triangletime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere is a strange peculiarity: if you connect the cities of Rostov, Taganro...

Problem DescriptionChika has just learned about solid geometry! She is very interested in the volume of three-dimensional geometric shapes, so she decides to test you.Before that, she is going to te...

题目两个凸包A,B，沿某一方向向量移动B,问是否与A有交两个图形A,B的闵可夫斯基和C={p0+p1|p0∈A,p1∈B}两个凸包的闵科夫斯基和仍然是凸包设p0∈A,p1∈B,方向向量V:满足b+V=a则V=a-b=a+(-b)则V是一个凸包，且是A,B的闵科夫斯基和我们先求A,B的闵科夫斯基和C判断每个向量是否在C中#include<iostream>#inclu...

Problem DescriptionAlice is interesting in computation geometry problem recently. She found a interesting problem and solved it easily. Now she will give this problem to you :You are given N distinc...

Problem DescriptionOn the planet Pandora, huge rocks are floating in the sky. Despite the beautiful scenery, these rocks bring some critical problem: they block the sunshine, and shade on the ground....

Problem DescriptionYou are a notable architect.Recently, a company invites you to design their new building for them. It is not an easy task, because they make some strange claims to the new buildin...

DescriptionThe main land of Japan called Honshu is an island surrounded by the sea. In such an island, it is natural to ask a question: “Where is the most distant point from the sea?” The answer to t...

题目给定顶点坐标均是整点（或正方形格点）的简单多边形，皮克定理说明了其面积S和内部格点数目n、边上格点数目s的关系：#include<iostream>#include<string.h>#include<math.h>#include<stdio.h>#include<algorithm>#include<vect...

DescriptionOnce upon a time, in a faraway land, there lived a king. This king owned a small collection of rare and valuable trees, which had been gathered by his ancestors on their travels. To protec...

Problem Description：Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.In the field of Cyberground, the pos...

DescriptionCalculate the number of toys that land in each bin of a partitioned toy box.Mom and dad have a problem - their child John never puts his toys away when he is finished playing with them. T...

DescriptionGiven n segments in the two dimensional space, write a program, which determines if there exists a line such that after projecting these segments on it, all projected segments have at leas...

DescriptionIt’s raining outside. Farmer Johnson’s bull Ben wants some rain to water his flowers. Ben nails two wooden boards on the wall of his barn. Shown in the pictures below, the two boards on th...

DescriptionWe all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will intersect in one of three ways: 1) no intersection because they are parallel, ...

DescriptionYou are to find the length of the shortest path through a chamber containing obstructing walls. The chamber will always have sides at x = 0, x = 10, y = 0, and y = 10. The initial and fina...

DescriptionStan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks such that ...

DescriptionThe most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y1999 and called it M11. It has only one eye o...

DescriptionThe GX Light Pipeline Company started to prepare bent pipes for the new transgalactic light pipeline. During the design phase of the new pipe shape the company ran into the problem of dete...

题目kuangbin模板#include<iostream>#include<string.h>#include<math.h>#include<stdio.h>#include<algorithm>#include<vector>using namespace std;const int N=1e5+7;...

Input输入数据包含多个测试实例，每个测试实例占一行，每行的开始是一个整数n(3&amp;amp;lt;=n&amp;amp;lt;=100)，它表示多边形的边数（当然也是顶点数），然后是按照逆时针顺序给出的n个顶点的坐标（x1, y1, x2, y2… xn, yn）,为了简化问题，这里的所有坐标都用整数表示。输入数据中所有的整数都在32位整数范围内，n=0表示数据的结束，不做处理。Output对于每个测试实例，请输...