This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 202020;
int n, m, k, q, a[N], b[N], c[N]; string s;
int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    cin >> k >> m >> s >> q;
    n = s.size();
    for (int i = 1; i <= q; i++) {
        cin >> a[i] >> b[i] >> c[i];
    }
    for (int i = 1; i <= k; i++) {
        ll p = i;
        for (int j = q; j >= 1; j--) {
            if (c[j] + 1 <= p && p <= c[j] + b[j] - a[j])
                p = a[j] + (p - c[j]);
            else if (p > c[j] + b[j] - a[j])
                p -= (b[j] - a[j]);
        }
        cout << s[p - 1];
    }
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |