搜索
正经人谁在树上做dp
此人不懒但也没写签名
展开
-
Codeforces Round #686 (Div. 3) 1454E Number of Simple Paths
Codeforces Round #686 (Div. 3) 1454E Number of Simple PathsProblem DescriptionYou are given an undirected graph consisting of n vertices and n edges. It is guaranteed that the given graph is connected (i. e. it is possible to reach any vertex from any ot原创 2020-11-25 15:59:30 · 247 阅读 · 0 评论 -
大菜鸡的图论之旅-[kuangbin带你飞]专题一 简单搜索
大菜鸡的图论之旅-[kuangbin带你飞]专题一 简单搜索拖了一万年,可算把这个专题做完了。再拖拖拉拉我是狗。A POJ 1321 棋盘问题Problem Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。In...原创 2019-10-31 12:24:03 · 456 阅读 · 0 评论 -
HDU 4474 Yet Another Multiple Problem - BenFromHRBUST
HDU 4474 Yet Another Multiple ProblemProblem DescriptionThere are tons of problems about integer multiples. Despite the fact that the topic is not original, the content is highly challenging. That’s...原创 2019-07-22 23:07:54 · 143 阅读 · 0 评论 -
2019牛客暑期多校训练(第八场)D-Distance
2019牛客暑期多校训练(第八场)D-Distance膜拜UESTC_Trimen的大佬们~原题题意给定一个n* m* h的空间立方体,进行q次操作。第1种操作,向空间体中加入一个点(x,y,z)。第2种操作,找到与(x,y,z)曼哈顿距离最小的点,输出两点间的曼哈顿距离。思路BFS。先将n,m,h的中间值换到高的位置,保证h的值小于500,然后将剩下两维压缩处理(不...原创 2019-08-13 15:05:04 · 237 阅读 · 0 评论 -
Codeforces Round #124 (Div. 2) 197D
Codeforces Round #124 (Div. 2)Problem DescriptionWe’ve got a rectangular n × m-cell maze. Each cell is either passable, or is a wall (impassable). A little boy found the maze and cyclically tiled a ...原创 2019-08-02 13:54:02 · 146 阅读 · 0 评论 -
HDU 2019 Multi-University Training Contest 8 杭电2019多校联合训练赛 第八场 1001 Acesrc and Cube Hypernet (6657)
Problem DescriptionAcesrc is fond of cube nets. If we cut some edges of a cube, the surface of the cube can be unfolded into 2-dimensional space, and the resulting flat shape is called a cube net. Th...原创 2019-08-15 21:02:38 · 264 阅读 · 0 评论 -
(Codeforces)East Central North America Regional Contest 2016--H Vin Diagrams
(Codeforces)East Central North America Regional Contest 2016–H Vin Diagrams题意用两个不规则的方形表示两个韦恩图,求两个韦恩图的单独部分和公共部分的面积。思路先把这两个图分开,并记录中间的公共部分的圈(中间公共部分的圈是不能接触到整个图的边界的)。然后对空的部分搜索,如果搜索的时候只碰到中间公共部分的圈,则...原创 2019-08-22 21:53:28 · 351 阅读 · 0 评论