传送门
题解:
好像打不打乱期望复杂度都一样。
考虑暴力增量,每次新加一个点,删掉所有站在这个点能“看到”的面,然后把空的地方连到这里就行了。
记录一下每条边两个方向的面有没有被看到可以方便地实现。
代码:
#include<bits/stdc++.h>
#define ll long long
#define re register
#define db double
#define cs const
cs db eps=1e-9;
db Rand(){return rand()*1./RAND_MAX;}
db reps(){return (Rand()-0.5)*eps;}
struct Pnt{
db x,y,z;Pnt(){}Pnt(db _x,db _y,db _z):x(_x),y(_y),z(_z){}
friend Pnt operator+(cs Pnt &a,cs Pnt &b){return Pnt(a.x+b.x,a.y+b.y,a.z+b.z);}
friend Pnt operator-(cs Pnt &a,cs Pnt &b){return Pnt(a.x-b.x,a.y-b.y,a.z-b.z);}
friend Pnt operator*(cs Pnt &a,cs Pnt &b){return Pnt(a.y*b.z-b.y*a.z,a.z*b.x-b.z*a.x,a.x*b.y-b.x*a.y);}
friend db dot(cs Pnt &a,cs Pnt &b){return a.x*b.x+a.y*b.y+a.z*b.z;}
void shake(){x+=reps(),y+=reps(),z+=reps();}
db norm()cs{return sqrt(x*x+y*y+z*z);}
};
cs int N=2e3+7;
int n,ct;
bool vis[N][N];
Pnt p[N];
struct Face{
int v[3];Face(){}Face(int a,int b,int c){v[0]=a,v[1]=b,v[2]=c;}
Pnt norm()cs{return (p[v[1]]-p[v[0]])*(p[v[2]]-p[v[0]]);}
double area()cs{return norm().norm()*0.5;}
}f[N],C[N];
int see(cs Face &a,cs Pnt &b){return dot((b-p[a.v[0]]),a.norm())>0;}
void convex_3D(){
f[++ct]=Face(1,2,3);
f[++ct]=Face(3,2,1);
for(int re i=4,cur=0;i<=n;++i){
for(int re j=1,v;j<=ct;++j){
if(!(v=see(f[j],p[i])))C[++cur]=f[j];
for(int re k=0;k<3;++k)vis[f[j].v[k]][f[j].v[(k+1)%3]]=v;
}
for(int re j=1;j<=ct;++j)
for(int re k=0;k<3;++k){
int x=f[j].v[k],y=f[j].v[(k+1)%3];
if(vis[x][y]&&!vis[y][x])C[++cur]=Face(x,y,i);
}
for(int re j=1;j<=cur;++j)f[j]=C[j];
ct=cur;cur=0;
}
}
void Main(){
scanf("%d",&n);
for(int re i=1;i<=n;++i)
scanf("%lf%lf%lf",&p[i].x,&p[i].y,&p[i].z),p[i].shake();
convex_3D();db ans=0;
for(int re i=1;i<=ct;++i)ans+=f[i].area();
printf("%.3f\n",ans);
}
void file(){
#ifdef zxyoi
freopen("convex3D.in","r",stdin);
#endif
}
signed main(){file();Main();return 0;}