【CF】310 Div.1 C. Case of Chocolate

线段树的简单题目，做一个离散化，O（lgn）可以找到id。RE了一晚上，额，后来找到了原因。

/* 555C */
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <deque>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <cctype>
#include <cassert>
#include <functional>
#include <iterator>
#include <iomanip>
using namespace std;
//#pragma comment(linker,"/STACK:102400000,1024000")

#define sti                set<int>
#define stpii            set<pair<int, int> >
#define mpii            map<int,int>
#define vi                vector<int>
#define pii                pair<int,int>
#define vpii            vector<pair<int,int> >
#define rep(i, a, n)     for (int i=a;i<n;++i)
#define per(i, a, n)     for (int i=n-1;i>=a;--i)
#define clr                clear
#define pb                 push_back
#define mp                 make_pair
#define fir                first
#define sec                second
#define all(x)             (x).begin(),(x).end()
#define SZ(x)             ((int)(x).size())
#define lson            l, mid, rt<<1
#define rson            mid+1, r, rt<<1|1

typedef struct {
    int x, y;
    char op[4];
} node_t;

const int maxn = 2e5+5;
const int maxm = 4e5+5;
node_t Q[maxn];
int rn[maxm];
int mxr[maxm<<2];
int mxc[maxm<<2];
int rL[maxm<<2];
int cT[maxm<<2];
int L, R;

void build(int l, int r, int rt) {
    rL[rt] = 1;
    cT[rt] = 1;
    if (l == r)
        return ;
    
    int mid = (l+r)>>1;
    build(lson);
    build(rson);
}

inline void PushDownR(int rt) {
    int lb = rt<<1;
    int rb = lb | 1;
    
    if (mxr[rt]) {
        rL[rt] = max(rL[rt], mxr[rt]);
        mxr[lb] = max(mxr[lb], mxr[rt]);
        mxr[rb] = max(mxr[rb], mxr[rt]);
        mxr[rt] = 0;
    }
}

inline void PushDownC(int rt) {
    int lb = rt<<1;
    int rb = lb | 1;
    
    if (mxc[rt]) {
        cT[rt] = max(cT[rt], mxc[rt]);
        mxc[lb] = max(mxc[lb], mxc[rt]);
        mxc[rb] = max(mxc[rb], mxc[rt]);
        mxc[rt] = 0;
    }
}

inline void PushDown(int rt) {
    int lb = rt<<1;
    int rb = lb | 1;
    
    if (mxr[rt]) {
        rL[rt] = max(rL[rt], mxr[rt]);
        mxr[lb] = max(mxr[lb], mxr[rt]);
        mxr[rb] = max(mxr[rb], mxr[rt]);
        mxr[rt] = 0;
    }
    
    if (mxc[rt]) {
        cT[rt] = max(cT[rt], mxc[rt]);
        mxc[lb] = max(mxc[lb], mxc[rt]);
        mxc[rb] = max(mxc[rb], mxc[rt]);
        mxc[rt] = 0;
    }
}

void updateR(int delta, int l, int r, int rt) {
    if (L<=l && R>=r) {
        mxr[rt] = max(mxr[rt], delta);
        return ;
    }
    
    int mid = (l+r)>>1;
    
    PushDownR(rt);
    if (mid >= R) {
        updateR(delta, lson);
    } else if (mid < L) {
        updateR(delta, rson);
    } else {
        updateR(delta, lson);
        updateR(delta, rson);
    }
}

void updateC(int delta, int l, int r, int rt) {
    if (L<=l && R>=r) {
        mxc[rt] = max(mxc[rt], delta);
        return ;
    }
    
    int mid = (l+r)>>1;
    
    PushDownC(rt);
    if (mid >= R) {
        updateC(delta, lson);
    } else if (mid < L) {
        updateC(delta, rson);
    } else {
        updateC(delta, lson);
        updateC(delta, rson);
    }
}

pii query(int l, int r, int rt) {
    if (l == r) {
        rL[rt] = max(rL[rt], mxr[rt]);
        cT[rt] = max(cT[rt], mxc[rt]);
        mxr[rt] = 0;
        mxc[rt] = 0;
        
        pii p(rL[rt], cT[rt]);
        return p;
    }
    int mid = (l+r)>>1;
    
    PushDown(rt);
    if (mid >= R) {
        return query(lson);
    } else {
        return query(rson);
    }
}

int main() {
    ios::sync_with_stdio(false);
    #ifndef ONLINE_JUDGE
        freopen("data.in", "r", stdin);
        freopen("data.out", "w", stdout);
    #endif
    
    int n, q;
    mpii tb;
    sti st;
    
    scanf("%d %d", &n, &q);
    rep(i, 0, q) {
        scanf("%d %d %s", &Q[i].y, &Q[i].x, Q[i].op);
        st.insert(Q[i].x);
        st.insert(Q[i].y);
    }
    st.insert(1);
    
    int m = 0;
    int i, j, k;
    
    for (sti::iterator siter=st.begin(); siter!=st.end(); ++siter) {
        k = *siter;
        ++m;
        rn[m] = k;
        tb[k] = m;
    }
    
    int x, y, idx, idy;
    int ans;
    pii p;
    
    build(1, m, 1);
    rep(i, 0, q) {
        x = Q[i].x;
        y = Q[i].y;
        if (Q[i].op[0] == 'U') {
            idy = tb[y];
            L = R = idy;
            p = query(1, m, 1);
            updateC(x+1, 1, m, 1);
            ans = x - p.sec + 1;
            idx = tb[x];
            k = lower_bound(rn+1, rn+1+m, p.sec) - rn;
            L = k;
            R = idx;
            if (L <= R)
                updateR(y+1, 1, m, 1);
        } else {
            idx = tb[x];
            L = R = idx;
            p = query(1, m, 1);
            updateR(y+1, 1, m, 1);
            ans = y - p.fir + 1;
            idy = tb[y];
            k = lower_bound(rn+1, rn+1+m, p.fir) - rn;
            L = k;
            R = idy;
            if (L <= R)
                updateC(x+1, 1, m, 1);
        }
        #ifndef ONLINE_JUDGE
        printf("L = %d, R = %d\n", L, R);
        #endif
        if (ans < 0)
            ans = 0;
        printf("%d\n", ans);
    }
    
    #ifndef ONLINE_JUDGE
        printf("time = %d.\n", (int)clock());
    #endif
    
    return 0;
}