Codeforces 1064D Labyrinth(双端队列BFS)

题意：

给一个图，"*"不可以走，给你一个起点，限制向左走L次，向右走R次，上下不限制，问你最多可以走到多少个格子

思路：

BFS，每次将上下走的策略加入队首，左右加入队尾，（相当于上下走比左右走优先级大的优先队列），这样可以保证先到某一格时剩余的疲劳度是最大的

但是，，如果上下左右都限制，该咋办啊。。有没有大佬能给个思路啊

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<vector>
#include<map>
#include<functional>

#define fst first
#define sc second
#define pb push_back
#define mem(a,b) memset(a,b,sizeof(a))
#define lson l,mid,root<<1
#define rson mid+1,r,root<<1|1
#define lc root<<1
#define rc root<<1|1
#define lowbit(x) ((x)&(-x)) 

using namespace std;

typedef double db;
typedef long double ldb;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PI;
typedef pair<ll,ll> PLL;

const db eps = 1e-;
const int mod = ;
const int maxn = 2e6+;
const int maxm = 2e6+;
const int inf = 0x3f3f3f3f;
const db pi = acos(-1.0);

int n, m;
int rx, ry;
int L, R;
char a[ + ][ + ];
int vis[ + ][ + ];
struct node{
    int l, r;
    int x, y;
    node(int x=, int y=, int l=, int r=):x(x),y(y),l(l),r(r){}
};
deque<node>q;
int main() {
    mem(vis, );
    scanf("%d %d", &n, &m);
    scanf("%d %d", &rx, &ry);
    scanf("%d %d", &L, &R);
    for(int i = ; i <= n; i++)scanf("%s",a[i]+);
    q.push_front(node(rx,ry,L,R));
    while(!q.empty()){
        node p = q.front();
        q.pop_front();
        int x = p.x;
        int y = p.y;
        int l = p.l;
        int r = p.r;
        //printf("%d %d %d %d\n", x,y,l,r);
        if(vis[x][y])continue;
        vis[x][y]=;
        if(l&&y->=&&a[x][y-]=='.'){
            q.push_back(node(x,y-,l-,r));
        }
        if(r&&y+<=m&&a[x][y+]=='.'){
            q.push_back(node(x,y+,l,r-));
        }

        if(x+<=n&&a[x+][y]=='.'){
            q.push_front(node(x+,y,l,r));
        }
        if(x->=&&a[x-][y]=='.'){
            q.push_front(node(x-,y,l,r));
        }

    }
    int ans = ;
    for(int i = ; i <= n; i++){
        for(int j = ; j <= m; j++){
            if(vis[i][j]==){ans++;
            }
        }
    }
    printf("%d", ans);
    return ;

}
/*
6 5
1 5
5 1
.....
.***.
...*.
*.**.
*.**.
*....
 */