【HDOJ】4056 Draw a Mess

这题用线段树就MLE。思路是逆向思维，然后每染色一段就利用并查集将该段移除，均摊复杂度为O(n*m)。

/* 4056 */
#include <iostream>
#include <sstream>
#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 id;
    int xc, yc, w, h, c;
} draw_t;

const int maxm = 50005;
const int maxn = 205;
int fa[maxn][maxm];
draw_t draw[maxm];
int C[10];
int n, m, q;
int xc, yc, w, h, c;

int find(int rn, int x) {
    if (fa[rn][x] == x)
        return x;
    return fa[rn][x] = find(rn, fa[rn][x]);
}

void init() {
    memset(C, 0, sizeof(C));
    rep(i, 0, n)
        rep(j, 0, m+1)
            fa[i][j] = j;
    --n;
    --m;
}

int move(int xth, int l, int r) {
    int ret = 0;
    
    l = find(xth, l);
    while (l <= r) {
        ++ret;
        fa[xth][l] = l + 1;
        l = find(xth, l+1);
    }
    
    return ret;
}

void DrawDiamond() {
    int ly = yc - w;
    int ry = yc + w;
    int l, r, xth;

    xth = xc;
    while (xth>=0 && ly<=ry) {
        l = max(0, ly);
        r = min(m, ry);
        C[c] += move(xth, l, r);
        --xth;
        ++ly;
        --ry;
    }

    xth = xc + 1;
    ly = yc - w + 1;
    ry = yc + w - 1;
    while (xth<=n && ly<=ry) {
        l = max(0, ly);
        r = min(m, ry);
        C[c] += move(xth, l, r);
        ++xth;
        ++ly;
        --ry;
    }
}

void DrawRectangle() {
    int xth = xc;
    int n_ = min(n, xc+h-1);
    int l = yc;
    int r = min(m, yc+w-1);

    while (xth <= n_) {
        C[c] += move(xth, l, r);
        ++xth;
    }
}

void DrawTriangle() {
    int w_ = w >> 1;
    int n_ = min(n, xc+w_);
    int ly = yc - w_;
    int ry = yc + w_;
    int l, r;
    int xth = xc;

    while (xth<=n_ && ly<=ry) {
        l = max(0, ly);
        r = min(m, ry);
        C[c] += move(xth, l, r);
        ++ly;
        --ry;
        ++xth;
    }
}

void DrawCircle() {
    int ly = yc - w;
    int ry = yc + w;
    int l, r;
    __int64 w2 = 1LL * w * w, tmp;
    int delta;
    int xth = xc;

    l = max(0, ly);
    r = min(m, ry);
    C[c] += move(xth, l, r);

    rep(i, 1, w+1) {
        tmp = 1LL * i * i;
        delta = sqrt(w2 - tmp + 0.5);
        ly = yc - delta;
        ry = yc + delta;
        l = max(0, ly);
        r = min(m, ry);
        if (xth-i >= 0) {
            C[c] += move(xth-i, l, r);
        }
        if (xth+i <= n) {
            C[c] += move(xth+i, l, r);
        }
    }
}

void solve() {
    int id;
    
    per(i, 0, q) {
        id = draw[i].id;
        xc = draw[i].xc;
        yc = draw[i].yc;
        w = draw[i].w;
        c = draw[i].c;
        h = draw[i].h;
        if (id == 0) {
            DrawCircle();
        } else if (id == 1) {
            DrawDiamond();
        } else if (id == 2) {
            DrawRectangle();
        } else {
            DrawTriangle();
        }
    }
        
    rep(j, 1, 10) {
        if (j == 9) {
            printf("%d
", C[j]);
        } else {
            printf("%d ", C[j]);
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    #ifndef ONLINE_JUDGE
        freopen("data.in", "r", stdin);
        freopen("data.out", "w", stdout);
    #endif

    char op[20];

    while (scanf("%d %d %d", &n, &m, &q)!=EOF) {
        init();
        rep(i, 0, q) {
            scanf("%s", op);
            if (op[0] == 'C') {
                scanf("%d %d %d %d", &xc, &yc, &w, &c);
                draw[i].id = 0;
                // DrawCircle();
            } else if (op[0] == 'D') {
                scanf("%d %d %d %d", &xc, &yc, &w, &c);
                draw[i].id = 1;
                // DrawDiamond();
            } else if (op[0] == 'R') {
                scanf("%d %d %d %d %d", &xc, &yc, &h, &w, &c);
                draw[i].id = 2;
                // DrawRectangle();
            } else {
                scanf("%d %d %d %d", &xc, &yc, &w, &c);
                draw[i].id = 3;
                // DrawTriangle();
            }
            draw[i].xc = xc;
            draw[i].yc = yc;
            draw[i].h = h;
            draw[i].w = w;
            draw[i].c = c;
        }
        solve();
    }

    #ifndef ONLINE_JUDGE
        printf("time = %d.
", (int)clock());
    #endif

    return 0;
}