随笔分类 -  计算几何

摘要:Triangle Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 9525 Accepted: 2845 Description Given n distinct points on a plane, your task is t 阅读全文
posted @ 2017-01-30 21:35 Candy? 阅读(322) 评论(0) 推荐(0) 编辑
摘要:Beauty Contest Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 36113 Accepted: 11204 Description Bessie, Farmer John's prize cow, has just 阅读全文
posted @ 2017-01-30 10:25 Candy? 阅读(226) 评论(0) 推荐(0) 编辑
摘要:Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 9022 Accepted: 3992 Description Your friend to the south is interested in building fen 阅读全文
posted @ 2017-01-28 20:04 Candy? 阅读(257) 评论(0) 推荐(0) 编辑
摘要:The Fortified Forest Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 6400 Accepted: 1808 Description Once upon a time, in a faraway land, t 阅读全文
posted @ 2017-01-28 19:51 Candy? 阅读(365) 评论(0) 推荐(0) 编辑
摘要:Grandpa's Estate Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 13112 Accepted: 3697 Description Being the only living descendant of his g 阅读全文
posted @ 2017-01-28 19:01 Candy? 阅读(374) 评论(0) 推荐(0) 编辑
摘要:Scrambled Polygon Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 8636 Accepted: 4105 Description A closed polygon is a figure bounded by a 阅读全文
posted @ 2017-01-28 17:25 Candy? 阅读(545) 评论(0) 推荐(0) 编辑
摘要:Wall Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 36057 Accepted: 12310 Description Once upon a time there was a greedy King who ordered 阅读全文
posted @ 2017-01-28 16:42 Candy? 阅读(190) 评论(0) 推荐(0) 编辑
摘要:Q:皮克定理这种一句话的东西为什么还要写学习笔记啊? A:多好玩啊... PS:除了蓝色字体之外都是废话啊... Part I 1.顶点全在格点上的多边形叫做格点多边形(坐标全是整数) 2.维基百科 Given a simple polygon constructed on a grid of eq 阅读全文
posted @ 2017-01-28 15:48 Candy? 阅读(1689) 评论(0) 推荐(0) 编辑
摘要:Area Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 19642 Accepted: 5376 Description You are going to compute the area of a special kind o 阅读全文
posted @ 2017-01-28 12:38 Candy? 阅读(224) 评论(0) 推荐(0) 编辑
摘要:A Round Peg in a Ground Hole Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 6682 Accepted: 2141 Description The DIY Furniture company spec 阅读全文
posted @ 2017-01-28 11:30 Candy? 阅读(235) 评论(0) 推荐(0) 编辑
摘要:Intersecting Lines Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 15145 Accepted: 6640 Description We all know that a pair of distinct poi 阅读全文
posted @ 2017-01-28 10:36 Candy? 阅读(247) 评论(0) 推荐(0) 编辑
摘要:An Easy Problem?! Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12970 Accepted: 1995 Description It's raining outside. Farmer Johnson's b 阅读全文
posted @ 2017-01-27 19:52 Candy? 阅读(176) 评论(0) 推荐(0) 编辑
摘要:Pick-up sticks Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 12861 Accepted: 4847 Description Stan has n sticks of various length. He thr 阅读全文
posted @ 2017-01-27 18:18 Candy? 阅读(471) 评论(0) 推荐(0) 编辑
摘要:The Doors Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 8334 Accepted: 3218 Description You are to find the length of the shortest path t 阅读全文
posted @ 2017-01-27 16:08 Candy? 阅读(245) 评论(0) 推荐(0) 编辑
摘要:Segments Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13514 Accepted: 4331 Description Given n segments in the two dimensional space, wr 阅读全文
posted @ 2017-01-27 11:40 Candy? 阅读(235) 评论(0) 推荐(0) 编辑
摘要:TOYS Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 14433 Accepted: 6998 Description Calculate the number of toys that land in each bin of 阅读全文
posted @ 2017-01-26 22:28 Candy? 阅读(389) 评论(0) 推荐(0) 编辑