Codeforces Round 698 Nezzar and Binary String

题目链接: Nezzar and Binary String.

显然每一次操作都会对后序序列产生影响，因而我们考虑倒着考虑，从结果字符串出发，根据询问区间去调整当前区间的01串，由于要求调整个数严格小于区间长度一半，因而若出现sum1 == sum0即错误，输出NO；否则根据需求进行调整。
显然这么分析下来，该题主要思路为区间询问，区间修改，传统做法肯定是采用线段树去做，但由于这里数据只有0和1，我们可以本着线段树的思想，采用set去做。

/*
 * @Author: your name
 * @Date: 2021-03-15 14:07:57
 * @LastEditTime: 2021-03-17 18:43:33
 * @LastEditors: Please set LastEditors
 * @Description: In User Settings Edit
 * @FilePath: \code_formal\cf\CF_698_4.cpp
 */
#include <iostream>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <cstdio>
#define pr printf
#define sc scanf
#define sf(n) scanf("%d", &n)
#define sff(n1, n2) scanf("%d %d", &n1, &n2)
#define sfff(n1, n2, n3) scanf("%d %d %d", &n1, &n2, &n3)
#define sl(n) scanf("%lld", &n)
#define sll(n1, n2) scanf("%lld %lld", &n1, &n2)
#define slll(n1, n2, n3) scanf("%lld %lld %lld", &n1, &n2, &n3)
#define for0(i, n) for (i = 0; i < n; i++)
#define for1n(i, n) for (i = 1; i <= n; i++)
#define foran(i, a, n) for (i = a; i <= n; i++)
#define forna(i, a, n) for (i = n; i >= a; i--)
#define pb push_back
#define fi first
#define se second
#define int long long
#define mem(ara, n) memset(ara, n, sizeof(ara))
#define memb(ara) memset(ara, false, sizeof(ara))
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define sz(x) x.size()
const int N = 2e5 + 100;
const int mod = 998244353;
namespace fastIO
{
    inline void input(int &res)
    {
        char c = getchar();
        res = 0;
        int f = 1;
        while (!isdigit(c))
        {
            f ^= c == '-';
            c = getchar();
        }
        while (isdigit(c))
        {
            res = (res << 3) + (res << 1) + (c ^ 48);
            c = getchar();
        }
        res = f ? res : -res;
    }
    inline int qpow(int a, int b)
    {
        int ans = 1, base = a;
        while (b)
        {
            if (b & 1)
                ans = (ans * base % mod + mod) % mod;
            base = (base * base % mod + mod) % mod;
            b >>= 1;
        }
        return ans;
    }
} // namespace fastIO
using namespace fastIO;

using namespace std;

const int maxn = 200007;
set<int> seg; // segment: [seg[i],seg[i+1])   其中seg[i]的值表示该区间的值
int n, q, i, prv;
int l[maxn], r[maxn];
bool val[maxn];
string s, f;

bool solve()
{
    cin >> n >> q;
    cin >> s >> f;
    for0(i, q)
            cin >>
        l[i] >> r[i],
        l[i]--;
    reverse(l, l + q);
    reverse(r, r + q);

    seg.clear();
    for0(i, n)
        seg.insert(i),
        val[i] = f[i] - '0';
    seg.insert(n);

    auto add = [&](int u) {
        if (seg.find(u) == seg.end())
        {
            auto ret = *prev(seg.upper_bound(u));
            val[u] = val[ret];
            seg.insert(u);
        }
    };

    for0(i, q)
    {
        add(l[i]), add(r[i]);
        vector<int> res;
        res.clear();
        int sum[2] = {0, 0};
        auto iter = seg.find(l[i]);
        for (; 1;)
        {
            if (*iter == r[i])
                break;
            int prev = *iter;
            iter = next(iter);
            if (*iter < r[i])
                res.pb(*iter);
            sum[val[prev]] += *iter - prev;
        }

        if (sum[0] == sum[1])
            return false;
        if (sum[0] < sum[1])
            val[l[i]] = 1;
        else
            val[l[i]] = 0;
        for (auto k : res)
            seg.erase(k);
    }

    prv = 0;
    for (auto c : seg)
    {
        if (!c)
            continue;
        for (int j = prv; j < c; ++j) //cout<<val[prv];
            if (s[j] != char('0' + val[prv]))
                return false;
        prv = c;
    }

    return true;
}

signed main()
{
    int _ = 1;
    sf(_);
    while (_--)
    {
        puts(solve() ? "YES" : "NO");
    }

    return 0;
}