| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 18483 | tlwpdus | 입자 가속기 (IZhO11_collider) | C++98 | 215 ms | 2176 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<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 %s ",&n,&m,str+1);
	for (i=0;i<m;i++) {
		char ch;
		int a, b;
		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 time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
