一句话题解:所有人到终点等它即可。。。
完全没想到是有多弱?。。。。。
#include#include #include #include #include #include #include #include #include using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define Rep(i,n) for(int i=0;i =0;i--)#define Forp(x) for(int p=pre[x];p;p=next[p])#define Lson (x<<1)#define Rson ((x<<1)+1)#define MEM(a) memset(a,0,sizeof(a));#define MEMI(a) memset(a,127,sizeof(a));#define MEMi(a) memset(a,128,sizeof(a));#define INF (2139062143)#define F (100000007)#define MAXN (1000+10) long long mul(long long a,long long b){return (a*b)%F;}long long add(long long a,long long b){return (a+b)%F;}long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}typedef long long ll;int n,m,tx,ty,sx,sy;char c[MAXN][MAXN];bool b[MAXN][MAXN]={0};int qx[MAXN*MAXN],qy[MAXN*MAXN],head=1,tail=1,d[MAXN][MAXN];void bfs(){ qx[1]=tx,qy[1]=ty;b[tx][ty]=1; memset(d,127,sizeof(d));d[tx][ty]=0; while (head<=tail) { int x=qx[head],y=qy[head]; if (1