oj.uz

답안 #337939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
337939 2020-12-22T06:44:58 Z amunduzbaev 입자 가속기 (IZhO11_collider) C++14
100 / 100
 896 ms 2648 KB 
/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
const int N = 1e6+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
ll n, m, k, ans, ss, a[N];

vector<pii> tree;
vector<int> pp;

void solve(){
	fastios 
	cin>>n>>m;
	vector<char> vv(n);
	for(int i=0;i<n;i++) cin>>vv[i];
	for(int i=0;i<m;i++){
		char tt;
		cin>>tt;
		if(tt == 'a'){
			int i, j;
			cin>>i>>j;
			i--, j--;
			char val = vv[i];
			vv.erase(vv.begin() + i);
			vv.insert(vv.begin() + j, val);
		}else{
			int pos;
			cin>>pos;
			cout<<vv[--pos]<<endl;
		}
	}
	return;
}

int main(){
	fastios
	int t = 1;
	if(t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 11 ms 492 KB Output is correct
3 Correct 21 ms 620 KB Output is correct
4 Correct 233 ms 2028 KB Output is correct
5 Correct 458 ms 2116 KB Output is correct
6 Correct 629 ms 2284 KB Output is correct
7 Correct 720 ms 2540 KB Output is correct
8 Correct 308 ms 2540 KB Output is correct
9 Correct 896 ms 2648 KB Output is correct
10 Correct 611 ms 2508 KB Output is correct