# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
299859 | mohamedsobhi777 | Collider (IZhO11_collider) | C++14 | 386 ms | 28944 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")
//#pragma GCC optimize("trapv")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")*/
#define I inline void
#define S struct
#define vi vector<int>
#define vii vector<pair<int,int>>
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std ;
using namespace __gnu_cxx ;
using ll = long long ;
using ld = long double ;
const int N = 5e5 + 7 , mod = 1e9 + 7 ;
const int inf = N ;
// How interesting!
int n , m ;
string s ;
int main(){
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin >> n >> m;
rope<int> rp (n , 0) ;
cin >> s ;
for(int i = 0 ;i < n;i++){
rp.mutable_reference_at(i) = s[i] - 'a' ;
}
for(int i = 0 ;i < m; i ++){
char a ;
int b , c;
cin >> a ;
if(a == 'a'){
cin >> b >> c ;
b -- ; c-- ;
int x = rp[b] ;
rp.erase(b , 1) ;
rp.insert(c, x );
}else{
cin >> b ;
int x = rp[b-1] ;
cout<< char(x + 'a') <<"\n" ;
}
}
return 0 ;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |