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;
const int MN = 2e5+5;
int K,M,N,T[200],A[MN],B[MN],C[MN];
char S[MN];
int main()
{
cin >> K >> M >> S >> N;
for(int i=0; i<N; i++) cin >> A[i] >> B[i] >> C[i];
for(int j=0; j<200; j++) T[j] = j;
for(int i=N-1; i>=0; i--){
for(int j=0; j<K; j++){
if(T[j]<C[i]) continue;
if(T[j]<C[i]+B[i]-A[i]) T[j] = T[j]+A[i]-C[i];
else T[j] = T[j]-B[i]+A[i];
}
}
for(int i=0; i<K; i++) cout << S[T[i]];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |