Submission #68531398

---

Source Code Expand

#include <bits/stdc++.h>
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i = (a); i <= int(b); i++)

#if __has_include("shik/dump.h")
#include "shik/dump.h"  // IWYU pragma: keep
#else
#define dump(...) 0
#endif

using namespace std;

const int N = 5e5 + 10;
const int M = 2e5 + 10;

int n, m, ql[M], qr[M];
char s[N], t[N];
void input() {
  cin >> n >> m;
  cin >> *(char(*)[N - 1])(s + 1);
  cin >> *(char(*)[N - 1])(t + 1);
  REP(i, m) cin >> ql[i] >> qr[i];
}

int sw[N];
void solve() {
  REP(i, m) {
    int l = ql[i], r = qr[i];
    sw[l]^=1;
    sw[r + 1]^=1;
  }
  int xs = 0;
  REP1(i, 1, n) {
    xs ^= sw[i];
    if (xs) swap(s[i], t[i]);
  }
  cout << (s + 1) << '\n';
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  input();
  solve();
  return 0;
}

Submission Info

Judge Result