搜索
文章平均质量分 93
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 · 996 阅读 · 4 评论 -
HDU 1560 DNA sequence(IDA*)
DNA sequenceTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2666 Accepted Submission(s): 1299Problem DescriptionThe twenty-f原创 2017-07-01 11:14:42 · 384 阅读 · 0 评论 -
HDU 6046 hash(搜索标识)
hashTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 122 Accepted Submission(s): 33Problem DescriptionQscqesze is busy at d原创 2017-07-28 11:16:48 · 496 阅读 · 0 评论 -
HDU 1043 Eight(康托展开)
EightTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23953 Accepted Submission(s): 6400Special JudgeProblem DescriptionThe 1原创 2017-06-30 21:21:57 · 541 阅读 · 0 评论 -
HDU Eight II(BFS+康托展开)
Eight IITime Limit: 4000/2000 MS (Java/Others) Memory Limit: 130000/65536 K (Java/Others)Total Submission(s): 2347 Accepted Submission(s): 504Problem DescriptionEight-puzzle, which i原创 2016-08-26 18:45:44 · 968 阅读 · 0 评论 -
POJ 2449 Remmarguts' Date(K短路)
Remmarguts' DateTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 30907 Accepted: 8438Description"Good man never makes girls wait or breaks an appointme原创 2017-08-27 15:15:43 · 388 阅读 · 0 评论 -
HDU 6196 happy happy happy(卡时剪枝)
happy happy happyTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 299 Accepted Submission(s): 86Problem Description Today, Bob plays with a原创 2017-09-12 15:56:57 · 532 阅读 · 0 评论 -
Codeforces 707D Persistent Bookcase(操作建树)
D. Persistent Bookcase time limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputRecently in school Alina has learned what are原创 2016-08-21 17:22:55 · 691 阅读 · 0 评论 -
HDU 5936 Difference(折半枚举)
DifferenceTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1247 Accepted Submission(s): 335Problem Description Little Ruins is playing a num原创 2017-10-28 15:49:42 · 624 阅读 · 0 评论 -
HDU 5723 Abandoned country (最小生成树+期望)
Abandoned countryTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2226 Accepted Submission(s): 572Problem DescriptionAn abandoned原创 2016-07-20 21:25:20 · 497 阅读 · 0 评论 -
hihoCoder1495 矩形分割(搜索+拆点)
时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Hi有一块由NxM个单位正方形组成的矩形。现在小Ho在某些单位正方形上画了一道分割线,这条分割线或者是单位正方形的主对角线(用'\'表示),或者是副对角线(用'/'表示)。 现在小Hi想知道这些分割线把NxM的矩形分割成了多少块区域。例如/\\/就把2x2的矩形分成原创 2017-04-02 15:17:46 · 1090 阅读 · 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 · 641 阅读 · 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 · 535 阅读 · 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 · 1104 阅读 · 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 · 705 阅读 · 2 评论 -
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 · 642 阅读 · 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 · 664 阅读 · 0 评论 -
HDU 5077 NAND(真值表状压)
NANDTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 457 Accepted Submission(s): 162Problem DescriptionXiaoqiang entered the “sh原创 2016-10-01 21:10:23 · 1402 阅读 · 0 评论 -
POJ 1419 Graph Coloring(最大独立集、最大团)
Graph ColoringTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5029 Accepted: 2340 Special JudgeDescriptionYou are to write a program that tries to原创 2017-03-12 13:17:15 · 760 阅读 · 0 评论 -
HDU 5952 Counting Cliques(无向图定向搜索)
Counting CliquesTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 3480 Accepted Submission(s): 1254Problem Description A clique is a complete原创 2017-11-21 21:37:11 · 583 阅读 · 0 评论