답안 #915593

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
915593	2024-01-24T09:10:28 Z	Whisper	입자 가속기 (IZhO11_collider)	C++14	0 / 100	102 ms	262144 KB

collider

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using T = tuple<ll, ll, ll>;

#define int long long
#define Base 41
#define sz(a) (int)a.size()
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define all(x) x.begin() , x.end()
#define pii pair<int , int>
#define fi first
#define se second
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e6 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }

int N, Q;
string S;
#define Block 1000


deque<char> a[MAX];
void modify(int l, int r){
    int BlockL = l / Block;
    int BlockR = r / Block;
    int pos_l = l % Block;
    int pos_r = r % Block;
    if (BlockL == BlockR){
        char c = a[BlockL][pos_l];
        a[BlockL].erase(a[BlockL].begin() + pos_l);
        a[BlockL].insert(a[BlockL].begin() + pos_r, c);
    }
    else{
        if (l <= r){
            char c = a[BlockL][pos_l];
            a[BlockL].erase(a[BlockL].begin() + pos_l);
            a[BlockR].insert(a[BlockR].begin() + pos_r + 1, c);
            for (int block = BlockL + 1; block <= BlockR; ++block){
                char c = a[block].front(); a[block].pop_front();
                a[block - 1].push_back(c);
            }
        }
        else{
            char c = a[BlockL][pos_l];
            a[BlockL].erase(a[BlockL].begin() + pos_l);
            a[BlockR].insert(a[BlockR].begin() + pos_r, c);
            for (int block = BlockR + 1; block <= BlockL; ++block){
                char c = a[block - 1].back(); a[block - 1].pop_back();
                a[block].push_front(c);
            }
        }
    }
}

char query(int ord){
    int block = ord / Block;
    int pos = ord % Block;
    return a[block][pos];
}
void Whisper(){
    cin >> N >> Q >> S;
    for (int i = 0; i < N; ++i){
        a[i / Block].push_back(S[i]);
    }

    for (int i = 1; i <= Q; ++i){
        char c; cin >> c;
        if (c == 'a'){
            int l, r; cin >> l >> r;
            --l, --r;
            modify(l, r);
        }
        else{
            int ord; cin >> ord;
            --ord;
            cout << query(ord) << "\n";
        }
    }
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1

0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	102 ms	262144 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-