随笔分类 -  DFS

摘要:https://www.zhixincode.com/contest/7/problems A题 分类讨论 当B有点需要经过时 穿梭的花费肯定为2*k,也可以发现,我们要找到包含所有需要经过的点(不含起点)的最小矩形,端点肯定是传送门,排序,找到需要经过最小的值和最大的值,再分别找小于等于和大于等于 阅读全文
posted @ 2019-02-28 20:57 灬从此以后灬 阅读(403) 评论(0) 推荐(1)
摘要:Werewolf Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1381 Accepted Submission(s): 386 Probl 阅读全文
posted @ 2018-08-09 18:14 灬从此以后灬 阅读(143) 评论(0) 推荐(0)
摘要:C. Useful Decomposition time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output C. Useful Decompo 阅读全文
posted @ 2018-05-29 22:19 灬从此以后灬 阅读(165) 评论(0) 推荐(0)
摘要:题目链接 http://acm.hdu.edu.cn/downloads/CCPC2018-Hangzhou-ProblemSet.pdf B题 数论题 h(n)=∑ d|n φ(d) × n /d 求一个数的h值 我们只要意识到他是一个积性函数就解决了 这个函数看起来很像狄利克雷卷积 我们构造一个 阅读全文
posted @ 2018-04-23 22:25 灬从此以后灬 阅读(699) 评论(0) 推荐(0)
摘要:http://codeforces.com/contest/961 B题 可以将长度为k的连续区间转化成1 求最大和 解析 简单尺取 1 #include <stdio.h> 2 #include <math.h> 3 #include <string.h> 4 #include <stdlib.h 阅读全文
posted @ 2018-04-10 19:02 灬从此以后灬 阅读(225) 评论(0) 推荐(0)
摘要:http://codeforces.com/gym/100495 K题 草地的面积减去相交的面积,计算几何,垃圾题,避免不必要的计算损失精度(能约分的约分) 卡了老子一个星期了 再加前几天的一道题 这一星期真的是难受 什么都没干 AC代码 1 #include <stdio.h> 2 #includ 阅读全文
posted @ 2018-03-18 22:14 灬从此以后灬 阅读(217) 评论(0) 推荐(0)
摘要:Little Zu Chongzhi's Triangles Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 2195 Accepted Su 阅读全文
posted @ 2017-11-26 21:00 灬从此以后灬 阅读(228) 评论(0) 推荐(0)
摘要:Tree Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 373 Accepted Submission(s): 254 Problem De 阅读全文
posted @ 2017-11-15 21:59 灬从此以后灬 阅读(378) 评论(0) 推荐(0)
摘要:Prime Ring Problem Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 55053 Accepted Submission(s): 阅读全文
posted @ 2017-11-08 19:38 灬从此以后灬 阅读(902) 评论(0) 推荐(0)
摘要:AC代码 C. Andryusha and Colored Balloons time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C 阅读全文
posted @ 2017-09-03 21:35 灬从此以后灬 阅读(282) 评论(0) 推荐(0)
摘要:Network Saboteur Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 13494 Accepted: 6543 Description A university network is composed of N com 阅读全文
posted @ 2017-08-08 23:20 灬从此以后灬 阅读(193) 评论(0) 推荐(0)
摘要:Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a 阅读全文
posted @ 2017-08-07 00:00 灬从此以后灬 阅读(184) 评论(0) 推荐(0)
摘要:The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of 阅读全文
posted @ 2017-08-06 18:05 灬从此以后灬 阅读(143) 评论(0) 推荐(0)
摘要:Oil Deposits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31745 Accepted Submission(s): 18440 阅读全文
posted @ 2017-07-16 23:09 灬从此以后灬 阅读(216) 评论(0) 推荐(0)