随笔分类 -  计算几何-其他

摘要:1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 struct Point 10 { 11 bool flag; 12 double x; 13 double... 阅读全文
posted @ 2017-10-15 19:59 weeping 阅读(261) 评论(0) 推荐(0) 编辑
摘要:没时间复习这个了,暂时用来当模板,以后再来写下自己的模板 阅读全文
posted @ 2017-10-15 19:53 weeping 阅读(174) 评论(0) 推荐(0) 编辑
摘要:1 struct Point{double x,y;}; 2 struct Circle{Point c;double r;}; 3 double dist(Point a,Point b){ 4 return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)); 5 } 6 Circle ... 阅读全文
posted @ 2017-10-15 15:22 weeping 阅读(226) 评论(0) 推荐(0) 编辑
摘要:搬运别人的 https://vjudge.net/problem/SPOJ-CIRUT 阅读全文
posted @ 2017-10-15 14:52 weeping 阅读(274) 评论(0) 推荐(0) 编辑
摘要:地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=1700 题目: Points on Cycle Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/O 阅读全文
posted @ 2017-10-12 15:09 weeping 阅读(104) 评论(0) 推荐(0) 编辑
摘要:地址:http://poj.org/problem?id=1981 题目: Circle and Points Time Limit: 5000MS Memory Limit: 30000K Total Submissions: 8198 Accepted: 2924 Case Time Limit 阅读全文
posted @ 2017-10-12 14:34 weeping 阅读(412) 评论(0) 推荐(0) 编辑
摘要:地址:http://poj.org/problem?id=1673 题目: EXOCENTER OF A TRIANGLE Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3637 Accepted: 1467 Descripti 阅读全文
posted @ 2017-10-11 22:13 weeping 阅读(221) 评论(0) 推荐(0) 编辑
摘要:地址:http://poj.org/problem?id=1106 题目: Transmitters Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 5405 Accepted: 2873 Description In a wir 阅读全文
posted @ 2017-10-11 22:11 weeping 阅读(241) 评论(0) 推荐(0) 编辑
摘要:地址:http://poj.org/problem?id=1329 题目: Circle Through Three Points Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3970 Accepted: 1667 Descr 阅读全文
posted @ 2017-10-11 20:37 weeping 阅读(217) 评论(0) 推荐(0) 编辑
摘要:地址:http://poj.org/problem?id=1434 题目:Fill the Cisterns! Fill the Cisterns! Time Limit: 5000MS Memory Limit: 10000K Total Submissions: 4131 Accepted: 1 阅读全文
posted @ 2017-10-11 18:57 weeping 阅读(218) 评论(0) 推荐(0) 编辑
摘要:地址:http://poj.org/problem?id=1177 题目: Picture Time Limit: 2000MS Memory Limit: 10000K Total Submissions: 12905 Accepted: 6817 Description A number of 阅读全文
posted @ 2017-10-11 16:50 weeping 阅读(195) 评论(0) 推荐(0) 编辑
摘要:题目: Atlantis Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 23758 Accepted: 8834 Description There are several ancient Greek texts that co 阅读全文
posted @ 2017-10-11 15:22 weeping 阅读(483) 评论(0) 推荐(0) 编辑
摘要:地址:http://poj.org/problem?id=2954 题目: Triangle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6006 Accepted: 2576 Description A lattice po 阅读全文
posted @ 2017-10-08 17:20 weeping 阅读(206) 评论(0) 推荐(0) 编辑
摘要:地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=6206 题目: Apple Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Tota 阅读全文
posted @ 2017-09-18 12:50 weeping 阅读(195) 评论(0) 推荐(0) 编辑
摘要:题面: B. Tell Your World time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output B. Tell Your World 阅读全文
posted @ 2017-09-01 23:49 weeping 阅读(142) 评论(0) 推荐(0) 编辑
摘要:题目:Statements Dreamoon likes algorithm competitions very much. But when he feels crazy because he cannot figure out any solution for any problem in a 阅读全文
posted @ 2017-08-07 22:07 weeping 阅读(339) 评论(0) 推荐(0) 编辑
摘要:地址:http://codeforces.com/gym/101174/attachments 题目:pdf,略 思路: 把每个人的(x1,x2)抽象成点(xi,yi). 当1号比i号排名高时有==>a(x1-xi)+b(y1-yi)>=0 把(x1-xi,y1-yi)看着向量,(a,b)看做向量。 阅读全文
posted @ 2017-07-19 21:08 weeping 阅读(543) 评论(1) 推荐(1) 编辑
摘要:地址:http://codeforces.com/problemset/problem/70/D 题目: D. Professor's task time limit per test 1 second memory limit per test 256 megabytes input standa 阅读全文
posted @ 2017-03-07 22:44 weeping 阅读(653) 评论(0) 推荐(0) 编辑
摘要:地址:http://poj.org/problem?id=1755 题目: Triathlon Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 6931 Accepted: 1797 Description Triathlon i 阅读全文
posted @ 2017-02-09 19:18 weeping 阅读(314) 评论(0) 推荐(0) 编辑
摘要:地址:http://poj.org/problem?id=3384 题目: Feng Shui Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 5551 Accepted: 1667 Special Judge Descripti 阅读全文
posted @ 2017-02-07 21:47 weeping 阅读(817) 评论(0) 推荐(0) 编辑