老焦的博客

#include #include #include #include #include using namespace std; #define max(x,y) x>y?x:y; #define min(x,y) x<y?x:y; const int inf = 0x3f3f3f3f; char map[13][13]; int n, m, cnt; typedef struct d

题目大意：Y和M要去同一个kfc相聚，求最短路径。 分析：简单的bfs，运用两次bfs便可求出。我这里用了两个数组来保存各自到达的时间。上代码 #include #include struct pep { int x, y; }; const int inf = 0x013f3f33; char map[205][205]; int map1[40050], map2[40050

Bear and Square Grid time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output You have a grid with n rows and n colu