杂杂的
薄层
努力就有收获~
展开
-
HDU-1043 Eight(经典八数码问题, A*+康拓+曼哈顿距离+逆序数判断可解性、双向搜索)
八数码经典问题The 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and all packed into a 4 by 4 frame with one tile missing. Let'原创 2017-10-12 15:58:49 · 558 阅读 · 0 评论 -
POJ-1330 Nearest Common Ancestors(lca模板题)
In the figure, each node is labeled with an integer from {1, 2,...,16}. Node 8 is the root of the tree. Node x is an ancestor of node y if node x is in the path between the root and node y. For example, node 4 is an ancestor of node 16. Node 10 is also an原创 2017-09-15 12:55:14 · 314 阅读 · 1 评论 -
CodeForces-839C Journey(DFS+概率)
There are n cities and n - 1 roads in the Seven Kingdoms, each road connects two cities and we can reach any city from any other by the roads.Theon and Yara Greyjoy are on a horse in the first city, they are starting traveling through the roads. But the w原创 2017-08-17 01:18:36 · 384 阅读 · 0 评论 -
图论500题
=============================以下是最小生成树+并查集====================================== 【HDU】 1213 How Many Tables 基础并查集★ 1272 小希的迷宫 基础并查集★ 1325&&poj1308 Is It A转载 2017-07-26 13:11:29 · 632 阅读 · 0 评论 -
POJ-1932 XYZZY(判正权环路+Warlshell传递闭包)
The prototypical computer adventure game, first designed by Will Crowther on the PDP-10 in the mid-1970s as an attempt at computer-refereed fantasy gaming, and expanded into a puzzle-oriented game by Don Woods at Stanford in 1976. (Woods had been one of th原创 2017-11-02 15:10:04 · 334 阅读 · 0 评论 -
HDU-1719 Friend(公式化简)
Friend number are defined recursively as follows. (1) numbers 1 and 2 are friend number; (2) if a and b are friend numbers, so is ab+a+b; (3) only the numbers defined in (1) and (2) are friend number. Now your task is to judge whether an integer is a f原创 2017-11-30 15:50:02 · 295 阅读 · 0 评论 -
Codeforces-984C - Finite or not?(数论)
题意:给定p,q,b,问p/q能否表示成b进制下的有限小数形式(p,q,b <= 1e18)思路:对于约分后的p/q,只需关心1/q是否能在b进制下有限表现即可。把1/q换成小数形式,例如1/8 = 0.125,像整数转换进制一样,小数转换进制也是不断地除以进制的基,而小数的基是b^-1。则0.125转换为二进制过程如下,0.125(除2^-1)-->余0商0.25(除2^-1)--&...原创 2018-05-16 20:57:13 · 545 阅读 · 0 评论 -
dfs序 & 欧拉序
dfs序:s[u]: dfs时进入u节点子树时的时间戳;s[v]: dfs时离开u节点子树时的时间戳.欧拉序:E[i]: 第i时间访问到的节点R[u]: 节点u被访问到的第一时间Question:给定树形图,然后q次询问,问点u是否是点v的父节点。Answer:通过dfs序判断v节点的时间区间是否在u节点的时间区间内。通过欧拉序判断u和v的最近公共祖先是否是u。Code1:#include <...原创 2018-05-29 11:47:11 · 1098 阅读 · 1 评论