oj.uz

Submission #18481

# Submission time Handle Problem Language Result Execution time Memory
18481 2016-02-05T17:21:26 Z tlwpdus Collider (IZhO11_collider) C++
0 / 100
 15 ms 2176 KB 
#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;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2176 KB Output isn't correct
2 Incorrect 4 ms 2176 KB Output isn't correct
3 Incorrect 3 ms 2176 KB Output isn't correct
4 Incorrect 0 ms 2176 KB Output isn't correct
5 Incorrect 4 ms 2176 KB Output isn't correct
6 Incorrect 0 ms 2176 KB Output isn't correct
7 Incorrect 15 ms 2176 KB Output isn't correct
8 Incorrect 0 ms 2176 KB Output isn't correct
9 Incorrect 10 ms 2176 KB Output isn't correct
10 Incorrect 4 ms 2176 KB Output isn't correct