# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
36280 | Kerim | Collider (IZhO11_collider) | C++14 | 279 ms | 2992 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.
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("avx")
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N=1e6+7;
char s[N];
int main(){
//~ freopen("file.in", "r", stdin);
int n,q;
scanf("%d%d",&n,&q);
scanf("%s",s+1);
while(q--){
char type;
scanf(" %c",&type);
if(type=='a'){
int l,r;
scanf("%d%d",&l,&r);
if(l>r){
swap(l,r);
char jump=s[r];
for(int i=r-1;i>=l;i--)
s[i+1]=s[i];
s[l]=jump;
}
else{
char jump=s[l];
for(int i=l+1;i<=r;i++)
s[i-1]=s[i];
s[r]=jump;
}
}
else{
int p;
scanf("%d",&p);
printf("%c\n",s[p]);
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |