-------- 搜索 ---------
关注
分享
扫一扫
文章平均质量分 89
叶孤心丶
这个作者很懒，什么都没留下…
展开
-
HDU 5437 Ponds(DFS)
PondsTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3851 Accepted Submission(s): 582Problem DescriptionBetty owns a lot of原创 2015-09-14 20:40:32 · 492 阅读 · 0 评论 -
POJ 3414 Pots（BFS+回溯）
PotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11705 Accepted: 4956 Special JudgeDescriptionYou are given two pots, having the volume of A and原创 2015-07-27 17:25:35 · 631 阅读 · 0 评论 -
HDU 1016 Prime Ring Problem（深搜）
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32872 Accepted Submission(s): 14544Problem DescriptionA rin原创 2015-06-30 20:55:58 · 530 阅读 · 0 评论 -
HDU 1010 Tempter of the Bone(深搜)
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 86037 Accepted Submission(s): 23462Problem DescriptionThe原创 2015-06-29 21:14:27 · 1828 阅读 · 0 评论 -
SDUT 1157 小鼠迷宫问题（水题，DFS + 回溯）
小鼠迷宫问题Time Limit: 1500ms Memory limit: 65536K 有疑问？点这里^_^题目描述小鼠a与小鼠b身处一个m×n的迷宫中，如图所示。每一个方格表示迷宫中的一个房间。这m×n个房间中有一些房间是封闭的，不允许任何人进入。在迷宫中任何位置均可沿上，下，左，右4个方向进入未封闭的房间。小鼠a位于迷宫的(p，q)方格原创 2015-05-05 10:08:15 · 1148 阅读 · 0 评论 -
Quasi Binary（Codeforces Round #300）
B. Quasi Binarytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA number is called quasibinary if its decim原创 2015-05-04 19:07:27 · 904 阅读 · 0 评论 -
SDUT 2830 图练习-BFS-从起点到目标点的最短步数（BFS + vector）
图练习-BFS-从起点到目标点的最短步数Time Limit: 1000ms Memory limit: 65536K 有疑问？点这里^_^题目描述在古老的魔兽传说中，有两个军团，一个叫天灾，一个叫近卫。在他们所在的地域，有n个隘口，编号为1..n，某些隘口之间是有通道连接的。其中近卫军团在1号隘口，天灾军团在n号隘口。某一天，天灾军团的领袖巫原创 2015-04-27 20:38:45 · 692 阅读 · 0 评论 -
SDUT 2152 Balloons（BFS 第一届山东省赛）
BalloonsTime Limit: 1000ms Memory limit: 65536K 有疑问？点这里^_^题目描述Both Saya and Kudo like balloons. One day, they heard that in the central park, there will be thousands of原创 2015-04-27 20:51:42 · 703 阅读 · 0 评论 -
SDUT 2139 图结构练习——BFS——从起始点到目标点的最短步数（BFS + vector）
图结构练习——BFS——从起始点到目标点的最短步数Time Limit: 1000ms Memory limit: 65536K 有疑问？点这里^_^题目描述 在古老的魔兽传说中，有两个军团，一个叫天灾，一个叫近卫。在他们所在的地域，有n个隘口，编号为1..n，某些隘口之间是有通道连接的。其中近卫军团在1号隘口，天灾军团在n号隘口。某一天，天灾原创 2015-04-23 20:12:43 · 631 阅读 · 0 评论 -
SDUT3184 Fun House（模拟）
Fun HouseTime Limit: 1000MS Memory limit: 65536K题目描述American Carnival Makers Inc. (ACM) has a long history of designing rides and attractions. One of their more popular attract原创 2015-04-13 09:44:21 · 1016 阅读 · 0 评论 -
D. Arthur and Walls（Codeforces Round #297 (Div. 2) 搜索（BFS））
D. Arthur and Wallstime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputFinally it is a day when Arthur has eno原创 2015-04-01 21:25:57 · 550 阅读 · 0 评论 -
HDU 2425 Hiking Trip（搜索+优先队列）
Hiking TripTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2425DescriptionHiking in the mountains is seldom an easy task fo原创 2015-03-10 21:03:49 · 642 阅读 · 0 评论 -
第四届山东省赛 Thrall’s Dream（BFS+vector）
2218: Thrall’s DreamTime Limit: 1 Sec Memory Limit: 128 MBSubmit: 253 Solved: 72[Submit][Status][Web Board]DescriptionWe never paid any heed to the ancient prophecies, like fools we cl原创 2015-04-07 20:17:44 · 979 阅读 · 0 评论 -
poj1321 棋盘问题(DFS)
棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24706 Accepted: 12205Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求原创 2015-03-06 18:18:53 · 504 阅读 · 0 评论 -
poj 2488 A Knight's Journey(DFS)
A Knight's JourneyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 32972 Accepted: 11239DescriptionBackground The knight is getting bored of seeing the原创 2015-03-06 18:21:58 · 472 阅读 · 0 评论 -
POJ 1416 Shredding Company（简单DFS）
Shredding CompanyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4622 Accepted: 2654DescriptionYou have just been put in charge of developing a new shre原创 2015-07-27 20:23:21 · 765 阅读 · 0 评论 -
POJ 2676 Sudoku(DFS + 回溯)
SudokuTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15809 Accepted: 7724 Special JudgeDescriptionSudoku is a very simple task. A square table with原创 2015-07-28 09:46:50 · 957 阅读 · 0 评论 -
POJ 3083 Children of the Candy Corn（搜索）
Children of the Candy CornTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10975 Accepted: 4731DescriptionThe cornfield maze is a popular Halloween treat原创 2015-07-28 10:19:36 · 646 阅读 · 0 评论 -
POJ 3278 Catch That Cow
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 44220 Accepted: 13814DescriptionFarmer John has been informed of the location of a fugitiv原创 2014-06-17 20:47:15 · 551 阅读 · 0 评论 -
poj 3126 Prime Path（BFS）
Prime PathTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12421 Accepted: 7031DescriptionThe ministers of the cabinet were quite upset by the message fr原创 2015-03-06 18:13:52 · 483 阅读 · 0 评论 -
POJ 2251 Dungeon Master（三维BFS）
Dungeon MasterTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2251Appoint description: System Crawler (2014-09-08)Descript原创 2014-09-10 15:55:26 · 686 阅读 · 0 评论 -
poj 3009 Curling 2.0（DFS）
Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12950 Accepted: 5441DescriptionOn Planet MM-21, after their Olympic games this year, curling原创 2015-03-06 18:17:51 · 457 阅读 · 0 评论 -
POJ 1426 Find The Multiple && 51nod 1109 01组成的N的倍数 (BFS + 同余模定理)
Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21436 Accepted: 8775 Special JudgeDescriptionGiven a positive integer n, write a pr原创 2015-07-27 14:38:16 · 1055 阅读 · 0 评论 -
HDU 5305 Friends（简单DFS）
FriendsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 878 Accepted Submission(s): 422Problem DescriptionThere are n people原创 2015-07-24 15:50:23 · 779 阅读 · 0 评论 -
HDU 5336 XYZ and Drops(BFS)
XYZ and DropsTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1181 Accepted Submission(s): 372Problem DescriptionXYZ is playin原创 2015-08-03 10:18:30 · 795 阅读 · 0 评论 -
HDU 5339 Untitled(DFS）
UntitledTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 751 Accepted Submission(s): 403Problem DescriptionThere is an integer原创 2015-08-03 10:06:04 · 705 阅读 · 0 评论 -
Codeforces Round #313 D. Equivalent Strings（DFS）
D. Equivalent Stringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday on a lecture about strings Gera原创 2015-07-23 09:15:22 · 1025 阅读 · 0 评论 -
POJ 2531 Network Saboteur（搜索）
Network SaboteurTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10084 Accepted: 4819DescriptionA university network is composed of N computers. System a原创 2015-08-03 10:45:43 · 921 阅读 · 0 评论 -
HDU 5335 Walk Out（搜索+贪心）
Walk OutTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2810 Accepted Submission(s): 571Problem DescriptionIn an n∗m maze,原创 2015-08-03 10:00:03 · 565 阅读 · 0 评论 -
POJ 1129 Channel Allocation（DFS）
Channel AllocationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13173 Accepted: 6737DescriptionWhen a radio station is broadcasting over a very large原创 2015-07-30 09:48:19 · 632 阅读 · 0 评论 -
HDU 5323 Solve this interesting problem（DFS）
Solve this interesting problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1507 Accepted Submission(s): 428Problem Description原创 2015-07-29 15:53:08 · 594 阅读 · 3 评论 -
HDU 5326 Work
WorkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 549 Accepted Submission(s): 375Problem DescriptionIt’s an interesti原创 2015-07-29 15:56:44 · 572 阅读 · 0 评论 -
UVA Don't Get Rooked （DFS回溯）
Don't Get Rooked In chess, the rook is a piece that can move any number of squares vertically or horizontally. In this problem we will consider small chess boards (at most 44) that can原创 2015-01-23 21:07:26 · 629 阅读 · 0 评论 -
UVA Getting in Line （DFS回溯）
Getting in Line Computer networking requires that the computers in the network be linked.This problem considers a ``linear" network in which the computers are chained together so原创 2015-01-23 21:02:55 · 546 阅读 · 0 评论 -
UVA The Sultan's Successors （八皇后问题）
The Sultan's Successors The Sultan of Nubia has no children, so she has decided that the country will be split into up to k separate parts on her death and each part will be inherited by原创 2015-01-26 16:44:14 · 1173 阅读 · 0 评论 -
UVA Transportation （DFS）
Transportation Ruratania is just entering capitalism and is establishing new enterprising activities in many fields including transport. The transportation company TransRuratania is star原创 2015-01-26 15:59:17 · 726 阅读 · 0 评论 -
UVA How Big Is It? （DFS+回溯）
How Big Is It? Ian's going to California, and he has to pack his things, including his collection of circles. Given a set of circles, your program must find the smallest rectangular box in原创 2015-01-26 16:36:57 · 732 阅读 · 0 评论 -
UVA 23 Out of 5（DFS+回溯）
Problem I23 Out of 5Input: standard inputOutput: standard outputTime Limit: 1 secondMemory Limit: 32 MBYour task is to write a program that can decide whether you can find an arithmetic ex原创 2015-01-26 16:29:28 · 886 阅读 · 0 评论 -
POJ3984 迷宫问题（BFS 记忆路径）
迷宫问题Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3984Appoint description: System Crawler (2014-09-11)Description定义一原创 2014-09-14 21:09:05 · 799 阅读 · 0 评论 -
HDU 1181 变形记 （BFS）
搜索Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的原创 2014-08-21 21:17:15 · 498 阅读 · 0 评论