Problem - 1477B - B. Nezzar and Binary String（线段树+思维）

题目大意:·给定一个长度为$n$的仅由$0,1$组成的字符串,你需要进行$q$次操作,每次操作你需要保证区间$[l,r]$中的字符都相同,然后你可以修改小于$\lceil \frac{r-l}{2}\rceil$的任意个字符,求经过$q$此操作之后,能否保证每次操作时区间内字符都相同,且字符串$s$可以变成目标字符串$tar$.

解题思路:正向操作因为每次要先保证当前区间上字符都相同然后再进行操作,具体怎么操作不好确定,我们逆向思考一下.
将目标串一步步变回原始串,那么我们每次的目标就是将当前选中的区间变成只有一种字符的情况,那么就直接用线段树来模拟这个过程即可,如果无法修改,或者修改到最后无法得到初始串,那么就证明无法进行这样的操作.

#include<bits/stdc++.h>
using namespace std;
int xxxxxxxx;
#define ll long long
#define syncfalse ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
inline int lson(int rt){return rt<<1;}
inline int rson(int rt){return (rt<<1)|1;}

const int N = 2e5+5;
ll tree[N*4], tar[N*4];
char s[N], orign[N];
int l[N], r[N];
void pushup(int rt){
    tree[rt]=tree[lson(rt)] + tree[rson(rt)];
}

inline void f(int rt, ll l, ll r, ll k){
    tar[rt]=k;
    tree[rt]=k*(r-l+1);    //直接改写f函数来改写pushdown
}

void pushdown(int rt, ll l, ll r){
    if (tar[rt]!=-1){
        ll m = (l+r)>>1;
        f(lson(rt),l,m,tar[rt]);
        f(rson(rt),m+1,r,tar[rt]);
        tar[rt]=-1;
    }
}

void build(ll l, ll r, int rt){
	tar[rt]=-1;
    if (l==r){
        if (s[l]=='0')tree[rt]=0;
        else tree[rt]=1;
        return;
    }
    int m = (l+r)>>1;
    build(l,m,lson(rt));
    build(m+1,r,rson(rt));
    pushup(rt);
}

void update(ll l1, ll r1, ll c, ll l, ll r, int rt){
    if (l1 <= l && r <= r1){
        tar[rt]=c;             //针对不同的题目需要进行修改
        tree[rt]=(r-l+1)*c;
        return;
    }
    pushdown(rt,l,r);
    int m = (l+r)>>1;
    if(l1 <=m)update(l1,r1,c,l,m,lson(rt));
    if(r1>m)update(l1,r1,c,m+1,r,rson(rt));
    pushup(rt);
}

ll query(ll l1, ll r1, ll l, ll r, int rt){
    if (l1 <= l && r <= r1){
        return tree[rt];
    }
    pushdown(rt,l,r);
    int m = (l+r)>>1;
    ll ret = 0;
    if (l1<=m)ret+=query(l1,r1,l,m,lson(rt));
    if (r1>m)ret+=query(l1,r1,m+1,r,rson(rt));
    return ret;
}

void solve(){
    int n, q;
    cin>>n>>q;
    cin>>orign+1>>s+1;
    build(1, n, 1);
    for (int i = 1; i <= q; ++i)cin>>l[i]>>r[i];
    bool flag = true;
    for (int i = q; i >= 1; --i){
        int len = (r[i]-l[i])/2;
        int val1 = query(l[i], r[i], 1, n, 1);
        int val0 = r[i]-l[i]+1-val1;
        if (val1<=len){
            update(l[i], r[i], 0, 1, n, 1);
        }else if (val0<=len){
            update(l[i], r[i], 1, 1, n, 1);
        }else{
            flag=false;
        }
    }
    for (int i = 1; i <= n; ++i){
        int val = query(i, i, 1, n, 1);
        if (val+'0'!=orign[i]){
            flag=false;break;
        }
    }
    if (flag)cout << "YES\n";
    else cout << "NO\n";
}

int main(){
    syncfalse
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    int t;
    cin>>t;
    for (;t;--t){
        solve();
    }

    return 0;
}