搜索
文章平均质量分 81
Prim233
南阳理工
展开
-
第九届河南省程序设计大赛-NYOJ-1276(搜索batter)
机器设备 时间限制:1000 ms | 内存限制:65535 KB 难度:2 描述 Alpha 公司设计出一种节能的机器设备。它的内部结构是由 N 个齿轮组成。整个机器设备有 一个驱动齿轮,当启动它时,它立即按 10,000 圈/小时转速顺时针转动,然后它又带动与它相切 的齿轮反方向,即逆时针转动。齿轮之间互相作用,每个齿轮都可能驱动着多个齿轮,最终带动 一个工作齿轮完成相应的任务。 在原创 2017-04-13 09:18:12 · 391 阅读 · 0 评论 -
NYOJ-284-坦克大战(BFS)
坦克大战 时间限制:1000 ms | 内存限制:65535 KB 难度:3 描述 Many of us had played the game “Battle city” in our childhood, and some people (like me) even often play it on computer now. What we are discussing is原创 2016-09-28 13:59:31 · 686 阅读 · 0 评论 -
POJ-2251-Dungeon Master(BFS)
Dungeon Master Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 27557 Accepted: 10795 DescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dung原创 2016-10-22 11:56:58 · 295 阅读 · 0 评论 -
NYOJ-21-三个水杯(BFS 模拟)
三个水杯 时间限制:1000 ms | 内存限制:65535 KB 难度:4 描述 给出三个水杯,大小不一,并且只有最大的水杯的水是装满的,其余两个为空杯子。三个水杯之间相互倒水,并且水杯没有标识,只能根据给出的水杯体积来计算。现在要求你写出一个程序,使其输出使初始状态到达目标状态的最少次数。 输入 第一行一个整数N(0<N<50)表示N组测试数据 接下来每组测试数据有两行,第一行原创 2016-09-03 14:59:38 · 823 阅读 · 0 评论 -
NYOJ-19-擅长排列的小明(DFS 全排列)
擅长排列的小明 时间限制:1000 ms | 内存限制:65535 KB 难度:4 描述 小明十分聪明,而且十分擅长排列计算。比如给小明一个数字5,他能立刻给出1-5按字典序的全排列,如果你想为难他,在这5个数字中选出几个数字让他继续全排列,那么你就错了,他同样的很擅长。现在需要你写一个程序来验证擅长排列的小明到底对不对。 输入 第一行输入整数N(1<N<10)表示多少组测试数据,原创 2016-09-03 14:02:59 · 613 阅读 · 0 评论 -
UVA-11624-Fire!(多点BFS)
Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Joe’s location in the原创 2016-08-06 09:14:28 · 256 阅读 · 0 评论 -
POJ-3984-迷宫问题(BFS打印路径)
迷宫问题 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16009 Accepted: 9551 Description定义一个二维数组: int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0,原创 2016-08-06 09:07:39 · 517 阅读 · 0 评论 -
POJ-1979-Red and Black(DFS)
Red and Black Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 30891 Accepted: 16825 DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored eit原创 2016-08-05 09:47:32 · 386 阅读 · 2 评论 -
POJ-1562-Oil Deposits(DFS)
Oil Deposits Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 16233 Accepted: 8738 DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground o原创 2016-08-05 09:12:50 · 283 阅读 · 0 评论 -
NYOJ-20-吝啬的国度(树的先序遍历)
吝啬的国度 时间限制:1000 ms | 内存限制:65535 KB 难度:3 描述 在一个吝啬的国度里有N个城市,这N个城市间只有N-1条路把这个N个城市连接起来。现在,Tom在第S号城市,他有张该国地图,他想知道如果自己要去参观第T号城市,必须经过的前一个城市是几号城市(假设你不走重复的路)。 输入 第一行输入一个整数M表示测试数据共有M(1<=M<=5)组 每组测试数据的第一原创 2016-08-04 08:53:18 · 467 阅读 · 0 评论 -
2016HDU多校联赛-HDU-5723-Abandoned country(最小生成树 邻接表DFS)
Abandoned countryTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 825 Accepted Submission(s): 221Problem Description An abandoned country ha原创 2016-07-20 10:05:21 · 476 阅读 · 0 评论 -
HDU-2181-哈密顿绕行世界问题(DFS)
哈密顿绕行世界问题Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3408 Accepted Submission(s): 2092Problem Description 一个规则的实心十二面体,它的 20个顶点标出世界著名的20原创 2016-10-24 20:21:40 · 384 阅读 · 0 评论 -
HDU-2102-A计划(BFS)
A计划Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 18152 Accepted Submission(s): 4604Problem Description 可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后,而今,不幸的她原创 2016-10-25 16:31:21 · 228 阅读 · 0 评论 -
Codeforces Round #403 (Div. 2) C. Andryusha and Colored Balloons(DFS 邻接表 数据结构)
C. Andryusha and Colored Balloons time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Andryusha goes through a park each day. The squares and原创 2017-03-07 20:36:23 · 354 阅读 · 0 评论 -
HDU-1584-蜘蛛牌(DFS)
蜘蛛牌Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3561 Accepted Submission(s): 1529Problem Description 蜘蛛牌是windows xp操作系统自带的一款纸牌游戏,游戏规则是这原创 2017-03-18 18:11:53 · 510 阅读 · 0 评论 -
Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined) B. Code For 1(DFS好题)
B. Code For 1 time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Jon fought bravely to rescue the wildlings who were attacked by the white-wa原创 2017-02-24 11:52:23 · 479 阅读 · 0 评论 -
POJ-1088-滑雪(记忆化搜索)
滑雪 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 95035 Accepted: 36011 DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个原创 2017-02-21 18:40:28 · 319 阅读 · 0 评论 -
POJ-2286-The Rotation Game(IDA*入门)
The Rotation Game Time Limit: 15000MS Memory Limit: 150000K Total Submissions: 6299 Accepted: 2121 DescriptionThe rotation game uses a # shaped board, which can hold 24 pieces of square bloc原创 2017-01-15 19:28:33 · 343 阅读 · 0 评论 -
Codeforces Round #382 (Div. 2)-735A. Ostap and Grasshopper(BFS)
A. Ostap and Grasshopper time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output On the way to Rio de Janeiro Ostap kills time playing with a gras原创 2016-11-28 15:56:02 · 401 阅读 · 0 评论 -
CodeForces 723D-Lakes in Berland(BFS DFS)
D. Lakes in Berland time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output The map of Berland is a rectangle of the size n × m, which consists of原创 2016-11-25 13:01:01 · 539 阅读 · 0 评论 -
Codeforces Round-#380-Div. 2-B-Spotlights
B. Spotlights time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Theater stage is a rectangular field of size n × m. The director gave you the原创 2016-11-20 19:28:37 · 419 阅读 · 0 评论 -
HDU-1915-Knight Moves(双向BFS)
Knight Moves Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 25071 Accepted: 11863 DescriptionBackground Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else原创 2016-10-27 11:40:20 · 362 阅读 · 0 评论 -
HDU-1560-DNA sequence(迭代深搜)
DNA sequenceTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2167 Accepted Submission(s): 1062Problem Description The twenty-first century原创 2016-10-25 18:43:36 · 1415 阅读 · 1 评论 -
NYOJ-10-skiing(记忆化搜索)
skiing 时间限制:3000 ms | 内存限制:65535 KB 难度:5 描述 Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516 17原创 2016-07-19 10:17:47 · 435 阅读 · 0 评论 -
POJ-3126-Prime Path(BFS)
F - Prime Path Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticePOJ 3126 Appoint description: Description The ministers of the cabinet were quite u原创 2016-06-13 22:42:18 · 420 阅读 · 0 评论 -
POJ-1426-Find The Multiple(BFS DFS)
E - Find The Multiple Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticePOJ 1426 Appoint description: Description Given a positive integer n, write原创 2016-06-06 20:04:05 · 336 阅读 · 0 评论 -
POJ-3083-Children of the Candy Corn
N - Children of the Candy Corn Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticePOJ 3083 Description The cornfield maze is a popular Halloween treat.原创 2016-03-11 19:38:38 · 306 阅读 · 0 评论 -
HDU-1372-Knight Moves
E - Knight Moves Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 1372 Description A friend of you is doing research on the Traveling Knight Prob原创 2016-03-11 09:33:57 · 301 阅读 · 0 评论 -
POJ-3278-Catch That Cow
P - Catch That Cow Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticePOJ 3278 Description Farmer John has been informed of the location of a fugitive原创 2016-03-10 13:44:25 · 232 阅读 · 0 评论 -
POJ-2251-Dungeon Master
J - Dungeon Master Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticePOJ 2251 Description You are trapped in a 3D dungeon and need to find the quickes原创 2016-03-10 10:58:11 · 250 阅读 · 0 评论 -
HDU-1312-Red and Black
I - Red and Black Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 1312 Description There is a rectangular room, covered with square tiles. Each原创 2016-03-09 20:53:26 · 273 阅读 · 0 评论 -
HDU-1072-Nightmare
F - Nightmare Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 1072 Description Ignatius had a nightmare last night. He found himself in a labyri原创 2016-03-09 18:12:20 · 350 阅读 · 0 评论 -
POJ-1321-棋盘问题
K - 棋盘问题 Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticePOJ 1321 Description 在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对原创 2016-03-09 13:30:20 · 347 阅读 · 0 评论 -
HDU-1253-胜利大逃亡
D - 胜利大逃亡 Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 1253 Description Ignatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会. 魔王住在一个城堡里,城堡是一个A*B*C的立方体,原创 2016-03-07 21:16:38 · 323 阅读 · 0 评论 -
HDU-2616-Kill the monster
A - Kill the monster Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 2616 Description There is a mountain near yifenfei’s hometown. On the mount原创 2016-03-07 13:04:12 · 326 阅读 · 0 评论 -
POJ-3414-Pots
O - Pots Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticePOJ 3414 Description You are given two pots, having the volume of A and B liters respective原创 2016-03-14 11:30:18 · 268 阅读 · 0 评论 -
POJ-1724-ROADS(优先队列,邻接表,BFS)
E - ROADS Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticePOJ 1724 Description N cities named with numbers 1 … N are connected with one-way roads. E原创 2016-04-30 17:48:32 · 773 阅读 · 1 评论 -
POJ-3278-Catch That Cow(BFS)
C - Catch That Cow Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticePOJ 3278 Appoint description: Description Farmer John has been informed of the原创 2016-06-06 18:42:20 · 268 阅读 · 0 评论 -
POJ-2251-Dungeon Master(BFS 优先队列)
B - Dungeon Master Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticePOJ 2251 Appoint description: Description You are trapped in a 3D dungeon and n原创 2016-06-06 15:52:54 · 346 阅读 · 0 评论 -
HDU-2612-Find a way(BFS)
L - Find a way Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 2612 Appoint description: Description Pass a year learning in Hangzhou, yifenfe原创 2016-06-08 13:16:53 · 405 阅读 · 0 评论