dfs
文章平均质量分 85
Hold_My_Own
When the dust settles, and it will, we'll see.
展开
-
(HDU - 1241)Oil Deposits
(HDU - 1241)Oil Deposits The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid原创 2017-08-16 14:53:24 · 2726 阅读 · 0 评论 -
(POJ - 1321)棋盘问题
(POJ - 1321)棋盘问题 在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。原创 2017-09-15 13:55:14 · 229 阅读 · 0 评论 -
(CodeForces - 616C)The Labyrinth
(CodeForces - 616C)The Labyrinth You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked wi原创 2017-09-07 15:12:20 · 292 阅读 · 0 评论 -
(CodeForces - 598D)Igor In the Museum
(CodeForces - 598D)Igor In the Museum Igor is in the museum and he wants to see as many pictures as possible.Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impas原创 2017-09-07 08:17:39 · 462 阅读 · 0 评论 -
(HihoCoder - 1041)国庆出游
(HihoCoder - 1041)国庆出游小Hi和小Ho准备国庆期间去A国旅游。A国的城际交通比较有特色:它共有n座城市(编号1-n);城市之间恰好有n-1条公路相连,形成一个树形公路网。小Hi计划从A国首都(1号城市)出发,自驾遍历所有城市,并且经过每一条公路恰好两次——来回各一次——这样公路两旁的景色都不会错过。令小Hi苦恼的是他的小伙伴小Ho希望能以某种特定的顺序游历其中m个城市。例如按3-原创 2017-09-06 13:09:16 · 285 阅读 · 0 评论 -
(HDU - 1455)Sticks
(HDU - 1455)Sticks George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he原创 2017-09-05 17:32:10 · 291 阅读 · 0 评论 -
(CodeForces - 825B)Five-In-a-Row
(CodeForces - 825B)Five-In-a-Row Alice and Bob play 5-in-a-row game. They have a playing field of size 10 × 10. In turns they put either crosses or noughts, one at a time. Alice puts crosses and Bob puts nought原创 2017-08-25 20:12:14 · 308 阅读 · 0 评论 -
(HDU - 1312)Red and Black
(HDU - 1312)Red and Black There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent原创 2017-08-15 17:01:42 · 192 阅读 · 0 评论 -
(POJ - 2258)The Settlers of Catan
(POJ - 2258)The Settlers of Catan Within Settlers of Catan, the 1995 German game of the year, players attempt to dominate an island by building roads, settlements and cities across its uncharted wilderness. Yo原创 2017-08-18 20:33:21 · 317 阅读 · 0 评论 -
(CSU - 1600)Twenty-four point
(CSU - 1600)Twenty-four point Given four numbers, can you get twenty-four through the addition, subtraction, multiplication, and division? Each number can be used only once.原创 2017-08-18 19:55:15 · 247 阅读 · 0 评论 -
(CSU - 1960)单源最大权路径
(CSU - 1960)单源最大权路径Time Limit: 3 Sec Memory Limit: 128 Mb Submitted: 136 Solved: 66Description有一棵由N个结点构成的树,每一条边上都有其对应的权值。现在给定起点,求从该点出发的一条路径(至少有一条边)使得这条路径上的权值之和最大,并输出这个最大值。Input第一行一个正整数T,代表数原创 2017-08-18 18:19:30 · 245 阅读 · 0 评论 -
(HDU - 1518)Square
(HDU - 1518)Square Given a set of sticks of various lengths, is it possible to join them end-to-end to form a square?原创 2017-08-18 16:38:42 · 296 阅读 · 0 评论 -
(HDU - 2553)N皇后问题
(HDU - 2553)N皇后问题 在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。你的任务是,对于给定的N,求出有多少种合法的放置方法。原创 2017-08-18 08:41:38 · 259 阅读 · 0 评论