CF1063B Labyrinth(双端bfs)

CF1063B Labyrinthhttps://www.luogu.com.cn/problem/CF1063B

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int n, m;
char s[2050][2050];
int x, y;
int r, c;
int go[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

struct node {
	int x, y, a, b;
	node(int x1, int y1, int a1, int b1): x(x1), y(y1), a(a1), b(b1) {
	}
};
int ans;
bool vis[2050][2050];

inline void bfs() {
	deque<node> q;
	ans++;
	q.push_front(node(r, c, 0, 0));
	vis[r][c] = true;
	while (!q.empty()) {
		node t = q.front();
		q.pop_front();
		for (int i = 0; i < 4; i++) {
			int tx = t.x + go[i][0];
			int ty = t.y + go[i][1];
			if (tx < 1 || ty < 1 || tx > n || ty > m || s[tx][ty] == '*' || vis[tx][ty]) {
				continue;
			}
			if (i == 0 || i == 2) {
				if (i == 0 && t.b < y) {
					q.push_back(node(tx, ty, t.a, t.b + 1));
					vis[tx][ty] = true;
					ans++;
				} else if (i == 2 && t.a < x) {
					q.push_back(node(tx, ty, t.a + 1, t.b));
					vis[tx][ty] = true;
					ans++;
				}
			} else {
				q.push_front(node(tx, ty, t.a, t.b));
				vis[tx][ty] = true;
				ans++;
			}
		}
	}
	printf("%d", ans);
}

int main() {
	scanf("%d %d", &n, &m);
	scanf("%d %d", &r, &c);
	scanf("%d %d", &x, &y);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			scanf(" %c", &s[i][j]);
		}
	}
	bfs();
	return 0;
}