HDU
sxk_sxy
努力用自己辛勤的汗水,成为一名真正的ACMer
展开
-
2014ACM/ICPC亚洲区广州站 && HDU Song Jiang's rank list (排序)
Song Jiang's rank listTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 805 Accepted Submission(s): 410Problem Description《Shui Hu Zh原创 2015-10-04 16:01:17 · 621 阅读 · 0 评论 -
HDU 1075 What Are You Talking About (Trie)
What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 16042 Accepted Submission(s): 5198Problem Descriptio原创 2015-07-16 11:54:42 · 781 阅读 · 0 评论 -
HDU 1495 非常可乐 (DFS)
题目链接:非常可乐解析:一个瓶子,容量为s,两个杯子,容量分别为n和m,问最少多少次倾倒才能将一瓶可乐均分为两份。直接模拟每次的倾倒,然后递归求解。可以加个预判的条件,要是s是奇数的时候,无论如何也是分不均的。AC代码:#include #include #include using namespace std;int s, n, m, ans原创 2015-08-23 20:22:48 · 975 阅读 · 0 评论 -
HDU 1241 Oil Deposits (DFS)
题目链接:Oil Deposits解析:问有多少个“@”块,其中每个块内的各个“@”至少通过八个方向之一相邻。直接从“@”的地方开始向相邻八个方向搜索,每搜到一个格子,就将它替换成“.”,一次搜索就会搜索完一个块,记录搜索的次数为答案。AC代码:#include #include #include using namespace std;char原创 2015-08-23 17:33:18 · 525 阅读 · 0 评论 -
HDU 2612 Find a way (BFS)
题目链接:Find a way解析:使用两次bfs从“Y”和“M”的位置分别使用bfs搜出各自到所有“@”点的最短时间在遍历所有“@”点,求出最小的最短时间。AC代码:#include #include #include using namespace std;char mz[205][205];int vis[205][205],原创 2015-08-23 13:36:11 · 584 阅读 · 0 评论 -
HDU 1075 What Are You Talking About (strings)
What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 15966 Accepted Submission(s): 5177Problem Descriptio原创 2015-07-13 10:37:07 · 765 阅读 · 0 评论 -
HDU 1671 Phone List (Trie)
Phone ListTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12879 Accepted Submission(s): 4391Problem DescriptionGiven a list of原创 2015-07-13 09:32:25 · 553 阅读 · 0 评论 -
HDU 1251 统计难题 (Trie)
统计难题Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 22182 Accepted Submission(s): 9391Problem DescriptionIgnatius最近遇到一个难题,老师交给原创 2015-07-13 08:21:16 · 896 阅读 · 0 评论 -
HDU 2072 单词数 (STL map)
单词数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 34960 Accepted Submission(s): 8380Problem Descriptionlily的好朋友xiaoou333最近很空,他原创 2015-05-03 18:34:53 · 685 阅读 · 0 评论 -
HDU 1203 I NEED A OFFER! (01背包)
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18689 Accepted Submission(s): 7492Problem DescriptionSpeakless很早原创 2015-05-03 17:35:24 · 754 阅读 · 0 评论 -
BestCoder Round #32
1001 PM2.5Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionNowadays we use cont原创 2015-03-07 22:40:37 · 482 阅读 · 0 评论 -
BestCoder Round #33
zhx's submissionsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 858 Accepted Submission(s): 233Problem DescriptionAs one o原创 2015-03-15 12:54:02 · 723 阅读 · 0 评论 -
hdu 1087 Super Jumping! Jumping! Jumping! (LIS)
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24549 Accepted Submission(s): 10838Problem Desc原创 2015-03-02 20:44:11 · 752 阅读 · 0 评论 -
hdu 1443 Joseph (约瑟夫环)
JosephTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1741 Accepted Submission(s): 1076Problem DescriptionThe Joseph's prob原创 2015-01-23 17:18:28 · 1571 阅读 · 0 评论 -
hdu 1217 Arbitrage (Floyd + 最大路径)
AC代码:#include #include #include #include #include using namespace std;#define INF 123456#define MAX_V 35#define MAX_E 1005double d[MAX_V][MAX_V];int n, m;void Floyd(){ for(int k=1;原创 2015-01-21 17:38:33 · 743 阅读 · 0 评论 -
HDU 2243 考研路茫茫――单词情结 (AC自动机 + 矩阵快速幂)
题目链接: 考研路茫茫――单词情结做本题前,个人建议先做一下POJ 2778http://blog.csdn.net/u013446688/article/details/47378255POJ2778 是求长度为n,不包含模式串的字符串个数。而本题是求长度为n,包含模式串的字符串个数。直接用字符串总数减去不包含模式串的字符串个数即为所求。同样是原创 2015-08-10 15:39:26 · 1110 阅读 · 2 评论 -
HDU 2222 Keywords Search (AC自动机)
题目链接:Keywords Search解析:直接开个end数组,统计一下即可。AC代码:#include using namespace std;const int max_word = 500005;const int sigma_size = 26;const int max_text = 1000005;struct Trie{原创 2015-07-31 15:41:00 · 568 阅读 · 0 评论 -
HDU 3065 病毒侵袭持续中 (AC自动机)
题目链接:病毒侵袭持续中解析:用end数组标记病毒编号,用used数组记录各个病毒出现的次数,最后对应输出即可。AC代码:#include using namespace std;const int maxn = 1002;const int max_word = 52;const int max_text = 2000002;const i原创 2015-08-01 00:01:45 · 622 阅读 · 0 评论 -
2013 ACM-ICPC吉林通化全国邀请赛 && HDU 4496 D-City (并查集)
题目链接:D-City解析:一般的思路应该是先将任意两点之间不在询问中的各边连起来,然后再按照倒序将询问的边一个一个加入并查集,同时记录联通块数即可。但是,这样试了一下,老是MLE和TLE,这题能卡住这种常规的做法。因为题意没这么复杂。。。仔细读题才发现:最后会将所有的边都删去,也就是说,最后一定是n个联通块,而且所有边都删除之后,则倒着操作的起始并查集里没有有一条边。然后就可以向原创 2015-10-01 16:42:40 · 782 阅读 · 0 评论 -
2013 ACM-ICPC吉林通化全国邀请赛 && HDU 4493 Tutor (水)
TutorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3411 Accepted Submission(s): 910Problem DescriptionLilin was a student of Tonghu原创 2015-10-02 16:45:28 · 858 阅读 · 0 评论 -
2013 ACM-ICPC吉林通化全国邀请赛 && HDU 4499 Cannon (搜索)
AC代码:#include using namespace std;int n, m, q;int g[10][10];int ans;void dfs(int x, int y, int cnt){ if(x >= n){ //搜索结束 ans = max(ans, cnt); return ; } if(y >=原创 2015-10-02 15:33:57 · 631 阅读 · 0 评论 -
HDU 1043 && POJ 1077 Eight (A*)
题目链接:HDU 1043 POJ 1077解析:A*算法搜索中选择路径的条件:f = g + hg:搜索深度h:当前状态所有格点与目标状态对应格点曼哈顿距离。(曼哈顿距离:横纵坐标差值的绝对值之和)中间还有一个剪枝:只有起始状态和目标状态的奇偶性相同时,才有解,否则,直接输出无解。AC代码:#inc原创 2015-09-07 13:08:18 · 599 阅读 · 0 评论 -
HDU 2102 A计划 (BFS + 预处理)
题目链接:A计划解析:三维的搜索,但是只有两层。先将地图预处理:两层对应位置都是‘#’的和一层是‘#’一层是‘*'的,两层都处理成’*‘。再bfs即可。AC代码:#include #include #include #include #include using namespace std;char mz[2][12][12];bool原创 2015-09-11 07:29:37 · 486 阅读 · 0 评论 -
HDU 2181 哈密顿绕行世界问题 (DFS)
题目链接:哈密顿绕行世界问题解析:将每个点的相邻三个点按字典序存放,直接dfs即可。AC代码:#include using namespace std;int city[30][5];int vis[30];int pre[30];int m;int cnt;void print_ans(int cur){ if(cur !=原创 2015-09-09 19:51:45 · 559 阅读 · 0 评论 -
HDU 3567 Eight II (A*)
题目链接:Eight II解析:还是八数码问题,当然还是A*了,只不过这次要加上预处理才行。先枚举出‘X’的位置,然后用前驱表保存所有情况然后直接回溯就行了,不用再搜了。AC代码:#include #include #include #include #include #include #include using namespac原创 2015-09-08 15:32:13 · 1316 阅读 · 3 评论 -
HDU 3341 Lost's revenge (AC自动机 + DP)
题目链接:Lost's revenge解析:n个模式串,一个目标串。问目标串通过任意次交换字符最多能包含的模式串个数。(允许重叠)字符最长是40只需要记录ACGT出现的次数。如果使用5维数组,显然超内存了。假设ACGT的总数分别为num[0],num[1],num[2],num[3]那么对于ACGT的数量分别为ABCD的状态可以记录为: (网上大神讲的原创 2015-08-18 10:39:53 · 653 阅读 · 0 评论 -
HDU 3247 Resource Archiver (AC自动机 + BFS + 状态压缩DP)
题目链接:Resource Archiver解析:n个正常的串,m个病毒串,问包含所有正常串(可重叠)且不包含任何病毒串的字符串的最小长度为多少。AC自动机 + bfs + 状态压缩DP用最短路预处理出状态的转移。可以优化很多AC代码:#include #include #include #include #include using name原创 2015-08-18 11:39:04 · 730 阅读 · 0 评论 -
HDU 2457 DNA repair (AC自动机 + DP)
题目链接:DNA repair解析:给出n个致病DNA序列,给一段DNA片段,问最少修改多少个碱基才能修复这段DNA序列中的所有致病序列。AC自动机 + DP。将n个致病DNA序列构成一个自动机。令DP[i][j]表示长度为i走到节点j是所需改变的最少个数。状态转移时,枚举下一步所有可能的碱基,然后判断该碱基是否达到匹配状态,若能,则安全转移,继续枚举下一个碱基;否则在原创 2015-08-17 11:49:59 · 644 阅读 · 0 评论 -
HDU 2296 Ring (AC自动机 + DP)
题目链接:Ring解析:m个有价值的串,字符串s在字符串str中的价值 = s在str中出现的次数 × s的价值。问价值最大的长度为n的串是什么。本题需要输出字典序最小的在DP的时候开一个数组记录结果即可。AC代码:#include #include #include #include #include using namespace std;原创 2015-08-15 17:37:25 · 633 阅读 · 0 评论 -
HDU 2825 Wireless Password (AC自动机 + 状态压缩DP)
题目链接:Wireless Password解析:给 m 个单词构成的集合,统计所有长度为 n 的串中,包含至少 k 个单词的方案数。AC自动机 + 状态压缩DP。DP[i][j][k]:长度为i的字符串匹配到状态j且包含k个magic word的可能字符串个数。AC代码:#include #include #include #include #原创 2015-08-15 16:09:43 · 675 阅读 · 0 评论 -
HDU 2896 病毒侵袭 (AC自动机)
题目链接:病毒侵袭解析:利用end数组记录各病毒的编号,然后统计即可。AC代码:#include using namespace std;const int maxn = 502;const int max_word = 202;const int max_text = 10002;const int sigma_size = 128;s原创 2015-07-31 23:27:57 · 563 阅读 · 0 评论 -
POJ 1083 && HDU 1050 Moving Tables (贪心)
Moving TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20302 Accepted Submission(s): 6889Problem DescriptionThe famou原创 2014-11-15 00:52:29 · 1563 阅读 · 0 评论 -
hdu 1596 find the safest road (Dijksrta算法)
find the safest roadTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7536 Accepted Submission(s): 2664Problem DescriptionXX原创 2015-01-21 22:29:01 · 937 阅读 · 0 评论 -
hdu 1385 Minimum Transport Cost (Floyd + 字典序打印路径)
Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7822 Accepted Submission(s): 2028Problem DescriptionT原创 2015-01-21 13:52:33 · 865 阅读 · 0 评论 -
hdu 1142 A Walk Through the Forest (Dijkstra + 记忆化搜索)
A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5984 Accepted Submission(s): 2211Problem Description原创 2015-01-21 11:38:59 · 875 阅读 · 0 评论 -
HDU 1722 Cake (GCD)
CakeTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2609 Accepted Submission(s): 1253 Problem Description一次原创 2014-11-27 21:14:31 · 1267 阅读 · 2 评论 -
HDU 1060 Leftmost Digit (数论)
Leftmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13680 Accepted Submission(s): 5239Problem DescriptionGiven a原创 2014-11-27 21:04:12 · 954 阅读 · 0 评论 -
HDU 2399 GPA
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2502 Accepted Submission(s): 1469Problem DescriptionEach course grade is one of原创 2014-11-03 20:01:28 · 1134 阅读 · 0 评论 -
HDU 1170 Balloon Comes!
Balloon Comes!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20356 Accepted Submission(s): 7673Problem DescriptionThe cont原创 2014-11-03 19:53:35 · 1565 阅读 · 0 评论 -
HDU 2317 Nasty Hacks
Nasty HacksTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2299 Accepted Submission(s): 1816Problem DescriptionYou are the原创 2014-11-03 19:48:30 · 1043 阅读 · 0 评论