搜索 - 随笔分类(第2页) - Yxter

ZOJ 1609 Equivalence（状压+dfs减枝）

摘要：ZOJ Problem Set - 1609 EquivalenceTime Limit: 5 Seconds Memory Limit: 32768 KBWhen learning mathamatics, sometimes one may come to an theorem which go 阅读全文

posted @ 2017-04-20 11:51 Yxter 阅读(192) 评论(0) 推荐(0)

L3-015. 球队“食物链”（dfs）

摘要：L3-015. 球队“食物链” 某国的足球联赛中有N支参赛球队，编号从1至N。联赛采用主客场双循环赛制，参赛球队两两之间在双方主场各赛一场。联赛战罢，结果已经尘埃落定。此时，联赛主席突发奇想，希望从中找出一条包含所有球队的“食物链”，来说明联赛的精彩程度。“食物链”为一个1至N的排列{ T1 T2 阅读全文

posted @ 2017-04-14 21:33 Yxter 阅读(259) 评论(1) 推荐(0)

POJ 3083 Children of the Candy Corn

摘要：Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Practice POJ 3083 Submit Status Practice POJ 3083 Description The cor 阅读全文

posted @ 2016-08-28 15:01 Yxter 阅读(228) 评论(0) 推荐(0)

Codeforces 691D Swaps in Permutation

摘要：Time Limit:5000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 691D Submit Status Practice CodeForces 691D De 阅读全文

posted @ 2016-08-13 14:00 Yxter 阅读(227) 评论(0) 推荐(0)

FZU 2195 检查站点

摘要：Description 在山上一共有N个站点需要检查，检查员从山顶出发去各个站点进行检查，各个站点间有且仅有一条通路，检查员下山前往站点时比较轻松，而上山时却需要额外的时间，问最后检查员检查完所有站点时所需要的额外时间最少是多少。 Input 包含多组数据每组数据输入第一行为一个整数N 表示站点个阅读全文

posted @ 2016-08-12 18:01 Yxter 阅读(181) 评论(0) 推荐(0)

ZOJ 649 Rescue(优先队列+bfs)

摘要：Rescue Problem Description Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. 阅读全文

posted @ 2016-08-12 14:39 Yxter 阅读(223) 评论(0) 推荐(0)

HDU 2489 Minimal Ratio Tree (DFS枚举+最小生成树Prim)

摘要：Minimal Ratio Tree Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description For a tree, which nodes and edges are all weighted, th 阅读全文

posted @ 2016-07-31 15:27 Yxter 阅读(143) 评论(0) 推荐(0)

HDU 1142 A Walk Through the Forest

摘要：A Walk Through the Forest Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description Jimmy experiences a lot of stress at work these 阅读全文

posted @ 2016-07-24 12:31 Yxter 阅读(623) 评论(0) 推荐(0)

天棋哥哥大战AlphaGo

摘要：天棋哥哥大战AlphaGo Time Limit: 1 Sec Memory Limit: 128 MB Submit: 20 Solved: 9 [Submit][Status][Web Board] Description 3月15日，人机围棋大战巅峰对决在韩国首尔落下帷幕。五番棋的最后一局中，阅读全文

posted @ 2016-07-18 19:51 Yxter 阅读(244) 评论(0) 推荐(0)

hdu 2822 Dogs

摘要：Dogs Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description Prairie dog comes again! Someday one little prairie dog Tim wants to 阅读全文

posted @ 2016-07-17 20:23 Yxter 阅读(176) 评论(0) 推荐(0)

hdu 1560 DNA sequence(迭代加深搜索)

摘要：DNA sequence Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description The twenty-first century is a biology-technology developing 阅读全文

posted @ 2016-07-15 22:20 Yxter 阅读(327) 评论(0) 推荐(0)

HDU 2209 翻纸牌游戏

摘要：翻纸牌游戏 Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description 有一种纸牌游戏，很有意思，给你N张纸牌，一字排开，纸牌有正反两面，开始的纸牌可能是一种乱的状态（有些朝正，有些朝反），现在你需要整理这阅读全文

posted @ 2016-07-14 10:28 Yxter 阅读(221) 评论(0) 推荐(0)

HDU2216:Game III(BFS)

摘要：Game III Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description Zjt and Sara will take part in a game, named Game III. Zjt and S 阅读全文

posted @ 2016-07-14 09:48 Yxter 阅读(166) 评论(0) 推荐(0)

HDU2952:Counting Sheep(DFS)

摘要：Counting Sheep Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description A while ago I had trouble sleeping. I used to lie awake, s 阅读全文

posted @ 2016-07-14 08:57 Yxter 阅读(208) 评论(0) 推荐(0)

hdu 2612(Find a way)(简单广搜)

摘要：Find a way Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description Pass a year learning in Hangzhou, yifenfei arrival hometown Ni 阅读全文

posted @ 2016-07-14 08:56 Yxter 阅读(138) 评论(0) 推荐(0)

HDU2181:哈密顿绕行世界问题(DFS)

摘要：哈密顿绕行世界问题 Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description 一个规则的实心十二面体，它的 20个顶点标出世界著名的20个城市，你从一个城市出发经过每个城市刚好一次后回到出发的城市。 In 阅读全文

posted @ 2016-07-14 08:55 Yxter 阅读(391) 评论(0) 推荐(0)

hdu2102 A计划

摘要：A计划 Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description 可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后，而今，不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主，因为他听信阅读全文

posted @ 2016-07-14 08:52 Yxter 阅读(168) 评论(0) 推荐(0)

hdu-1978_How many ways dfs+记忆化搜索

摘要：How many ways Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description 这是一个简单的生存游戏，你控制一个机器人从一个棋盘的起始点(1,1)走到棋盘的终点(n,m)。游戏的规则描述如下：1. 阅读全文

posted @ 2016-07-14 08:51 Yxter 阅读(166) 评论(0) 推荐(0)

HDU1896Stones(优先队列)

摘要：Stones Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description Because of the wrong status of the bicycle, Sempr begin to walk ea 阅读全文

posted @ 2016-07-14 08:48 Yxter 阅读(413) 评论(0) 推荐(0)

hdu 1728 逃离迷宫 (BFS)

摘要：逃离迷宫 Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description 给定一个m × n (m行, n列)的迷宫，迷宫中有两个位置，gloria想从迷宫的一个位置走到另外一个位置，当然迷宫中有些地方是空地，阅读全文

posted @ 2016-07-14 08:47 Yxter 阅读(157) 评论(0) 推荐(0)

随笔分类 - 搜索