BZOJ1105 : [POI2007]石头花园SKA

#include<cstdio>
const int N=1000000,inf=~0U>>1;
int n,i,x[N],y[N],w[N],lx=inf,rx,ly=inf,ry,ans=inf,now;bool v[N],fin[N];
inline void read(int&a){char c;while(!(((c=getchar())>=‘0‘)&&(c<=‘9‘)));a=c-‘0‘;while(((c=getchar())>=‘0‘)&&(c<=‘9‘))(a*=10)+=c-‘0‘;}
inline void max(int&a,int b){if(a<b)a=b;}
inline void min(int&a,int b){if(a>b)a=b;}
void cal(int lx,int rx,int ly,int ry){
  for(i=now=0;i<n;i++){
    if(lx<=x[i]&&x[i]<=rx&&ly<=y[i]&&y[i]<=ry){v[i]=0;continue;}
    if(lx<=y[i]&&y[i]<=rx&&ly<=x[i]&&x[i]<=ry)v[i]=1,now+=w[i];else return;
  }
  if(now<ans)for(ans=now,i=0;i<n;i++)fin[i]=v[i];
}
int main(){
  for(read(n);i<n;i++){
    read(x[i]),read(y[i]),read(w[i]);
    if(x[i]<=y[i])min(lx,x[i]),max(rx,x[i]),min(ly,y[i]),max(ry,y[i]);
    else min(lx,y[i]),max(rx,y[i]),min(ly,x[i]),max(ry,x[i]);
  }
  printf("%lld ",2LL*(rx+ry-lx-ly));
  cal(lx,rx,ly,ry),cal(ly,rx,lx,ry),cal(lx,ry,ly,rx),cal(ly,ry,lx,rx);
  for(printf("%d\n",ans),i=0;i<n;i++)putchar(fin[i]?‘1‘:‘0‘);
  return 0;
}