제출 #469625

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
469625		spike1236	Collider (IZhO11_collider)	C++14	100 / 100	251 ms	20376 KiB

collider

#include <bits/stdc++.h>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>

const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

void solve() {
    rope <char> v;
    int n, m;
    cin >> n >> m;
    string s;
    cin >> s;
    for(int i = 0; i < n; ++i) v.pb(s[i]);
    for(int i = 0; i < m; ++i) {
        char type;
        cin >> type;
        if(type == 'a') {
            int x, y;
            cin >> x >> y;
            --x, --y;
            auto cur = v.substr(x, 1);
            v.erase(x, 1);
            v.insert(y, cur);
        } else {
            int x;
            cin >> x;
            --x;
            cout << v.substr(x, 1) << '\n';
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int CNT_TESTS = 1;
    ///cin >> CNT_TESTS;
    for(int NUMCASE = 1; NUMCASE <= CNT_TESTS; ++NUMCASE) {
        solve();
        if(NUMCASE != CNT_TESTS) cout << '\n';
    }
    return 0;
}

• Subtask 1: 100 / 100