#include <bits/stdc++.h>
#define pb push_back
#define endl "\n"
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define fname ""
#define sz(x) (int)(x.size())
typedef long long ll;
using namespace std;
const ll N = (ll)(5e5) + 322;
const ll INF = (ll)(1e9);
const ll mod = (ll)(1e9) + 7;
const double eps = 1e-9;
int n, k, x, y;
string s;
vector <char> v;
char type, ch;
int main () {
// cin.tie(0);
// ios_base :: sync_with_stdio(false);
// freopen(fname".in", "r", stdin);
//freopen(fname".out", "w", stdout);
cin >> n >> k;
// scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i) {
cin >> ch;
// scanf("%c", &ch);
v.pb(ch);
}
for (int i = 1; i <= k; ++i) {
cin >> type;
// scanf("%c", &type);
if (type == 'a') {
// scanf("%d%d", &x, &y);
cin >> x >> y;
ch = v[x - 1];
v.erase(v.begin() + x - 1);
if (x > y) {
v.insert(v.begin() + y - 1, ch);
}else {
v.insert(v.begin() + y - 2, ch);
}
}else {
cin >> x;
cout << v[x - 1] << endl;
// scanf("%d", &x);
// printf("%c\n", v[x - 1]);
}
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
| 2 |
Incorrect |
15 ms |
1720 KB |
Output isn't correct |
| 3 |
Incorrect |
23 ms |
1852 KB |
Output isn't correct |
| 4 |
Incorrect |
245 ms |
3260 KB |
Output isn't correct |
| 5 |
Incorrect |
401 ms |
3260 KB |
Output isn't correct |
| 6 |
Incorrect |
527 ms |
3260 KB |
Output isn't correct |
| 7 |
Incorrect |
595 ms |
3260 KB |
Output isn't correct |
| 8 |
Incorrect |
301 ms |
3260 KB |
Output isn't correct |
| 9 |
Incorrect |
698 ms |
3260 KB |
Output isn't correct |
| 10 |
Incorrect |
512 ms |
3260 KB |
Output isn't correct |
