03 2017 档案

Codeforces Round #407 (Div. 2) D. Weird journey(欧拉路)
摘要：D. Weird journey time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Little boy Igor wants t 阅读全文
posted @ 2017-03-31 19:12 贱人方 阅读(288) 评论(0) 推荐(0)
HDU 5669 Road（线段树建树）（分层图最短路）
摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5669 【分析】线段树建树+分层图最短路 阅读全文
posted @ 2017-03-29 18:19 贱人方 阅读(485) 评论(0) 推荐(0)
【bzoj2763】[JLOI2011]飞行路线 （分层图最短路）（优先队列dij）
摘要：【bzoj2763】[JLOI2011]飞行路线 2014年3月25日1,7260 Description Alice和Bob现在要乘飞机旅行，他们选择了一家相对便宜的航空公司。该航空公司一共在n个城市设有业务，设这些城市分别标记为0到n-1，一共有m种航线，每种航线连接两个城市，并且航线有一定的价 阅读全文
posted @ 2017-03-29 17:15 贱人方 阅读(253) 评论(0) 推荐(0)
Codeforces Round #406 (Div. 2) D. Legacy （线段树建图dij）
摘要：D. Legacy time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Rick and his co-workers have m 阅读全文
posted @ 2017-03-26 12:34 贱人方 阅读(493) 评论(0) 推荐(0)
BZOJ 2957: 楼房重建 (分块)
摘要：2957: 楼房重建 Description 小A的楼房外有一大片施工工地，工地上有N栋待建的楼房。每天，这片工地上的房子拆了又建、建了又拆。他经常无聊地看着窗外发呆，数自己能够看到多少栋房子。 为了简化问题，我们考虑这些事件发生在一个二维平面上。小A在平面上(0,0)点的位置，第i栋楼房可以用一条 阅读全文
posted @ 2017-03-22 18:51 贱人方 阅读(283) 评论(0) 推荐(0)
SPOJ BGSHOOT - Shoot and kill (线段树 区间修改 区间查询)
摘要：BGSHOOT - Shoot and kill no tags no tags The problem is about Mr.BG who is a great hunter. Today he has gone to a dense forest for hunting and killing 阅读全文
posted @ 2017-03-22 16:02 贱人方 阅读(365) 评论(0) 推荐(0)
Codeforces Round #404 (Div. 2) E. Anton and Permutation（树状数组套主席树 求出指定数的排名）
摘要：E. Anton and Permutation time limit per test 4 seconds memory limit per test 512 megabytes input standard input output standard output Anton likes per 阅读全文
posted @ 2017-03-17 21:53 贱人方 阅读(622) 评论(0) 推荐(1)
Lightoj-1356 Prime Independence(质因子分解)（Hopcroft-Karp优化的最大匹配）
摘要：题意： 找出一个集合中的最大独立集，任意两数字之间不能是素数倍数的关系。 思路： 最大独立集，必然是二分图。 最大数字50w，考虑对每个数质因子分解，然后枚举所有除去一个质因子后的数是否存在，存在则建边，考虑到能这样建边的数一定是质因子个数奇偶不同，所以相当于按奇偶区分建立了二分图，然后求二分图最大 阅读全文
posted @ 2017-03-15 22:50 贱人方 阅读(920) 评论(0) 推荐(0)
1087: Common Substrings （哈希）
摘要：1087: Common Substrings Time Limit:3000/1000 MS (Java/Others) Memory Limit:163840/131072 KB (Java/Others)Total Submissions:857 Accepted:112 Descriptio 阅读全文
posted @ 2017-03-14 16:56 贱人方 阅读(299) 评论(0) 推荐(0)
1090: MTM （费用流）
摘要：1090: MTM Time Limit:3000/1000 MS (Java/Others) Memory Limit:163840/131072 KB (Java/Others)Total Submissions:127 Accepted:19 Description MTM is not on 阅读全文
posted @ 2017-03-14 14:23 贱人方 阅读(297) 评论(0) 推荐(0)
HDU 2256 Problem of Precision （矩阵快速幂）（推算）
摘要：Problem of Precision Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1375 Accepted Submission(s): 阅读全文
posted @ 2017-03-11 14:09 贱人方 阅读(242) 评论(0) 推荐(0)
HDU 1757 A Simple Math Problem（矩阵快速幂）
摘要：A Simple Math Problem Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4544 Accepted Submission(s) 阅读全文
posted @ 2017-03-10 22:21 贱人方 阅读(195) 评论(0) 推荐(0)
SPOJ GSS2 - Can you answer these queries II（线段树 区间修改+区间查询）（后缀和）
摘要：GSS2 - Can you answer these queries II #tree #tree Being a completist and a simplist, kid Yang Zhe cannot solve but get Wrong Answer from most of the 阅读全文
posted @ 2017-03-10 11:29 贱人方 阅读(292) 评论(0) 推荐(0)
Codeforces Round #124 (Div. 1) C. Paint Tree（极角排序）
摘要：C. Paint Tree time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Paint Tree time limit p 阅读全文
posted @ 2017-03-09 21:57 贱人方 阅读(336) 评论(0) 推荐(0)
dutacm.club Water Problem（矩阵快速幂）
摘要：Water Problem Time Limit:3000/1000 MS (Java/Others) Memory Limit:163840/131072 KB (Java/Others)Total Submissions:1228 Accepted:121 [Submit][Status][Di 阅读全文
posted @ 2017-03-06 22:51 贱人方 阅读(455) 评论(0) 推荐(0)
dutacm.club 1094: 等差区间（RMQ区间最大、最小值，区间GCD）
摘要：1094: 等差区间 Time Limit:5000/3000 MS (Java/Others) Memory Limit:163840/131072 KB (Java/Others)Total Submissions:655 Accepted:54 Description 已知一个长度为 n 已知 阅读全文
posted @ 2017-03-06 22:41 贱人方 阅读(741) 评论(0) 推荐(0)
Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals ）D. Innokenty and a Football League（2-sat）
摘要：D. Innokenty and a Football League time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Innok 阅读全文
posted @ 2017-03-06 19:15 贱人方 阅读(301) 评论(0) 推荐(0)
Codeforces Round #394 (Div. 2) C. Dasha and Password（简单DP）
摘要：C. Dasha and Password time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output After overcoming t 阅读全文
posted @ 2017-03-05 20:51 贱人方 阅读(201) 评论(0) 推荐(0)
Codeforces Round #394 (Div. 2) E. Dasha and Puzzle（分形）
摘要：E. Dasha and Puzzle time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Dasha decided to hav 阅读全文
posted @ 2017-03-05 20:15 贱人方 阅读(183) 评论(0) 推荐(0)
CodeForces 348C Subset Sums(分块)（nsqrtn）
摘要：C. Subset Sums time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output You are given an array a1 阅读全文
posted @ 2017-03-04 21:53 贱人方 阅读(342) 评论(0) 推荐(0)
Coderforces 85 D. Sum of Medians（线段树单点修改）
摘要：D. Sum of Medians time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output In one well-known algo 阅读全文
posted @ 2017-03-03 13:20 贱人方 阅读(376) 评论(0) 推荐(0)
Codeforces 361D Levko and Array（二分）（DP）
摘要：Levko and Array time limit per test 2 seconds time limit per test memory limit per test 256 megabytes memory limit per test input standard input input 阅读全文
posted @ 2017-03-03 09:18 贱人方 阅读(410) 评论(0) 推荐(0)
codeforces 713C C. Sonya and Problem Wihtout a Legend(dp)（将一个数组变成严格单增数组的最少步骤）
摘要：E. Sonya and Problem Wihtout a Legend time limit per test 5 seconds memory limit per test 256 megabytes input standard input output standard output E. 阅读全文
posted @ 2017-03-02 22:54 贱人方 阅读(353) 评论(0) 推荐(0)
组合数取模
摘要：We have a large square grid with H rows and W columns. Iroha is now standing in the top-left cell. She will repeat going right or down to the adjacent 阅读全文
posted @ 2017-03-02 22:50 贱人方 阅读(397) 评论(0) 推荐(0)
SPOJ CIRU - The area of the union of circles （圆的面积并）
摘要：CIRU - The area of the union of circles no tags no tags You are given N circles and expected to calculate the area of the union of the circles ! Input 阅读全文
posted @ 2017-03-02 15:23 贱人方 阅读(402) 评论(0) 推荐(0)
POJ 1236 Network Of Schools (强连通分量缩点求出度为0的和入度为0的分量个数）
摘要：Network of Schools A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains 阅读全文
posted @ 2017-03-01 21:47 贱人方 阅读(291) 评论(0) 推荐(0)
Codeforces Round #283 (Div. 2) D. Tennis Game（模拟）
摘要：D. Tennis Game time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output D. Tennis Game time limit 阅读全文
posted @ 2017-03-01 16:37 贱人方 阅读(224) 评论(0) 推荐(0)