提出 #68562012

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define int long long
int d[500005];
void solve()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i < +n; i++)
    {
        d[i] = 0;
    }
    string s1, s2;
    cin >> s1;
    cin >> s2;
    s1 = ' ' + s1;
    s2 = ' ' + s2;
    for (int i = 1; i <= m; i++)
    {
        int l, r;
        cin >> l >> r;
        d[l]++;
        d[r + 1]--;
    }
    for (int i = 1; i <= n; i++)
    {
        d[i] = d[i - 1] + d[i];
    }
    for (int i = 1; i <= n; i++)
    {
        if (d[i] % 2 == 1)
            cout << s2[i];
        else
            cout << s1[i];
    }
    cout << '\n';
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}

提出情報

ジャッジ結果