麻烦的处理,然后写写写,码农题
#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
#include<queue>
#include<string>
#include<vector>
#include<set>
#include<algorithm>
#define maxn 1<<29
using namespace std;
char a[555][555];
bool c[555][555][4];
bool z[555][555][4];
int xx[4]= {-1,0,1,0};
int yy[4]= {0,-1,0,1};
int n,t;
int sx,sy,tx,ty;
int r[555][555];
bool vis[555][555];
void solve()
{
memset(vis,0,sizeof(v......
阅读全文