BZOJ3165 [Heoi2013]Segment

恩。。线段树维护凸壳。。。什么鬼

介绍什么的略。为甚我的程序略长。。。

/**************************************************************
    Problem: 3165
    User: rausen
    Language: C++
    Result: Accepted
    Time:1820 ms
    Memory:5180 kb
****************************************************************/
 
#include <cstdio>
#include <algorithm>
 
using namespace std;
typedef double lf;
 
const int n = 40005;
const int mod1 = 39989;
const int mod2 = 1e9;
const int Cnt_seg = n << 2;
const lf inf = 1e60;
 
struct line {
    lf k, b;
    int id;
};
 
struct data {
    lf v;
    int id;
    data() {}
    data(lf _v, int _i) : v(_v), id(_i) {}
     
    friend inline bool operator < (const data &x, const data &y) {
        if (x.id == 0) return 1;
        if (y.id == 0) return 0;
        return x.v == y.v ? x.id > y.id : x.v < y.v;
    }
};
 
struct seg_node {
    seg_node *ls, *rs;
    line li;
} *seg_root, mempool[Cnt_seg], *cnt_seg = mempool;
 
int ans, cnt_id;
 
inline void calc(int &x, int y) {
    ((x += ans - 1) %= y) += 1;
}
 
#define K l.k
#define B l.b
#define ID l.id
inline line make_line(int x0, int y0, int x1, int y1) {
    line l;
    ID = ++cnt_id;
    if (x0 == x1) K = 0, B = max(y0, y1);
    else K = (lf) (y0 - y1) / (x0 - x1), B = y0 - K * x0;
    return l;
}
 
inline lf get_point(line l, int x) {
    return ID == 0 ? -inf : K * (lf) x + B;
}
#undef K
#undef B
#undef ID
 
#define mid (l + r >> 1)
#define Li p -> li
#define Ls p -> ls
#define Rs p -> rs
void seg_build(seg_node *&p, int l, int r) {
    p = ++cnt_seg;
    Li.id = 0;
  if (l == r) return;
    seg_build(Ls, l, mid), seg_build(Rs, mid + 1, r);
}
 
void seg_update(seg_node *p, int l, int r, line li) {
    if (Li.id == 0) Li = li;
    if (get_point(Li, l) < get_point(li, l)) swap(Li, li);
    if (l == r || Li.k == li.k) return;
    lf w = (Li.b - li.b) / (li.k - Li.k);
    if (w < l || w > r) return;
    if (w <= mid) seg_update(Ls, l, mid, Li), Li = li;
    else seg_update(Rs, mid + 1, r, li);
}
 
void seg_insert(seg_node *p, int l, int r, int L, int R, line li) {
    if (L <= l && r <= R) {
        seg_update(p, l, r, li);
        return;
    }
    if (L <= mid) seg_insert(Ls, l, mid, L, R, li);
    if (mid < R) seg_insert(Rs, mid + 1, r, L, R, li);
}
 
#define Data data(get_point(Li, w), Li.id)
data seg_query(seg_node *p, int l, int r, int w) {
    if (l == r) return Data;
    if (w <= mid) return max(Data, seg_query(Ls, l, mid, w));
    else return max(Data, seg_query(Rs, mid + 1, r, w));
}
#undef mid
#undef Ls
#undef Rs
#undef L
 
int main() {
    seg_build(seg_root, 1, n);
    int Q, oper, x, y, x0, y0, x1, y1;
    scanf("%d", &Q);
    while (Q--) {
        scanf("%d", &oper);
        if (oper == 0) {
            scanf("%d", &x);
            calc(x, mod1);
            printf("%d
", ans = seg_query(seg_root, 1, n, x).id);
        } else {
            scanf("%d%d%d%d", &x0, &y0, &x1, &y1);
            calc(x0, mod1), calc(x1, mod1), calc(y0, mod2), calc(y1, mod2);
            if (x0 > x1)
                swap(x0, x1), swap(y0, y1);
            seg_insert(seg_root, 1, n, x0, x1, make_line(x0, y0, x1, y1));
        }
    }
    return 0;
}