POJ 2528

其实就是区间用N个操作染色，问最后有多少种不同的颜色，注意由于范围较大需要map。

先拍了一个裸的，之所以称之为裸的是因为我觉得pushup是没必要存在的，先这样吧，改天再更新。

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

#define MAXV    32768

int _v[MAXV << 1], *const v = &_v[-1];
int _dirty[MAXV << 1], *const dirty = &_dirty[-1];

#define recursive_def    int l, int r, int i
#define lsi            i<<1
#define rsi            i<<1 | 1
#define lsn            l, m, lsi
#define rsn            m+1, r, rsi
#define pushdown    if (dirty[i]) {
    dirty[lsi] = dirty[rsi] = dirty[i];    
    v[lsi] = v[rsi] = dirty[i];        
    dirty[i] = 0;}
#define pushup        (v[i] = v[lsi] != v[rsi]? -1 : v[lsi]);

void build(recursive_def)
{
    v[i] = dirty[i] = 0;
    if (l != r) {
        int m = l+r >> 1;
        build(lsn), build(rsn);
    }
}

void update(int L, int R, int val, recursive_def)
{
    if (L<=l && r<=R) v[i] = dirty[i] = val;
    else {
        pushdown
        int m = l+r >> 1;
        if (L<=m) update(L, R, val, lsn);
        if (m < R) update(L, R, val, rsn);
        pushup
    }
}

char mark[10005];

int query(recursive_def){
    if (v[i] >= 0)
        if (!mark[v[i]]) {
            mark[v[i]] = 1;
            return 1;
        } else return 0;
    else {
        int m = l+r >> 1;
        return query(lsn) + query(rsn);
    }
}

int poster_l[10000], poster_r[10000];
int sorted[20000];

int main(void)
{
//    freopen("hdu2528.txt", "r", stdin);
    int C;
    scanf("%d", &C);
    while(C) {
        int N;
        scanf("%d", &N);
        int L = 0;
        for(int i=0; i<N; ++i) {
            scanf("%d%d", &poster_l[i], &poster_r[i]);
            sorted[L] = poster_l[i], sorted[L+1] = poster_r[i];
            L += 2;
        }
        sort(sorted, sorted + L);
        build(0, L-1, 1);
        // map到 [0, L)上
        for(int i=0; i<N; ++i) {
            poster_l[i] = lower_bound(sorted, sorted + L, poster_l[i]) - sorted;
            poster_r[i] = lower_bound(sorted, sorted + L, poster_r[i]) - sorted;
            update(poster_l[i], poster_r[i], i+1, 0, L-1, 1);
        }
        memset(mark, 0, sizeof(mark));
        mark[0] = 1;
        printf("%d
", query(0, L-1, 1));
        --C;
    }
    return 0;
}

2528

Accepted

1036K

79MS

G++

1867B

2014-06-11 14:57:31