oj.uz

Submission #13312

# Submission time Handle Problem Language Result Execution time Memory
13312 2015-02-11T16:07:27 Z woqja125 Collider (IZhO11_collider) C++
90 / 100
 53 ms 9888 KB 
#include<stdio.h>
#include<vector>
int buk[1001][2001];
int bs[1001];
char in[1000001];
int main()
{
	int n, m;
	int i, j, k;
	int a, b, bn;
	scanf("%d%d", &n, &m);
	scanf("%s", in);
	j=0;
	for(i=0; j<n; i++)
	{
		for(k=j; k<j+1000 && k<n; k++)
		{
			buk[i][k-j] = in[k]-'x';
			bs[i]++;
		}
		j = k;
	}
	for(;m--;)
	{
		scanf("%s", in);
		if(in[0] == 'a')
		{
			scanf("%d%d", &a, &b); a--; b--;
			int t;
			bn = 0;
			j = 0;
			for(i=0; i<a; )
			{
				if(i+bs[bn] <= a) i+=bs[bn++];
				else{i++;j++;}
			}
			bs[bn]--;
			t = buk[bn][j];
			for(; j<bs[bn]; j++) buk[bn][j] = buk[bn][j+1];
			bn = 0;
			j = 0;
			for(i=0; i<b; )
			{
				if(i+bs[bn] <= b) i+=bs[bn++];
				else{i++;j++;}
			}
			bs[bn]++;
			for(k=bs[bn]-1; k>j; k--) buk[bn][k] = buk[bn][k-1];
			buk[bn][j] = t;
		}
		else
		{
			scanf("%d", &a);a--;

			bn = 0;
			j = 0;
			for(i=0; i<a; )
			{
				if(i+bs[bn] <= a) i+=bs[bn++];
				else{i++;j++;}
			}
			printf("%c\n", buk[bn][j]+'x');
		}
	}
	return 0;
}

Subtask #1
90.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9888 KB Output is correct
2 Incorrect 23 ms 9888 KB Output isn't correct
3 Correct 12 ms 9888 KB Output is correct
4 Correct 16 ms 9888 KB Output is correct
5 Correct 36 ms 9888 KB Output is correct
6 Correct 47 ms 9888 KB Output is correct
7 Correct 53 ms 9888 KB Output is correct
8 Correct 17 ms 9888 KB Output is correct
9 Correct 53 ms 9888 KB Output is correct
10 Correct 41 ms 9888 KB Output is correct