oj.uz

Submission #17877

# Submission time Handle Problem Language Result Execution time Memory
17877 2016-01-13T04:38:55 Z Erzhann Collider (IZhO11_collider) C++
100 / 100
 594 ms 6204 KB 
/*
  /\     /\
  | ).|.( |
  |  >-<  |
  =========
It's AdilkhanKo miaaaaaau      
*/
#include<bits/stdc++.h>

#define ll long long
#define pb push_back
#define endl "\n"
#define foreach(it, S) for(__typeof (S.begin()) it = S.begin(); it != S.end(); it++)
#define mp make_pair
#define f first
#define s second 
#define name ""
#define _ ios_base::sync_with_stdio(false);cin.tie(0);

using namespace std;
                                            
const int MaxN = int (2e5) + 256;
const int INF = int(1e9);  
const int mod = (int)(1e9) + 7;
int n, a[MaxN], m, t;
vector<char> v;

int main () { _
	/*#ifdef ONLINE_JUDGE
		freopen (name".in","r",stdin);
		freopen (name".out","w",stdout);
	#else
		freopen (".in","r",stdin);
		freopen (".out","w",stdout);
	#endif*/
	cin >> n >> m;
	string s; cin >> s;
	for(int i = 0; i < s.size(); i++)
		v.pb(s[i]);
	for(int i = 1; i <= m; i++){
		char ch; cin >> ch;
		if(ch == 'a'){
			int x, y; cin >> x >> y;
			char C = v[x - 1];
			v.erase(v.begin() + x - 1);
			v.insert(v.begin() + y - 1, C);
		}else{
			int x; cin >> x;
			cout << v[x - 1] << endl;
		}
	}
return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2496 KB Output is correct
2 Correct 0 ms 2496 KB Output is correct
3 Correct 20 ms 2988 KB Output is correct
4 Correct 163 ms 6204 KB Output is correct
5 Correct 314 ms 6204 KB Output is correct
6 Correct 438 ms 6204 KB Output is correct
7 Correct 480 ms 6204 KB Output is correct
8 Correct 205 ms 6204 KB Output is correct
9 Correct 594 ms 6204 KB Output is correct
10 Correct 402 ms 6204 KB Output is correct