计算几何
say_c_box
小白不能不努力~
展开
-
POJ1127——Jack Straws(计算几何,直线相交)
Jack StrawsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4059 Accepted: 1836DescriptionIn the game of Jack Straws, a number of plastic or wooden "st原创 2016-07-28 12:21:05 · 407 阅读 · 0 评论 -
POJ3347 Kadj Squares(计算几何)
Kadj SquaresTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3296 Accepted: 1307DescriptionIn this problem, you are given a sequence S1, S2, ..., Sn of原创 2017-08-31 14:09:59 · 398 阅读 · 0 评论 -
POJ1696 space ant(计算几何,极角排序)
Space AntTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4656 Accepted: 2925DescriptionThe most exciting space discovery occurred at the end of the 20原创 2017-08-31 14:04:52 · 461 阅读 · 0 评论 -
POJ410 Intersection 计算几何
IntersectionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15317 Accepted: 4008DescriptionYou are to write a program that has to decide whether a giv原创 2017-08-31 13:37:09 · 347 阅读 · 0 评论 -
POJ066 Treasure Hunt(计算几何)
Treasure HuntTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7387 Accepted: 3046DescriptionArcheologists from the Antiquities and Curios Museum (ACM) ha原创 2017-08-31 13:34:41 · 599 阅读 · 0 评论 -
POJ2653 Pick-up sticks(计算几何)
Pick-up sticksTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 13739 Accepted: 5210DescriptionStan has n sticks of various length. He throws them one a原创 2017-08-31 13:09:36 · 456 阅读 · 0 评论 -
POJ1556——The Doors 计算几何,最短路
The DoorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9012 Accepted: 3458DescriptionYou are to find the length of the shortest path through a chamb原创 2017-08-30 16:22:51 · 493 阅读 · 0 评论 -
POJ1269——Intersecting Lines(计算几何,直线关系判断)
Intersecting LinesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16680 Accepted: 7191DescriptionWe all know that a pair of distinct points on a plane原创 2017-08-30 16:18:48 · 372 阅读 · 0 评论 -
POJ3304 Segments(计算几何,线段和直线的交点)
SegmentsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15325 Accepted: 4859DescriptionGiven n segments in the two dimensional space, write a progra原创 2017-08-30 16:11:08 · 426 阅读 · 0 评论 -
POJ2318 TOYS(叉积,计算几何)
TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16234 Accepted: 7786DescriptionCalculate the number of toys that land in each bin of a partitioned原创 2017-08-30 15:59:28 · 301 阅读 · 0 评论 -
计算几何模板——凸包
bool cmp_x(const point &a,const point &b){ if(a.x!=b.x) return a.x<b.x; return a.y<b.y;}vector ps;vector convex_hull(){ int n=(int)ps.size(); sort(ps.begin(),ps.end(),cmp_x)原创 2017-08-19 23:27:05 · 226 阅读 · 0 评论 -
计算几何模板——点类以及线段类
#include#include#include#include#include#include#include #include #include #include using namespace std;const int MAXN = 5000+10;const int INF=1e9+7;const double eps=1e-8;const double pi原创 2017-08-16 20:21:37 · 914 阅读 · 0 评论 -
计算几何模板——点类
const double eps=1e-8;const double pi=acos(-1.0);//计算几何误差修正//输入为一个double类型的数,返回-1表示负数,1表示正数,0表示x为0int cmp(double x){ if(fabs(x)<eps) return 0; if(x>0) return 1; return -1;}/原创 2017-08-16 16:26:36 · 298 阅读 · 0 评论 -
POJ1228——Grandpa's Estate(计算几何,凸包)
Grandpa's EstateTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12618 Accepted: 3540DescriptionBeing the only living descendant of his grandfather, Ka原创 2016-07-29 10:09:32 · 392 阅读 · 0 评论 -
POJ2398——Coneology(计算几何,扫描线)
ConeologyTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 3771 Accepted: 739DescriptionA student named Round Square loved to play with cones. He would原创 2016-07-28 13:50:42 · 396 阅读 · 0 评论 -
CodeForces - 55D——Beautiful numbers (数位dp)
D. Beautiful numberstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVolodya is an odd boy and his taste is原创 2017-10-08 12:24:25 · 383 阅读 · 0 评论