- 博客(44)
- 资源 (1)
- 收藏
- 关注
原创 Tsinsen 题目A1393. Palisection(回文树)
A1393. Palisection时间限制:2.0s 内存限制:256.0MB 总提交次数:395 AC次数:144 平均分:59.15将本题分享到: 查看未格式化的试题 提交 试题讨论试题来源 CODEFORCES 17E问题描述 给你一个长度 n (1
2015-10-30 18:54:45 535
原创 Codeforce 2014ACM-ICPC, Asia Xian Regional Contest Problem G. The Problem to Slow Down You(回文树)
Problem G. The Problem to Slow Down YouDescriptionAfter finishing his homework, our problem setter Federmann decided to kill time by hangingaround online. He found a cool chat room that discusses c
2015-10-30 15:25:44 891
原创 HDOJ 题目2224 The shortest path||POJ 题目2677 Tour(双调TSP)
The shortest pathTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1050 Accepted Submission(s): 535Problem DescriptionThere are n p
2015-10-28 23:59:28 407
原创 HDOJ 题目1401 Solitaire(双向BFS)
SolitaireTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3850 Accepted Submission(s): 1165Problem DescriptionSolitaire is a game
2015-10-28 21:48:00 688
原创 POJ 题目1915 Knight Moves(双向BFS)
Knight MovesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 23530 Accepted: 11049DescriptionBackground Mr Somurolov, fabulous chess-gamer indeed, assert
2015-10-26 20:50:35 308
原创 HDOJ 题目1195 Open the Lock(双向BFS)
Open the LockTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5402 Accepted Submission(s): 2417Problem DescriptionNow an emergent
2015-10-26 18:09:32 332
原创 HDOJ 题目3257 Hello World!(模拟)
Hello World!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 554 Accepted Submission(s): 208Problem DescriptionYour task is to pri
2015-10-26 13:28:09 364
原创 HDOJ 题目4000 Fruit Ninja(树状数组)
Fruit NinjaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2137 Accepted Submission(s): 830Problem DescriptionRecently, dobby is
2015-10-26 11:54:41 587
原创 POJ 题目3744(矩阵优化概率DP)
Scout YYF ITime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6409 Accepted: 1844DescriptionYYF is a couragous scout. Now he is on a dangerous mission whic
2015-10-24 21:25:15 321
原创 HDOJ 题目4334 Trouble(hash)
TroubleTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5528 Accepted Submission(s): 1537Problem DescriptionHassan is in trouble.
2015-10-23 21:54:06 427
原创 HDOJ 题目1264 Counting Squares(线段树+扫描线)
Counting SquaresTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1549 Accepted Submission(s): 781Problem DescriptionYour input is
2015-10-23 12:11:33 354
原创 HDOJ 题目2151 Worm(DP水)
WormTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3300 Accepted Submission(s): 2131Problem Description自从见识了平安夜苹果的涨价后,Lele就在他家门口
2015-10-22 22:25:33 385
原创 HDOJ 题目3853 LOOPS(概率DP)
LOOPSTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 3889 Accepted Submission(s): 1550Problem DescriptionAkemi Homura is a Maho
2015-10-22 21:40:04 314
原创 UVA 题目10271 - Chopsticks(DP)
In China, people use a pair of chopsticks to get food on the table, but Mr. L is a bit different. He usesa set of three chopsticks – one pair, plus an EXTRA long chopstick to get some big food by pi
2015-10-21 09:15:02 376
原创 HDOJ 题目5045 Contest(状压DP+期望)
ContestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1254 Accepted Submission(s): 503Problem DescriptionIn the ACM Internationa
2015-10-20 14:47:04 328
原创 UVA 题目11584 - Partitioning by Palindromes(DP)
We say a sequence of charactersis a palindrome if itis the same written forwardsand backwards. For example,‘racecar’ is a palindrome, but‘fastcar’ is not.A partition of a sequence ofchar
2015-10-19 22:10:18 374
转载 UVA 题目1099 - Sharing Chocolate(状态压缩DP+记忆化搜索)
Chocolate in its many forms is enjoyed by millions of people around the world every day. It is a trulyuniversal candy available in virtually every country around the world.You find that the only t
2015-10-19 21:23:35 608
原创 UVA 题目10859 Placing Lampposts(树形DP)
As a part of the mission ‘Beautification of Dhaka City’, the government has decided to replace all theold lampposts with new expensive ones. Since the new ones are quite expensive and the budget is
2015-10-19 20:45:00 394
原创 UVA 10755 10755 - Garbage Heap(DP, s)
Farmer John has a heap of garbage formed in a rectangular parallelepiped.It consists of A×B ×C garbage pieces each of which has a value.The value of a piece may be 0, if the piece is neither profi
2015-10-19 17:50:16 434
原创 HDOJ 题目1828 Picture (线段树+扫描线)
Picture Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3646 Accepted Submission(s): 1884Problem DescriptionA number of rectangul
2015-10-14 22:05:27 467
原创 HDOJ 题目1255 覆盖的面积(线段树+扫描线)
覆盖的面积Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4481 Accepted Submission(s): 2218Problem Description给定平面上若干矩形,求出被这些矩形覆盖过至少两
2015-10-14 18:28:53 440
原创 HDOJ 题目3265 Posters(线段树+扫描线)
PostersTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5660 Accepted Submission(s): 1327Problem DescriptionTed has a new hous
2015-10-14 11:30:00 420
原创 HDOJ 题目5501 The Highest Mark(贪心+01背包变形)
The Highest MarkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 481 Accepted Submission(s): 198Problem DescriptionThe SDOI in 2
2015-10-12 22:05:27 601
原创 HDOJ 题目3966 Aragorn's Story(树链剖分,树状数组)
Aragorn's StoryTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6073 Accepted Submission(s): 1615Problem DescriptionOur protagoni
2015-10-12 14:42:58 497
原创 SPOJ 题目 375 QTREE - Query on a tree(树链剖分)
QTREE - Query on a tree#number-theoryYou are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1.We will ask you to perfrom some instruc
2015-10-11 18:38:25 522
原创 HDOJ 题目1576 A/B(拓展欧几里得求乘法逆元)
A/BTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3310 Accepted Submission(s): 2511Problem Description要求(A/B)%9973,但由于A很大,我们只给出n
2015-10-11 12:07:05 492
原创 BZOJ 题目1076: [SCOI2008]奖励关(状压DP+期望,反向推)
1076: [SCOI2008]奖励关Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 1219 Solved: 687[Submit][Status][Discuss]Description你正在玩你最喜欢的电子游戏,并且刚刚进入一个奖励关。在这个奖励关里,系统将依次随机抛出k次宝物,每次你都可以选择吃或者不吃(必须在抛出下
2015-10-11 10:59:27 505
原创 COdevs 题目2800 送外卖(Floyd+状压DP,TSP裸题)
2800 送外卖 时间限制: 2 s 空间限制: 256000 KB 题目等级 : 钻石 Diamond题解题目描述 Description有一个送外卖的,他手上有n份订单,他要把n份东西,分别送达n个不同的客户的手上。n个不同的客户分别在1~n个编号的城市中
2015-10-10 21:57:26 967
原创 BZOJ题目1087: [SCOI2005]互不侵犯King(状态压缩DP)
1087: [SCOI2005]互不侵犯KingTime Limit: 10 Sec Memory Limit: 162 MBSubmit: 2182 Solved: 1282[Submit][Status][Discuss]Description在N×N的棋盘里面放K个国王,使他们互不攻击,共有多少种摆放方案。国王能攻击到它上下左右,以及左上左下右上右下八个方向上附近
2015-10-09 22:07:25 312
原创 POJ 题目2114 Boatherds(树的点分治)
BoatherdsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 1712 Accepted: 556DescriptionBoatherds Inc. is a sailing company operating in the country of Trab
2015-10-08 22:54:14 382
原创 HDOJ 题目1074 Doing Homework(状压DP)
Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6656 Accepted Submission(s): 2870Problem DescriptionIgnatius has ju
2015-10-08 12:53:11 620
原创 BZOJ 题目2152: 聪聪可可(树的点分治)
2152: 聪聪可可Time Limit: 3 Sec Memory Limit: 259 MBSubmit: 1122 Solved: 585[Submit][Status][Discuss]Description聪聪和可可是兄弟俩,他们俩经常为了一些琐事打起来,例如家中只剩下最后一根冰棍而两人都想吃、两个人都想玩儿电脑(可是他们家只有一台电脑)……遇到这种问题,一般
2015-10-08 10:04:27 370
原创 POJ 题目1987 Distance Statistics(树的点分治)
Distance StatisticsTime Limit: 2000MS Memory Limit: 64000KTotal Submissions: 1973 Accepted: 658Case Time Limit: 1000MSDescriptionFrustrated at the number of d
2015-10-08 09:14:22 368
原创 POJ 题目1747 Tree(点分治)
TreeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 14250 Accepted: 4625DescriptionGive a tree with n vertices,each edge has a length(positive integer les
2015-10-07 22:49:59 324
原创 POJ 题目3417 Network(LCA转RMQ+树形DP)
NetworkTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4284 Accepted: 1235DescriptionYixght is a manager of the company called SzqNetwork(SN). Now she
2015-10-07 17:57:18 409
原创 ZOJ 题目3777 Problem Arrangement(状态压缩DP)
Problem ArrangementTime Limit: 2 Seconds Memory Limit: 65536 KB The 11th Zhejiang Provincial Collegiate Programming Contest is coming! As a problem setter, Edward is going to arrange th
2015-10-07 15:50:31 454
原创 HDOJ 题目4856 Tunnels(BFS+状态压缩,TSP)
TunnelsTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1775 Accepted Submission(s): 527Problem DescriptionBob is travelling in Xi
2015-10-07 13:00:15 398
原创 HDOJ 题目4568 Hunter(BFS+状压DP,TSP)
HunterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1589 Accepted Submission(s): 469Problem Description One day, a hunter name
2015-10-06 23:10:34 438
原创 POJ 题目1185 炮兵阵地(状压DP)
炮兵阵地Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 22332 Accepted: 8637Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能
2015-10-06 14:10:23 798
原创 POJ 题目3254 Corn Fields(状压DP)
Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10378 Accepted: 5470DescriptionFarmer John has purchased a lush new rectangular pasture compo
2015-10-06 11:49:23 293
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人