CF863D

http://codeforces.com/contest/863/problem/D

treap 搞搞。

#include <bits/stdc++.h>

using namespace std;

const int N = 200010;

struct permrand {
  permrand() : it(0) {
    for (int i = 0; i < N; i++) {
      a[i] = i;
    }
    random_shuffle(a, a + N);
  }
  int operator () () { return next(); }
  int next() { return a[it++]; }
  int a[N], it;
} rnd;

typedef struct treap_* treap;
struct treap_ {
  int x, cnt, size, pri;
  bool rev;
  treap l, r;

  treap_(int x) : x(x), cnt(1), size(1), pri(rnd()), rev(false) {
  }
  treap_() {
  }
  void push() {
    if (rev) {
      rev = false;
      swap(l, r);
      if (l) {
        l->rev ^= 1;
      }
      if (r) {
        r->rev ^= 1;  
      }
    }
  }
  void pull() {
    size = cnt + (l ? l->size : 0) + (r ? r->size : 0);
  }
};

int tsize(treap v) { return v ? v->size : 0; }

void split(treap v, treap &l, treap &r, int x, int add = 0) {
  if (!v) {
    l = r = NULL;
    return;
  }
  v->push();
  int key = tsize(v->l) + add;
  if (key <= x) {
    l = v;
    split(v->r, v->r, r, x, add + 1 + tsize(v->l));
  } else {
    r = v;
    split(v->l, l, v->l, x, add);
  }
  v->pull();
}

treap merge(treap l, treap r) {
  if (!l) {
    return r;
  }
  if (!r) {
    return l;
  }
  if (l->pri < r->pri) {
    l->push();
    l->r = merge(l->r, r);
    l->pull();
    return l;
  } else {
    r->push();
    r->l = merge(l, r->l);
    r->pull();
    return r;
  }
  assert(false);
}

void print(treap v, vector<int> &res) {
  if (!v) {
    return;  
  }
  v->push();
  print(v->l, res);
  res.push_back(v->x);
  print(v->r, res);
}

treap_ pool[N];
int last;

void build(treap &v, int l, int r, const vector<int> &a) {
  if (l > r) {
    return;
  }
  int y = (l + r) >> 1;
  v = &(pool[last++] = treap_(a[y]));
  build(v->l, l, y - 1, a);
  build(v->r, y + 1, r, a);
  v->pull();
}

int main() {
  int n, q, m;
  scanf("%d %d %d", &n, &q, &m);
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  treap t = NULL;
  build(t, 0, n - 1, a);
  for (int i = 0; i < q; i++) {
    int type, l, r;
    scanf("%d %d %d", &type, &l, &r);
    l--, r--;
    if (type == 1) {
      if (l == r) {
        continue;
      }
      treap t1, t2, t3;
      split(t, t, t1, l - 1);
      split(t1, t1, t2, r - l);
      assert(tsize(t1) == r - l + 1);
      split(t1, t1, t3, r - l - 1);
      assert(tsize(t3) == 1);
      t1 = merge(t3, t1);
      t = merge(t, merge(t1, t2));
    } else {
      treap t1, t2;
      split(t, t, t1, l - 1);
      split(t1, t1, t2, r - l);
      assert(tsize(t1) == r - l + 1);
      t1->rev ^= 1;
      t = merge(t, merge(t1, t2));
    }
  }
  vector<int> res;
  print(t, res);
  for (int i = 0; i < m; i++) {
    int id;
    scanf("%d", &id);
    id--;
    printf("%d%c", res[id], " \n"[i == m - 1]);
  }
  return 0;
}