ICPC-DFS
文章平均质量分 90
有关DFS的题解
海岛Blog
专注于程序设计及其竞赛,专注于集成电路EDA设计
展开
-
HDU1416 POJ1078 UVA653 LA5507 Gizilch【DFS】
GizilchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 497 Accepted Submission(s): 142Problem DescriptionThe game of gizilch has very simple rules. First 100 grapes are labeled, in nontoxic ink原创 2022-05-05 19:21:22 · 287 阅读 · 0 评论 -
UVA11125 Arrange Some Marbles【DFS】
you are given some marbles of n different color. You have to arrange these marbles in a line. Themarbles adjacent with same color form a group. In each group there can be 1 to 3 marble. Adjacentgroup should have different color and size. The first and la原创 2022-04-26 13:51:06 · 1016 阅读 · 0 评论 -
POJ2704 HDU1208 LA3390 Pascal‘s Travels【递推+记忆化搜索】
Pascal’s TravelsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5656 Accepted: 2538DescriptionAn n x n game board is populated with integers, one nonnegative integer per square. The goal is to travel along any legitimate path from the upper原创 2021-08-01 19:55:36 · 338 阅读 · 0 评论 -
UVA11518 HDU2754 Dominos 2【DFS】
Dominos 2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 365 Accepted Submission(s): 105Problem DescriptionDominos are lots of fun. Children like to stand the tiles on their side in long lines.原创 2021-07-31 20:23:15 · 208 阅读 · 0 评论 -
UVA254 Towers of Hanoi【DFS】
In 1883, Edouard Lucas invented, or perhaps reinvented, one of the most popular puzzles of all times – the Tower of Hanoi, as he called it – which is still used today in many computer science textbooks to demonstrate how to write a recursive algorithm or p原创 2021-06-27 19:09:04 · 302 阅读 · 0 评论 -
UVA10998 POJ2857 Flipping Colors【DFS】
Flipping ColorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 749 Accepted: 371DescriptionA rectangle with sides parallel to the x-y axes and its left-lower corner at (0, 0) is being painted. The rectangle may be thought of as a flat-scree原创 2021-06-27 18:04:44 · 230 阅读 · 0 评论 -
UVA10120 ZOJ1229 Gift?!【DFS+BFS】
Gift?!Time Limit: 2000 msMemory Limit: 65536 KBThere is a beautiful river in a small village. N rocks are arranged in a straight line numbered 1 to N from left bank to the right bank, as shown below.[LeftBank]−[Rock1]−[Rock2]−[Rock3]−[Rock4]...[Rockn]−[原创 2021-06-24 09:32:59 · 214 阅读 · 0 评论 -
POJ2033 LA3078 HDU1508 ZOJ2202 Alphacode【DFS+DP】
AlphacodeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15489 Accepted: 4649DescriptionAlice and Bob need to send secret messages to each other and are discussing ways to encode their messages:Alice: “Let’s just use a very simple code: We原创 2021-05-21 19:52:35 · 200 阅读 · 0 评论 -
UVA280 LA5588 Vertex【DFS】
Write a program that searches a directed graph for vertices which are inaccessible from a given starting vertex. A directed graph is represented by n vertices where 1 ≤ n ≤ 100, numbered consecutively 1 . . . n , and a series of edg原创 2021-05-04 18:00:58 · 387 阅读 · 0 评论 -
UVA208 WF5147 Firetruck【回溯】
The Center City fire department collaborates with the transportation department to maintain maps of the city which reflects the current status of the city streets. On any given day, several streets are closed for repairs or construction. Firefighters need原创 2021-05-03 07:45:14 · 202 阅读 · 0 评论 -
UVA193 POJ1419 Graph Coloring【DFS】
Graph ColoringTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6887 Accepted: 3163 Special JudgeDescriptionYou are to write a program that tries to find an optimal coloring for a given graph. Colors are applied to the nodes of the graph and原创 2021-05-01 18:00:34 · 171 阅读 · 1 评论 -
UVA10001 Garden of Eden【DFS+位运算】
Cellular automata are mathematical idealizations of physical systems in which both space and time are discrete, and the physical quantities take on a finite set of discrete values. A cellular automaton consists of a lattice (or array), usually infinite, of原创 2021-04-29 08:48:01 · 236 阅读 · 0 评论 -
UVA785 LA5281 Grid Colouring【DFS】
A set of contours is represented on a two dimensional grid as illustrated in the sample below. The contours are made of any printable character different than space and ‘’ (underscore). In the sample this character is ‘X’. All the other points of the grid原创 2021-04-12 03:36:11 · 466 阅读 · 0 评论 -
UVA11110 POJ3194 Equidivisions【DFS】
An equidivision of an n × n square array of cells is a partition of the n2 cells in the array in exactly n sets, each one with n contiguous cells. Two cells are contiguous when they have a common side. A good equidivision is compose原创 2021-03-28 02:19:55 · 338 阅读 · 0 评论 -
UVA11094 Continents【DFS】
Mijid the Great is the king of Dodars territory. He likes to travel between the cities in his territory and actually, you can never see him in the same city as where he was the day before. Therefore, he captured all territories of his continent! In spite o原创 2021-03-28 00:53:52 · 302 阅读 · 0 评论 -
UVA722 LA5359 Lakes【DFS】
A region of two-dimensional space is divided by a grid into uniform square cells, each of which represents either “land” or “water”. We are interested in finding the area of a region of horizontally or vertically connected “water” c原创 2021-03-27 07:17:22 · 1070 阅读 · 0 评论 -
UVA469 Wetlands of Florida【DFS】
A construction company owns a large piece of real estate within the state of Florida. Recently, thecompany decided to develop this property. Upon inspection of the property, however, it was revealedthat the land, at various locations, contained bodies of原创 2021-03-27 06:40:21 · 275 阅读 · 0 评论 -
AOJ0525 Osenbei【DFS+状态组合】
おせんべい問題IOI製菓では,創業以来の伝統の製法で煎餅(せんべい)を焼いている.この伝統の製法は,炭火で一定時間表側を焼き,表側が焼けると裏返して,炭火で一定時間裏側を焼くというものである.この伝統を守りつつ,煎餅を機械で焼いている.この機械は縦 R (1 ≤ R ≤ 10) 行, 横 C (1 ≤ C ≤ 10000) 列の長方形状に煎餅を並べて焼く.通常は自動運転で,表側が焼けたら一斉に煎餅を裏返し裏側を焼く.ある日,煎餅を焼いていると,煎餅を裏返す直前に地震が起こり何枚かの煎餅が裏返ってしまっ原创 2021-03-06 11:55:22 · 332 阅读 · 0 评论 -
UVA260 Il Gioco dell‘X【DFS】
The game ‘Il Gioco dell’ X’ is played on a N by N board (N ≥ 2). The object of both players, say Black and White, is to join opposite sides of the board by placing in turn their pawns on the board in such a way that a path is made from one side to the othe原创 2021-02-25 19:12:43 · 212 阅读 · 0 评论 -
POJ3620 Avoid The Lakes【DFS】
Avoid The LakesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9704 Accepted: 5037DescriptionFarmer John’s farm was flooded in the most recent storm, a fact only aggravated by the information that his cows are deathly afraid of water. His i原创 2021-02-22 05:58:50 · 294 阅读 · 0 评论 -
UVA871 Counting Cells in a Blob【DFS】
Consider a two-dimensional grid of cells, each of which may be empty or filled. Filled cells form blobs. The filled cells that are connected form the same bigger blob. Two cells are said to be connected if they are adjacent to each other orizontally, verti原创 2021-02-21 12:06:56 · 239 阅读 · 0 评论 -
UVA10400 Game Show Math【DFS】
A game show in Britain has a segment where it gives its contestants a sequence of positive numbers and a target number. The contestant must make a mathematical expression using all of the numbers in the sequence and only the operators: +, -, * and /. Each原创 2021-02-16 09:58:17 · 208 阅读 · 0 评论 -
UVA165 HDU1641 LA5225 Stamps【DFS】
The government of Nova Mareterrania requires that various legal documents have stamps attached to them so that the government can derive revenue from them. In terms of recent legislation, each class of document is limited in the number of stamps that may b原创 2021-02-07 23:12:35 · 266 阅读 · 0 评论 -
HDU1582 AC Again【DFS】
AC AgainTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 627 Accepted Submission(s): 242Problem Description“AC”这个单词大概是我们 ACMers 最希望听到的回答了。...原创 2020-05-02 21:41:11 · 325 阅读 · 0 评论 -
HDU2610 Sequence one【DFS+剪枝】
Sequence oneTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1076 Accepted Submission(s): 435Problem DescriptionSearch is important in the...原创 2020-04-26 23:16:40 · 632 阅读 · 0 评论 -
POJ1945 Power Hungry Cows【DFS】
Power Hungry CowsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6441 Accepted: 1593DescriptionFJ’s cows would like to be able to compute integer powers P (1 <= P <= 20,000) of n...原创 2020-04-15 19:32:43 · 634 阅读 · 0 评论 -
POJ2488 A Knight's Journey【DFS】
A Knight’s JourneyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 58714 Accepted: 19998DescriptionBackgroundThe knight is getting bored of seeing the same black and white squares agai...原创 2020-04-15 19:11:07 · 286 阅读 · 0 评论 -
UVA11966 Galactic Bonding【DFS+并查集】
Calvin likes to lie in a field and look at the night sky. Since he doesn’t know any real star constellations, he makes them up: if two stars are close to each other, they must belong to the same const...原创 2020-04-01 19:38:07 · 425 阅读 · 0 评论 -
HDU1181 变形课【DFS+关系闭包+bitset】
变形课Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 38513 Accepted Submission(s): 13646Problem Description呃…变形课上Harry碰到了一点小麻烦,因为他并不像Hermi...原创 2020-03-21 22:26:35 · 406 阅读 · 0 评论 -
HDU1704 Rank【传递闭包+DFS】
RankTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2531 Accepted Submission(s): 1008Problem Descriptionthere are N ACMers in HDU team.Z...原创 2020-03-21 21:51:10 · 356 阅读 · 0 评论 -
HDU2266 How Many Equations Can You Find【DFS】
How Many Equations Can You FindTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1723 Accepted Submission(s): 1148Problem DescriptionNow gi...原创 2020-03-21 20:05:42 · 296 阅读 · 0 评论 -
HDU1667 POJ2286 UVA1343 LA3265 The Rotation Game【IDA*】
The Rotation GameTime Limit: 45000/15000 MS (Java/Others) Memory Limit: 150000/150000 K (Java/Others)Total Submission(s): 2766 Accepted Submission(s): 1119Problem DescriptionThe rotation gam...原创 2020-03-21 10:07:50 · 366 阅读 · 0 评论 -
HDU1560 DNA sequence【IDA*】
DNA sequenceTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5921 Accepted Submission(s): 2694Problem DescriptionThe twenty-first century...原创 2020-03-19 23:15:22 · 370 阅读 · 0 评论 -
HDU1373 POJ1129 LA2243 Channel Allocation【DFS】
Channel AllocationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1529 Accepted Submission(s): 662Problem DescriptionWhen a radio station...原创 2020-03-19 00:10:00 · 344 阅读 · 0 评论 -
HDU1539 POJ1416 LA2570 Shredding Company【DFS】
Shredding CompanyTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1036 Accepted Submission(s): 334Problem DescriptionYou have just been pu...原创 2020-03-18 15:40:15 · 322 阅读 · 0 评论 -
UVA10318 POJ2630 Security Panel【DFS+剪枝+状态压缩】
Security PanelTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 941 Accepted: 323 Special JudgeDescriptionAdvanced Control Mechanisms (ACM) produces sophisticated electronic locks and s...原创 2020-03-14 00:01:52 · 243 阅读 · 0 评论 -
UVA10946 You want what filled?【DFS】
Now that Ryan and Larry infuriated the bear, they’re now forced to do menial tasks for food, one such task is filling in potholes on this deserted island. But of course, it’s never quite that easy, a...原创 2020-03-09 23:05:49 · 235 阅读 · 0 评论 -
UVA10422 Knights in FEN【DFS】
There are black and white knights on a 5 by 5 chessboard. There are twelve of each color, and there is one square that is empty. At any time, a knight can move into an empty square as long as it moves...原创 2020-03-09 11:45:46 · 342 阅读 · 0 评论 -
UVA10739 String to Palindrome【记忆化搜索+DP】
In this problem you are asked to convert a string into a palindrome with minimum number of operations. The operations are described below: Here you’d have the ultimate freedom....原创 2020-03-08 22:10:53 · 324 阅读 · 0 评论 -
UVA10651 Pebble Solitaire【DFS+记忆化搜索+位运算】
Pebble solitaire is an interesting game. This is a game where you are given a board with an arrangement of small cavities, initially all but one occupied by a pebble each. The aim of the game is to re...原创 2020-03-08 20:24:05 · 356 阅读 · 0 评论