10 2016 档案

摘要:hdu-5933 思路: 贪心,首先要求总和是k的倍数,而又要求相邻,说明相邻的一块如果是sum/k的倍数,那么就地切割这样才能使操作数目最少; hdu-5934 思路: 强连通分量,可以找出强连通分量后缩点,然后选入度为0的引爆就是最小; hdu-5935 思路: 贪心,要求速度递增,那么从后往前 阅读全文
posted @ 2016-10-30 10:44 LittlePointer 阅读(557) 评论(0) 推荐(0) 编辑
摘要:B: 思路: 暴力,每两个判断一下; C: 思路: 容斥定理,先枚举脖子下面那个点和那个不可描述的点,算出所有的方案数,这里面有多的腿当成了脖子或者胳膊的,然后就再枚举这种情况把这些减去,又减多了; 再把那些两条腿都连在上半身的加上; D: 思路: 分块+前缀和,把sqrt(n)个数字放在一个块里面 阅读全文
posted @ 2016-10-28 16:39 LittlePointer 阅读(379) 评论(0) 推荐(0) 编辑
摘要:A 思路: 贪心,每次要么选两个最大的,要么选三个,因为一个数(除了1)都可以拆成2和3相加,直到所有的数都相同就停止,这时就可以得到答案了; C: 二分+bfs,二分答案,然后bfs找出距离小于等于当前要判断距离的点,把这些点标记后,再遍历按价格排好序的商店,从小到大选择价格低的, 根据最后的数目 阅读全文
posted @ 2016-10-24 16:02 LittlePointer 阅读(480) 评论(0) 推荐(0) 编辑
摘要:hdu-5127 思路: 本来正解好像是动态凸包,暴力10000+ms可以搞过去; hdu-5128 思路: 枚举两个长方形的对角线,然后判断是否不相交,更新答案就好; hdu-5130 思路: 将题给的条件变换后是求一个圆与多边形的面积交;将多边形三角剖分后求与圆的面积和; hdu-5131 思路 阅读全文
posted @ 2016-10-22 16:15 LittlePointer 阅读(230) 评论(0) 推荐(0) 编辑
摘要:题目链接: 4517: [Sdoi2016]排列计数 Description 求有多少种长度为 n 的序列 A,满足以下条件: 1 ~ n 这 n 个数在序列中各出现了一次 若第 i 个数 A[i] 的值为 i,则称 i 是稳定的。序列恰好有 m 个数是稳定的 满足条件的序列可能很多,序列数对 10 阅读全文
posted @ 2016-10-20 23:19 LittlePointer 阅读(260) 评论(0) 推荐(0) 编辑
摘要:A. Buy a Shovel time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Buy a Shovel time limi 阅读全文
posted @ 2016-10-18 16:52 LittlePointer 阅读(375) 评论(0) 推荐(0) 编辑
摘要:题目链接: The Next Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1766 Accepted Submission(s): 669 P 阅读全文
posted @ 2016-10-12 23:17 LittlePointer 阅读(183) 评论(0) 推荐(0) 编辑
摘要:题目链接: Find a path Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1557 Accepted Submission(s): 67 阅读全文
posted @ 2016-10-12 23:12 LittlePointer 阅读(150) 评论(0) 推荐(0) 编辑
摘要:题目链接: Queue Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1093 Accepted Submission(s): 566 Prob 阅读全文
posted @ 2016-10-11 23:58 LittlePointer 阅读(332) 评论(0) 推荐(0) 编辑
摘要:题目链接: 2243: [SDOI2011]染色 Description 给定一棵有n个节点的无根树和m个操作,操作有2类: 1、将节点a到节点b路径上所有点都染成颜色c; 2、询问节点a到节点b路径上的颜色段数量(连续相同颜色被认为是同一段),如“112221”由3段组成:“11”、“222”和“ 阅读全文
posted @ 2016-10-10 22:35 LittlePointer 阅读(173) 评论(0) 推荐(0) 编辑
摘要:题目链接: http://codeforces.com/contest/724 A. Checking the Calendar time limit per test 1 second memory limit per test 256 megabytes input standard input 阅读全文
posted @ 2016-10-10 16:12 LittlePointer 阅读(277) 评论(0) 推荐(0) 编辑
摘要:题目链接: A. Borya and Hanabi time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output time limit per 阅读全文
posted @ 2016-10-09 16:16 LittlePointer 阅读(267) 评论(0) 推荐(0) 编辑
摘要:题目链接: C. Artem and Array time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output time limit per 阅读全文
posted @ 2016-10-09 15:18 LittlePointer 阅读(451) 评论(0) 推荐(0) 编辑
摘要:题目链接: B. Andrey and Problem time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output time limit p 阅读全文
posted @ 2016-10-08 23:24 LittlePointer 阅读(479) 评论(0) 推荐(0) 编辑
摘要:题目链接: Sequence I Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 687 Accepted Submission(s): 262 阅读全文
posted @ 2016-10-08 17:09 LittlePointer 阅读(189) 评论(0) 推荐(0) 编辑
摘要:题目链接: I. Special Squares There are some points and lines parellel to x-axis or y-axis on the plane. If arbitrary chosen two lines parallel to x-axis a 阅读全文
posted @ 2016-10-07 19:38 LittlePointer 阅读(764) 评论(0) 推荐(0) 编辑
摘要:题目链接: Auxiliary Set Time Limit: 9000/4500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 521 Accepted Submission(s): 1 阅读全文
posted @ 2016-10-07 19:25 LittlePointer 阅读(703) 评论(0) 推荐(1) 编辑
摘要:题目链接: Basic Data Structure Time Limit: 7000/3500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 207 Accepted Submissio 阅读全文
posted @ 2016-10-06 20:51 LittlePointer 阅读(509) 评论(0) 推荐(0) 编辑
摘要:题目链接: Sequence II Time Limit: 9000/4500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 628 Accepted Submission(s): 1 阅读全文
posted @ 2016-10-06 10:38 LittlePointer 阅读(611) 评论(0) 推荐(0) 编辑
摘要:题目链接: Ugly Problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 363 Accepted Submission(s): 13 阅读全文
posted @ 2016-10-05 22:52 LittlePointer 阅读(850) 评论(0) 推荐(0) 编辑
摘要:题目链接: Meeting Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2024 Accepted Submission(s): 628 阅读全文
posted @ 2016-10-02 23:29 LittlePointer 阅读(876) 评论(0) 推荐(0) 编辑
摘要:题目链接: Ball Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2149 Accepted Submission(s): 897 Probl 阅读全文
posted @ 2016-10-01 23:33 LittlePointer 阅读(430) 评论(0) 推荐(0) 编辑
摘要:题目链接: Wall Painting Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2681 Accepted Submission(s): 阅读全文
posted @ 2016-10-01 23:28 LittlePointer 阅读(409) 评论(0) 推荐(0) 编辑
摘要:题目链接: C. Journey time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output time limit per test 3 s 阅读全文
posted @ 2016-10-01 09:55 LittlePointer 阅读(694) 评论(0) 推荐(0) 编辑
摘要:题目链接: B. Passwords time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output time limit per test 2 阅读全文
posted @ 2016-10-01 09:50 LittlePointer 阅读(510) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示