| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 158076 | muhammad_hokimiyon | Collider (IZhO11_collider) | C++14 | 666 ms | 4560 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>
#include <ext/rope>
//#pragma GCC optimize("Ofast")
#define fi first
#define se second
#define LL long long
using namespace std;
const int N = 1e6 + 7;
const int mod = 1e9 + 7;
const int B = 317;
int n,m;
string s;
string f;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen( "input.txt" , "r" , stdin );
    //freopen( "output.txt" , "w" , stdout );
    //freopen( "collider.in" , "r" , stdin );
    //freopen( "collider.out" , "w" , stdout );
    cin >> n >> m >> s;
    for( int i = 0; i < n; i++ )f.push_back(s[i]);
    for( int i = 1; i <= m; i++ ){
        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";
        }
    }
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
