Submission #18481

#TimeUsernameProblemLanguageResultExecution timeMemory
18481tlwpdusCollider (IZhO11_collider)C++98
0 / 100
15 ms2176 KiB
#include<stdio.h> #include<algorithm> using namespace std; int n, m; char str[1000100]; int s[15010], e[15010], key; int main() { int i, j; scanf("%d %d",&n,&m); scanf("%s",str+1); for (i=0;i<m;i++) { char ch; int a, b; scanf("%c",&ch); scanf("%c",&ch); if (ch=='a') { scanf("%d %d",&s[key],&e[key]); key++; } else { scanf("%d",&a); for (j=key-1;j>=0;j--) { if (min(s[j],e[j])>a||max(s[j],e[j])<a) continue; if (e[j]==a) a = s[j]; else if (e[j]>s[j]) a++; else a--; } printf("%c\n",str[a]); } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...