leekerian的博客

把整个地图在最外面再加一圈这样外面的空白就变成了联通的了然后就能用求联通块的方法求#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>#include <vector>#include <set>using na...

#include <iostream>#include <cstring>#include <cstdio>#include <queue>#include <vector>using namespace std;const int MAXN=11;struct node{ int r,c,dir; ...