oj.uz

Submission #58060

# Submission time Handle Problem Language Result Execution time Memory
58060 2018-07-16T16:49:36 Z Benq Collider (IZhO11_collider) C++14
100 / 100
 456 ms 25856 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope> 

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int n,m;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    rope<char> r;
    F0R(i,n) {
        char c; cin >> c;
        r.pb(c);
    }
    F0R(i,m) {
        char c; cin >> c;
        if (c == 'a') {
            int x,y; cin >> x >> y; x--, y--; 
            char c = r[x]; r.erase(r.mutable_begin()+x);
            r.insert(r.mutable_begin()+y,c);
        } else {
            int x; cin >> x; x--;
            cout << r[x] << "\n";
        }
    }
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 33 ms 604 KB Output is correct
3 Correct 58 ms 3952 KB Output is correct
4 Correct 183 ms 15656 KB Output is correct
5 Correct 318 ms 17576 KB Output is correct
6 Correct 456 ms 20168 KB Output is correct
7 Correct 417 ms 22416 KB Output is correct
8 Correct 194 ms 22660 KB Output is correct
9 Correct 429 ms 25344 KB Output is correct
10 Correct 299 ms 25856 KB Output is correct