#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int k, m, n;
string s;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> k >> m >> s >> n;
vector<array<int, 3>> q(n);
for(auto &[L, R, P] : q) cin >> L >> R >> P;
reverse(q.begin(), q.end());
vector<int> v(k); iota(v.begin(), v.end(), 0);
for(auto [L, R, P] : q) {
for(int &u : v) if(P <= u) {
if(u < P + R-L) {
u = L + u-P;
} else {
u -= R-L;
}
}
}
for(int i=0;i<k;i++) cout << s[v[i]];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |