# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17878 | Adilkhan | Collider (IZhO11_collider) | C++98 | 155 ms | 4136 KiB |
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>
#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;
string s;
int n, k, x, y, id;
vector <pair <int, int> > v;
char type;
int main () {
ios_base :: sync_with_stdio (false);// cin.tie(0);
// freopen(fname".in", "r", stdin);
// freopen(fname".out", "w", stdout);
cin >> n >> k >> s;
for (int i = 1; i <= k; ++i) {
cin >> type;
if (type == 'a') {
cin >> x >> y;
v.pb(mp(x, y));
}else {
cin >> id;
for (int j = sz(v) - 1; j >= 0; --j) {
if (v[j].se == id) {id = v[j].fi; continue;}
if (v[j].se < id) id--;
if (v[j].fi <= id) id++;
}
cout << s[id - 1] << endl;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |