#include <bits/stdc++.h>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;
void solve() {
rope <char> v;
int n, m;
cin >> n >> m;
string s;
cin >> s;
for(int i = 0; i < n; ++i) v.pb(s[i]);
for(int i = 0; i < m; ++i) {
char type;
cin >> type;
if(type == 'a') {
int x, y;
cin >> x >> y;
--x, --y;
auto cur = v.substr(x, 1);
v.erase(x, 1);
v.insert(y, cur);
} else {
int x;
cin >> x;
--x;
cout << v.substr(x, 1) << '\n';
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int CNT_TESTS = 1;
///cin >> CNT_TESTS;
for(int NUMCASE = 1; NUMCASE <= CNT_TESTS; ++NUMCASE) {
solve();
if(NUMCASE != CNT_TESTS) cout << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
23 ms |
452 KB |
Output is correct |
3 |
Correct |
39 ms |
3568 KB |
Output is correct |
4 |
Correct |
95 ms |
15636 KB |
Output is correct |
5 |
Correct |
172 ms |
16660 KB |
Output is correct |
6 |
Correct |
196 ms |
18464 KB |
Output is correct |
7 |
Correct |
210 ms |
19584 KB |
Output is correct |
8 |
Correct |
112 ms |
18652 KB |
Output is correct |
9 |
Correct |
251 ms |
20376 KB |
Output is correct |
10 |
Correct |
193 ms |
19516 KB |
Output is correct |