QAQ的小耗子的博客

#include <iostream>#include <stdio.h> #include <queue>using namespace std;struct node{ int x; int y;};queue<node> Q;const int maxn=200;int map[maxn][maxn];bool book[maxn][maxn]...

#include <iostream>#include <queue> using namespace std;struct node{ int x,y,step;};queue<node> Q;int m,n;const int maxn=200;char map[maxn][maxn];bool book[maxn][maxn]={false};int ne...

#include <iostream>#include <stdio.h>#include <queue>using namespace std;struct node{ int x,y,z;};int m,n,l,T;int map[1300][130][61];bool book[1300][130][61]={false};int next1[6][3]=...