oj.uz

답안 #338102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338102 2020-12-22T13:44:35 Z talant117408 입자 가속기 (IZhO11_collider) C++17
100 / 100
 357 ms 19580 KB 
/*
    Code written by Talant I.D.
*/
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/rope>
//#include <ext/pb_ds/assoc_container.hpp>
 
//using namespace __gnu_pbds;
using namespace __gnu_cxx;
using namespace std;
 
//typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}
 
class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n, 1); link.resize(n); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);
             
            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}
 
int main(){
    do_not_disturb
    
    int n, q;
    cin >> n >> q;
    rope <char> s;
    for(int i = 0; i < n; i++){
        char ch;
        cin >> ch;
        s.pb(ch);
    }
    while(q--){
        char type;
        cin >> type;
        if(type == 'a'){
            int x, y;
            cin >> x >> y;
            x--; y--;
            auto ch = s[x];
            s.erase(s.mutable_begin()+x);
            s.insert(s.mutable_begin()+y, ch);
        }
        else{
            int x;
            cin >> x;
            x--;
            cout << s[x] << endl;
        }
    }
    
    return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 31 ms 492 KB Output is correct
3 Correct 40 ms 3564 KB Output is correct
4 Correct 138 ms 14956 KB Output is correct
5 Correct 266 ms 15872 KB Output is correct
6 Correct 274 ms 17644 KB Output is correct
7 Correct 289 ms 18796 KB Output is correct
8 Correct 162 ms 17972 KB Output is correct
9 Correct 357 ms 19580 KB Output is correct
10 Correct 277 ms 18540 KB Output is correct