The previous posts were either too scattered or too messy, so now we will make a long-term update summary for each category. Format description: The question name is followed by the general difficulty of the individual question (for cainiao) Poj 1069-the Bermuda Triangle (hard)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1069
Fill the hexagonal with a given triangle
Solution: the essence of this question lies in coordinates.
PS: In the legend, it is BT, and it is very easy to make a mistake. I am AC, but the program is not complete .... Poj 1077-eight (medium, this question is not incomplete in Life)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1077
Question: Eight Digital questions, classic questions
Solution: wide search, a *, two-way wide search
Related: http://hi.baidu.com/zfy0701/blog/item/7fcaba2c3d5425e98a1399cf.html
(Baidu star version, strongly recommended): http://acm.hnu.cn: 8080/online /? Action = problem & type = show & id = 10466 & courseid = 0 Poj 1084-square destroyer (medium, classic)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1084
Think of each positive shape as an element in a set, and each wooden stick as a subset to obtain the minimum subset coverage.
Solution: DFS, A *, and extensive search must have exploded Space Poj 1167-the buses (difficult)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1167
Question: This question combines a lot of classic deep search techniques
Solution: DFS Poj 1190-birthday cake (basics, good questions) Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1190 Question: omitted
Solution: DFS. The question is relatively simple, but it still feels a little bit better. Poj 1324-holedox moving (moderate)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1324
Question: omitted
Solution: A *, DFS + upper-bound pruning, wide search
Related: http://hi.baidu.com/zfy0701/blog/item/7fcaba2c3d5425e98a1399cf.html
Http://hi.baidu.com/zfy0701/blog/item/a3c44ecc049b1c1501e92806.html Poj 1376-robot (basic)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1376
Question: omitted
Solution: BFs, *.... Poj 1475-pushing boxes (medium, recommended)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1475
Question: Push box games
Solution: Dual BFS (BFS for human BFS for Box BFS), * Poj 1945-power hungry cows (??)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 1945
Question: omitted
Solution: it is listed as a difficult issue in a problem-solving report, but it seems like writing a very simple and violent BFS is over... the speed is still a little slow. I cannot think of a good heuristic function for the moment. Poj 2044-Weather Forecast (moderate)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2044
Question: omitted
Solution: guangsearch, DP, and deep search
Related: http://hi.baidu.com/zfy0701/blog/item/d7b6490f847948e8ab6457c6.html Poj 2286-the rotation game (difficult)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2286
Question: omitted
Solution: Ida * (iterative deepening + strong vertical shear)
Related: http://hi.baidu.com/zfy0701/blog/item/ce0f802261bfbba14723e871.html Poj 2308-dearboy's puzzle (medium, but few people do ?)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2308
Question: judge whether the Connected View has a solution
Solution: DFS + BFS
Related: http://hi.baidu.com/zfy0701/blog/item/c62f41af65aa1fca7cd92afc.html Poj 2426 remainder (difficult, =)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2426
Question: A little, mainly in number theory, it is easy to make people crazy.
Solution: BFS
Related: http://hi.baidu.com/zfy0701/blog/item/7fcaba2c3d5425e98a1399cf.html Poj 2449 remmarguts 'date (medium, strongly recommended)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2449
Typical problem: K Short Circuit
Solution: Dijkstra + A *, many methods
Related: http://acm.pku.edu.cn/JudgeOnline/showcontest? Contest_id = 1144 Poj 2688-cleaning robot (basic)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2688
Question: Converting BFs to TSP
Solution: BFS + dp, BFs + DFS
Related: http://hi.baidu.com/zfy0701/blog/item/ceb06f261749a6128a82a1b2.html Poj 2908-quantum (medium)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 2908
In fact, it is to find the shortest path of a single source.
Solution: the priority queue is widely searched (Dijkstra), and bit operations are recommended for optimization. Poj 3074-Sudoku (medium)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3074
Data is much stronger than 2676, but weaker than 3076.
Solution: You can use DFS to trace data. However, you should select the lowest possible number for each query.
The faster way is to first convert to the exact cover problem, and then solve it with the classic dancing links,
Dancing links original thesis: http://lanl.arxiv.org/PS_cache/cs/pdf/0011/0011047v1.pdf
Http://sqybi.com/works/dlxcn/ Poj 3322-bloxorz I (basic)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3322
The game itself is fun (http://jandan.net/2008/01/24/bloxorz.html)
Solution: wide search and two-way wide search
Related: http://hi.baidu.com/zfy0701/blog/item/d7b6490f847948e8ab6457c6.html Poj 3460-booksort (difficult, recommended)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3460
Question: omitted
Solution: Ida *, A *, DFS *
Related: http://hi.baidu.com/zfy0701/blog/item/5c5a404b0f73ecf582025ce4.html Poj 3523-the morning after Halloween (difficult)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3523
Moving all robots to their respective positions cannot collide or overlap
Solution: My state design is too violent: it represents the State at all robot locations. And then use a *, the last few, depressing. Who knows the good status design method? Tell me ^_^ Poj 3633-copying DNA (hard)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3633
Question: a string-filling search question
Solution: applicable to various search methods
Related: algorithm implementation is more challenging, I am referring to the http://www.wiskey86.cn/wordpress? P = 54. Poj 3635 full tank? (Medium)
Http://acm.pku.edu.cn/JudgeOnline/problem? Id = 3635
Question: Transient Deformation
Solution: guangsearch
Related: http://hi.baidu.com/hnu_reason/blog/item/086e3dccfc8cb21600e9286b.html |
