oj.uz

답안 #17321

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
17321 2015-11-20T10:35:16 Z gs14004 입자 가속기 (IZhO11_collider) C++14
0 / 100
 80 ms 4668 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <iostream>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
const int B = 1000;

char buck[1005][2005];
int len[1005];

char buf[1000005];

int n, m;

pi get(int x){
	if(x == n+1){
		int p = 1004;
		while(!len[p] && p >= 0){
			p--;
		}
		return pi(p, len[p]);
	}
	int p = 0, sum = 0;
	while(p){
		if(x <= len[p]){
			break;
		}
		sum += len[p];
		x -= len[p++];
	}
	return pi(p, x-1);
}

void reinit(){
	int p = 0;
	for(int i=0; i<1005; i++){
		for(int j=0; j<len[i]; j++){
			buf[p++] = buck[i][j];
		}
		len[i] = 0;
	}
	for(int i=0; i<n; i++){
		buck[i/B][len[i/B]++] = buf[i];
	}
}

int main(){
	scanf("%d %d %s",&n,&m,buf);
	for(int i=0; i<n; i++){
		buck[i/B][len[i/B]++] = buf[i];
	}
	for(int i=0; i<m; i++){
		if(i%B == B-1){
			reinit();
		}
		char buf[5];
		scanf("%s",buf);
		if(*buf == 'a'){
			int a, b;
			scanf("%d %d",&a,&b);
			pi pa, pb;
			if(a < b){
				pa = get(a);
				pb = get(b+1);
			}
			else{
				pa = get(a);
				pb = get(b);
			}
			char c = buck[pa.first][pa.second];
			for(int i=pa.second; i<len[pa.first]-1; i++){
				buck[pa.first][i] = buck[pa.first][i+1];
			}
			len[pa.first]--;
			for(int i=len[pb.first]; i>pb.second; i--){
				buck[pb.first][i] = buck[pb.first][i-1];
			}
			buck[pb.first][pb.second] = c;
			len[pb.first]++;
		}
		else{
			int t;
			scanf("%d",&t);
			pi r = get(t);
			printf("%c\n",buck[r.first][r.second]);
		}
	}
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 4668 KB Output isn't correct
2 Incorrect 11 ms 4668 KB Output isn't correct
3 Incorrect 0 ms 4668 KB Output isn't correct
4 Incorrect 22 ms 4668 KB Output isn't correct
5 Incorrect 44 ms 4668 KB Output isn't correct
6 Incorrect 61 ms 4668 KB Output isn't correct
7 Incorrect 53 ms 4668 KB Output isn't correct
8 Incorrect 26 ms 4668 KB Output isn't correct
9 Incorrect 80 ms 4668 KB Output isn't correct
10 Incorrect 51 ms 4668 KB Output isn't correct