hdu4160 Dolls
(最小路径覆盖)
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 510
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int tst,n,h[N],num=1,bf[N];
bool f[N];
struct edge{
int to,next;
}data[127000];
struct point{
int x,y,z;
}p[N];
inline void add(int x,int y){
data[++num].to=y;data[num].next=h[x];h[x]=num;
}
inline bool find(int x){
for(int i=h[x];i;i=data[i].next){
int y=data[i].to;if(f[y]) continue;
f[y]=1;if(!bf[y]||find(bf[y])){bf[y]=x;return 1;}
}return 0;
}
int main(){
// freopen("a.in","r",stdin);
while(1){
n=read();if(!n) break;memset(h,0,sizeof(h));num=1;int ans=0;
memset(bf,0,sizeof(bf));
for(int i=1;i<=n;++i) p[i].x=read(),p[i].y=read(),p[i].z=read();
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
if(p[i].x<p[j].x&&p[i].y<p[j].y&&p[i].z<p[j].z) add(i,j);
for(int i=1;i<=n;++i){
memset(f,0,sizeof(f));if(find(i)) ans++;
}printf("%d\n",n-ans);
}return 0;
}