Jimmy_King

Breadth First Search宽度优先搜索算法（又称广度优先搜索）是最简便的图的搜索算法之一，这一算法也是很多重要的图的算法的原型。Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想。其别名又叫BFS，属于一种盲目搜寻法，目的是系统地展开并检查图中的所有节点，以找寻结果。换句话说，它并不考虑结果的可能位置，彻底地搜索整张图，直到找到结果为止。 

Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 89836 Accepted: 28175DescriptionFarmer John has been informed of the location of a fugitive cow and wants to

Knight MovesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 26102 Accepted: 12305DescriptionBackground Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else

Problem DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the supervisor

卢卡斯定理 主席树 Sunday AC自动机 链式前向星#include<string.h>#define MAX 10000struct node{ int to,nex,wei;}edge[MAX*2+5];int head[MAX+5],cnt;void add(int u,int v,int w)//添加一个单向边u->v 权为w {...

度度熊的01世界

Chess

J. Robots at WarehouseVitaly works at the warehouse. The warehouse can be represented as a grid of n × m cells, each of which either is free or is occupied by a container. From every free cell it’s ...