# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166721 | Dilshod_Imomov | Collider (IZhO11_collider) | C++17 | 2 ms | 376 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>
//# pragma GCC optimize("Ofast")
# define pb push_back
# define ll long long
# define fi first
# define se second
# define all(vc) vc.begin(),vc.end()
# define forn(i, n) for (int i = 0; i < int(n); i++)
# define ford(i, n) for (int i = int(n) - 1; i >= 0; i--)
# define fore(i, l, r) for (int i = int(l); i < int(r); i++)
# define in freopen("input.txt", "r", stdin)
# define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
# define time cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"
using namespace std;
const ll INF = 1e18;
const int mod = 1e9 + 7;
const ll N = 1e7 + 7;
int n, m;
string s;
int main()
{
speed;
cin >> n >> m >> s;
forn( q, m ) {
char c;
cin >> c;
if ( c == 'a' ) {
int x, y;
cin >> x >> y;
x--,y--;
string t = "";
t = s[x];
s.erase( x, 1 );
s.insert( y, t );
}
else {
int x;
cin >> x;
cout << s[x - 1] << "\n";
}
}
time;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |