UVa12171 hdu2771 UVaLive4291 Sculpture

填坑系列(p.171)

orz rjl

代码基本和rjl的一样

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<iostream>

template<typename Q> Q read(Q& x) {
    static char c, f;
    for(f = 0; c = getchar(), !isdigit(c); ) if(c == '-') f = 1;
    for(x = 0; isdigit(c); c = getchar()) x = x * 10 + c - '0';
    if(f) x = -x;
    return x;
}
template<typename Q> Q read() {
    static Q x; read(x); return x;
}

const int maxn = 50 + 5, maxc = 1000 + 1;
const int dx[] = {1, -1, 0, 0, 0, 0};
const int dy[] = {0, 0, -1, 1, 0, 0};
const int dz[] = {0, 0, 0, 0, -1, 1};

int n, x0[maxn], y0[maxn], z0[maxn], x1[maxn], y1[maxn], z1[maxn];

int nx, ny, nz;
int xs[maxn*2], ys[maxn*2], zs[maxn*2];
int color[maxn*2][maxn*2][maxn*2];

struct Cell {
    int x, y, z;
    Cell() {}
    Cell(int x, int y, int z) : x(x), y(y), z(z) {}
    bool valid() const {
        return x >= 0 && x < nx - 1 && y >= 0 && y < ny - 1 && z >= 0 && z < nz - 1;
    }
    bool solid() const {
        return color[x][y][z] == 1;
    }
    bool getvis() const {
        return color[x][y][z] == 2;
    }
    void setvis() const {
        color[x][y][z] = 2;
    }
    int volume() const {
        return (xs[x+1] - xs[x]) * (ys[y+1] - ys[y]) * (zs[z+1] - zs[z]);
    }
    Cell neighbor(int dir) const {
        return Cell(x + dx[dir], y + dy[dir], z + dz[dir]);
    }
    int area(int dir) const {
        if(dx[dir]) return (ys[y+1] - ys[y]) * (zs[z+1] - zs[z]);
        if(dy[dir]) return (xs[x+1] - xs[x]) * (zs[z+1] - zs[z]);
        return (xs[x+1] - xs[x]) * (ys[y+1] - ys[y]);
    }
};

void discretize(int *s, int& n) {
    std::sort(s, s + n);
    n = std::unique(s, s + n) - s;
}

int ID(int *s, int n, int x) {
    return std::lower_bound(s, s + n, x) - s;
}

#include<queue>
void floodfill(int &v, int &s) {
    v = 0, s = 0;
    Cell c(0, 0, 0);
    c.setvis();
    std::queue<Cell> q;
    q.push(c);
    while(!q.empty()) {
        Cell c = q.front(); q.pop();
        v += c.volume();
        for(int i = 0; i < 6; i++) {
            Cell c2 = c.neighbor(i);
            if(!c2.valid()) continue;
            if(c2.solid()) s += c.area(i);
            else if(!c2.getvis()) {
                c2.setvis();
                q.push(c2);
            }
        }
    }
    v = maxc * maxc * maxc - v;
}

int main() {
#ifdef DEBUG
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    
    int T; scanf("%d", &T);
    while(T--) {
        nx = ny = nz = 2;
        xs[0] = ys[0] = zs[0] = 0;
        xs[1] = ys[1] = zs[1] = maxc;
        scanf("%d", &n);
        for(int i = 0; i < n; i++) {
            scanf("%d%d%d%d%d%d", &x0[i], &y0[i], &z0[i], &x1[i], &y1[i], &z1[i]);
            x1[i] += x0[i]; y1[i] += y0[i]; z1[i] += z0[i];
            xs[nx++] = x0[i]; xs[nx++] = x1[i];
            ys[ny++] = y0[i]; ys[ny++] = y1[i];
            zs[nz++] = z0[i]; zs[nz++] = z1[i];
        }
        discretize(xs, nx);
        discretize(ys, ny);
        discretize(zs, nz);
        
        memset(color, 0, sizeof color);
        for(int i = 0; i < n; i++) {
            int X1 = ID(xs, nx, x0[i]), X2 = ID(xs, nx, x1[i]);
            int Y1 = ID(ys, ny, y0[i]), Y2 = ID(ys, ny, y1[i]);
            int Z1 = ID(zs, nz, z0[i]), Z2 = ID(zs, nz, z1[i]);
            for(int X = X1; X < X2; X++) for(int Y = Y1; Y < Y2; Y++) 
                for(int Z = Z1; Z < Z2; Z++) color[X][Y][Z] = 1;
        }
        int v, s;
        floodfill(v, s);
        printf("%d %d
", s, v);
    }
    return 0;
}