cf1236D. Alice and the Doll

链接

点击跳转

题解

用$deque$维护每行每列的黑格子位置，然后每次pop_front掉不合法的，找到我走到的位置，跳过去，记录走过的总路程

最后看下总路程是不是等于$nm-k$

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
ll dx[]{0,1,0,-1}, dy[]{1,0,-1,0}, n, m, k, px[maxn], py[maxn];
deque<ll> dq[4][100010];
int no()
{
    cout<<"No";
    return 0;
}
int yes()
{
    cout<<"Yes";
    return 0;
}
bool bad(ll d, ll now, ll to)
{
    if(d<=1)return to<now;
    else return to>now;
}
int main()
{
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    ll i, j, x, y, bound[4], d;
    cin>>n>>m>>k;
    bound[0]=m+1, bound[1]=n+1, bound[2]=0, bound[3]=1;
    rep(i,k)
    {
        cin>>px[i]>>py[i];
        x=px[i], y=py[i];
        dq[0][x].emb(y);
        dq[2][x].emb(y);
        dq[1][y].emb(x);
        dq[3][y].emb(x);
    }
    rep(i,n)
    {
        dq[0][i].emb(m+1), dq[2][i].emb(0);
        sort(dq[0][i].begin(),dq[0][i].end());
        sort(dq[2][i].begin(),dq[2][i].end(),[](ll x, ll y){return x>y;});
    }
    rep(i,m)
    {
        dq[1][i].emb(n+1), dq[3][i].emb(0);
        sort(dq[1][i].begin(),dq[1][i].end());
        sort(dq[3][i].begin(),dq[3][i].end(),[](ll x, ll y){return x>y;});
    }
    x=y=1;
    d=0;
    ll cnt=1;
    while(1)
    {
        ll t, now, f;
        if(d&1)t=y;
        else t=x;
        auto &q = dq[d][t];
        now=x+y-t;
        while(bad(d,now,q.front()))q.pop_front();
        ll to;
        if(d<=1)to=min(q.front(),bound[d])-1;
        else to=max(q.front(),bound[d])+1;
        if(to==now)break;
        cnt+=abs(now-to);
        if(d&1)x=bound[d]=to;
        else y=bound[d]=to;
        d=(d+1)&3;
    }
    if(cnt==n*m-k)return yes();
    if(x!=1 or y!=1)return no();
    d=1;
    cnt=1;
    while(1)
    {
        ll t, now, f;
        if(d&1)t=y;
        else t=x;
        auto &q = dq[d][t];
        now=x+y-t;
        while(bad(d,now,q.front()))q.pop_front();
        ll to;
        if(d<=1)to=min(q.front(),bound[d])-1;
        else to=max(q.front(),bound[d])+1;
        if(to==now)break;
        cnt+=abs(now-to);
        if(d&1)x=bound[d]=to;
        else y=bound[d]=to;
        d=(d+1)&3;
    }
    if(cnt==n*m-k)return yes();
    return no();
}