算法
文章平均质量分 87
yasolx
ACMer
展开
-
HDU 4016 Magic Bitwise And Operation(dfs+剪枝)
Given n integers, your task is to pick k out of them so that the picked number are minimum when do bitwise “AND” among all of them.For example, there are three integers 5, 6 and 7. You are asked to pick two of them. Your possible strategy is (5, 6), (5, 7原创 2016-07-05 20:10:12 · 998 阅读 · 4 评论 -
HDU 2860 Regroup(并查集)
RegroupTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 968 Accepted Submission(s): 243Problem DescriptionWhen ALPC42 got to a pan原创 2016-07-08 21:09:34 · 665 阅读 · 0 评论 -
HDU 2333 && POJ 3497 && UVA 12124 Assemble(二分最大化最小值)
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3462 Accepted: 1102DescriptionRecently your team noticed that the computer you use to practice for programming con原创 2016-07-06 10:22:06 · 646 阅读 · 0 评论 -
HDU 2425 Hiking Trip(bfs+优先队列)
Hiking TripTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1582 Accepted Submission(s): 696Problem DescriptionHiking in the mount原创 2016-07-05 21:08:54 · 542 阅读 · 0 评论 -
HDU 4608 I-number(模拟)
I-numberTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3968 Accepted Submission(s): 1415Problem DescriptionThe I-number of x is原创 2016-07-05 20:30:07 · 553 阅读 · 0 评论 -
HDU 1067 Gap(哈希+bfs)
GapTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 995 Accepted Submission(s): 524Problem DescriptionLet's play a card game cal原创 2016-07-24 14:52:57 · 1112 阅读 · 0 评论 -
HDU 4536 XCOM Enemy Unknown(dfs)
XCOM Enemy UnknownTime Limit: 500/200 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1140 Accepted Submission(s): 345Problem DescriptionXCOM-Enemy Unk原创 2016-07-13 13:58:21 · 710 阅读 · 2 评论 -
HDU 4405 Aeroplane chess(概率dp)
Aeroplane chessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3119 Accepted Submission(s): 1993Problem DescriptionHzz loves aero原创 2016-07-13 16:54:19 · 530 阅读 · 0 评论 -
POJ 2987 Firing (最大权闭合图)
FiringTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 9823 Accepted: 2955DescriptionYou’ve finally got mad at “the world’s most stupid” employees of yo原创 2016-07-25 08:54:02 · 525 阅读 · 0 评论 -
Hdu 3812 Sea Sky (模拟_搜索)
原文链接:http://blog.csdn.net/woshi250hua/article/details/7614161题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3812题目大意:给定n个字符对ai,bi,表示ai和bi相连,现在要求求出从“sea”连接到"sky"的一个序列,序列中的字符串出现两次,长度转载 2016-07-14 21:33:02 · 646 阅读 · 0 评论 -
Codeforces Round #362 (Div. 1) A (696A) Lorenzo Von Matterhorn (LCA)
A. Lorenzo Von Matterhorntime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBarney lives in NYC. NYC has infinite number原创 2016-07-15 11:13:22 · 601 阅读 · 0 评论 -
HDU 3029 Scales(三进制)
ScalesTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 517 Accepted Submission(s): 233Problem DescriptionGive you a scale, a goods原创 2016-07-10 20:46:19 · 703 阅读 · 0 评论 -
POJ 3370 Halloween treats(抽屉原理)
Every year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how many children call on him, so it may happen that a child will get nothing if it is too late. To avoid conf原创 2016-07-10 21:07:06 · 495 阅读 · 0 评论 -
POJ 3421 X-factor Chains (整数分解+组合数)
X-factor ChainsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6496 Accepted: 2018DescriptionGiven a positive integer X, an X-factor chain of length原创 2016-07-15 21:20:01 · 865 阅读 · 0 评论 -
HDU 5773 The All-purpose Zero (DP)
The All-purpose ZeroTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 112 Accepted Submission(s): 44Problem Description?? gets an s原创 2016-07-28 18:30:00 · 430 阅读 · 0 评论 -
HDU 5098 Smart Software Installer(拓扑排序+贪心)
Smart Software InstallerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 677 Accepted Submission(s): 209Problem DescriptionThe sof原创 2016-07-22 09:25:05 · 708 阅读 · 0 评论 -
HDU 5792 World is Exploding (容斥原理+离散化+树状数组)
World is ExplodingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 330 Accepted Submission(s): 151Problem DescriptionGiven a seque原创 2016-08-03 09:01:05 · 729 阅读 · 0 评论 -
HDU 1365 & ZOJ 1456 Minimum Transport Cost(记录路径Floyd)
Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10091 Accepted Submission(s): 2749Problem DescriptionThese原创 2016-08-28 17:12:04 · 610 阅读 · 0 评论 -
POJ 1912 A highway and the seven dwarfs(O(log N)求直线与凸包是否相交)
A highway and the seven dwarfsTime Limit: 8000MS Memory Limit: 30000KTotal Submissions: 2454 Accepted: 485Case Time Limit: 3000MSDescriptionOnce upon a time,原创 2016-08-07 16:14:43 · 627 阅读 · 0 评论 -
POJ 3608 Bridge Across Islands(求两凸包间的最小距离)
Bridge Across IslandsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10108 Accepted: 2969 Special JudgeDescriptionThousands of thousands years ago t原创 2016-08-07 20:00:31 · 1144 阅读 · 7 评论 -
POJ 2978 Colored stones(状压DP+逆向思维)
Colored stonesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1887 Accepted: 882DescriptionYou are given a row of m stones each of which has one of k di原创 2016-09-09 16:15:57 · 566 阅读 · 0 评论 -
Codeforces 704A Thor (脑洞题)
A. Thortime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThor is getting used to the Earth. As a gift Loki gave him a原创 2016-08-08 09:35:27 · 1183 阅读 · 0 评论 -
POJ 2079 Triangle 题解 《挑战程序设计竞赛》
原文地址POJ 2079 Triangle凸包三角:求N个点组成的三角形的最大面积?3.6与平面和空间打交道的计算几何 凸包 不难想到最大三角形一定由凸包的顶点构成,难点在于怎么搜索。O(N^3)枚举会超时,旋转卡壳法O(N^2)解决问题。如图,先固定一条边(红色实线),然后搜索下一个顶点1st,三角形面积必然是先增后减的(极值在固定边的法线方向的最远点转载 2016-08-08 16:42:57 · 505 阅读 · 0 评论 -
Codeforces 711D Directed Roads(所有点出度为1的图反向边去环)
D. Directed Roadstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris the Baboon has explored Uday原创 2016-08-30 12:53:43 · 1134 阅读 · 0 评论 -
POJ 1236 Network of Schools(使DAG强联通最小加边数)
Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15788 Accepted: 6255DescriptionA number of schools are connected to a computer network.原创 2016-08-09 09:34:51 · 673 阅读 · 0 评论 -
Codeforces 707C Pythagorean Triples(已知直角三角形一边求另两边)
C. Pythagorean Triplestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputKatya studies in a fifth grade. Recently her cl原创 2016-08-21 07:52:47 · 1650 阅读 · 0 评论 -
Codeforces 388B Fox and Minimal path(构造最短路条数为N的图)
B. Fox and Minimal pathtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel wants to write a task for a programmi原创 2016-08-31 16:39:44 · 877 阅读 · 0 评论 -
UVa 11134 Fabled Rooks(贪心+优先队列)
题目链接题目大意: 在一个棋盘上,放置N个国际象棋的城堡,每个城堡给出可以放置的范围,要求这些城堡不能相互攻击到,求这些城堡的摆放方案。解题思路: 这题非常关键的一点就是横纵坐标可以分开独立考虑。对于每一个方向,我们维护一个下限小(其次上线小)的区间优先出堆的堆,以及当前要填充的坐标。每次去堆顶区间。如果上限小于要填充坐标说明无法填充。如果下限小于当原创 2016-08-31 18:49:44 · 452 阅读 · 0 评论 -
Codeforces 233C Partial Sums(特殊三角矩阵压缩)
C. Partial Sumstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou've got an array a, consisting of n integers. Th原创 2016-09-02 14:46:12 · 777 阅读 · 0 评论 -
ZOJ 1136&&POJ 1465 Multiple(BFS+同余定理)
MultipleTime Limit: 1000MS Memory Limit: 32768KTotal Submissions: 7215 Accepted: 1546Descriptiona program that, given a natural number N between 0 and 4999 (inclusi原创 2016-08-17 20:04:49 · 669 阅读 · 0 评论 -
HDU 4411 Arrest(Floyd+最小费用最大流)
ArrestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1932 Accepted Submission(s): 765Problem DescriptionThere are (N+1) cities o原创 2016-08-24 08:30:16 · 1013 阅读 · 0 评论 -
HDU 5821 Ball(贪心)
BallTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 138 Accepted Submission(s): 77Problem DescriptionZZX has a sequence of boxes原创 2016-08-11 19:18:24 · 497 阅读 · 0 评论 -
POJ 3420 Quad Tiling(轮廓线DP+矩阵快速幂)
Quad TilingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4076 Accepted: 1856DescriptionTired of the Tri Tiling game finally, Michael turns to a more原创 2016-08-24 09:44:15 · 1188 阅读 · 1 评论 -
Codeforces 706D Vasiliy's Multiset(异或字典树)
D. Vasiliy's Multisettime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAuthor has gone out of the stories about Vasili原创 2016-08-12 09:42:22 · 1197 阅读 · 0 评论 -
POJ 1678 I Love this Game!(博弈DP)
I Love this Game!Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2136 Accepted: 819DescriptionA traditional game is played between two players on a pool o原创 2016-09-02 20:22:22 · 409 阅读 · 0 评论 -
HDU 1536 S-Nim(SG博弈)
S-NimTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7117 Accepted Submission(s): 3012Problem DescriptionArthur and his sister Ca原创 2016-08-24 15:39:26 · 495 阅读 · 0 评论 -
UVa 10269 & ZOJ 1232 Adventure of Super Mario(最短路+DP)
题目链接题目大意: 马里奥在救出公主后要从城堡回家。有A个村庄,B个城堡,他现在在城堡A+B,要回到家1中,给出一些地点之间的距离。不过马里奥可以进行K次快速奔跑,每次不超过距离L,而且快速奔跑不能进过城堡,快速奔跑可以瞬间跑到目的地。求回家的最短距离。解题思路: 图上dp,我们可以先用Floyd求出任意两点不经过城堡的最短距离。然后很容易想到用dp原创 2016-08-24 20:10:49 · 616 阅读 · 0 评论 -
CSUOJ 1808 地铁(用map储存DP数组的DP)
1808: 地铁Time Limit: 5 Sec Memory Limit: 128 MBSubmit: 206 Solved: 22[Submit][Status][Web Board]Description Bobo 居住在大城市 ICPCCamp。ICPCCamp 有 n 个地铁站,用 1,2,…,n 编号。 m 段双向的地铁线路连接 n 个地铁站,原创 2016-09-03 21:34:01 · 1321 阅读 · 2 评论 -
POJ 1511 Invitation Cards(SPFA)
Invitation CardsTime Limit: 8000MS Memory Limit: 262144KTotal Submissions: 25322 Accepted: 8383DescriptionIn the age of television, not many people attend theater p原创 2016-08-25 10:05:02 · 476 阅读 · 0 评论 -
HDU 3608 0 or 1(求一个数因子和的奇偶)
0 or 1Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3460 Accepted Submission(s): 988Problem DescriptionSolving problem is a int原创 2016-08-26 09:45:45 · 801 阅读 · 0 评论