Submission #68533396

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define fi first
#define se second
#define ld long double
#define pi pair<int, int>
#define mp make_pair
#define vi vector<int>
#define vvi vector<vector<int>>

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

const int INF = (int)4e18;
const int MODa = 1e9 + 7;
const int MOD = 998244353;

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void solve()
{
    int n, m;
    cin>>n>>m;

    string s, t;
    cin>>s>>t;
    s = " " + s;
    t = " " + t;


    vector<int> segs(n+2, 0);

    for(int i=1; i<=m; i++)
    {
        int l, r;
        cin>>l>>r;
        segs[l]++;
        segs[r+1]--;
    }

    int cr = 0;
    for(int i=1; i<=n; i++)
    {
        cr += segs[i];
        if(cr%2)
        {
            swap(s[i], t[i]);
        }
    }

    cout<<s<<"\n";
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;  
    // cin>>t;
    while(t--)
    {
        solve();
    }

    return 0;
}

Submission Info

Judge Result