hdu4160 Dolls

http://www.elijahqi.win/2017/12/31/hdu4160-dolls/ ‎

Problem Description
Do you remember the box of Matryoshka dolls last week? Adam just got another box of dolls from Matryona. This time, the dolls have different shapes and sizes: some are skinny, some are fat, and some look as though they were attened. Specifically, doll i can be represented by three numbers wi, li, and hi, denoting its width, length, and height. Doll i can fit inside another doll j if and only if wi < wj , li < lj , and hi < hj .
That is, the dolls cannot be rotated when fitting one inside another. Of course, each doll may contain at most one doll right inside it. Your goal is to fit dolls inside each other so that you minimize the number of outermost dolls.

Input
The input consists of multiple test cases. Each test case begins with a line with a single integer N, 1 ≤ N ≤ 500, denoting the number of Matryoshka dolls. Then follow N lines, each with three space-separated integers wi, li, and hi (1 ≤ wi; li; hi ≤ 10,000) denoting the size of the ith doll. Input is followed by a single line with N = 0, which should not be processed.

Output
For each test case, print out a single line with an integer denoting the minimum number of outermost dolls that can be obtained by optimally nesting the given dolls.

Sample Input
3
5 4 8
27 10 10
100 32 523
3
1 2 1
2 1 1
1 1 2
4
1 1 1
2 3 2
3 2 2
4 4 4
0

Sample Output
1
3
2

Source
The 2011 Syrian Collegiate Programming Contest
最小路径覆盖问题
从源向每个节点的出点建边权为1的边（因为只能做一回出点和入点）然后每个节点的的入点向汇建容量为1边如果一个娃娃能覆盖另一个则从出点向入点建容量为1的边然后跑dinic 即求出了最大匹配初始的时候我认为我所有娃娃都得摆在外面如果可以嵌套就就证明这两个我可以变成一个
一个匹配我可以把两个点之间用一条边覆盖就给连起来了所以最后用总节点数-最大匹配即可

#include<queue>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 1100
#define inf 0x3f3f3f3f
using namespace std;
inline char gc(){static char now[1<<16],*S,*T;if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}return *S++;
}
inline int read(){int x=0;char ch=gc();while(ch<'0'||ch>'9') ch=gc();while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=gc();}return x;
}
struct node{int x,y,z,next;
}data[N*N*3];
int num=1,h[N],w[N],l[N],level[N],hh[N],T,n;
inline void insert1(int x,int y,int z){data[++num].y=y;data[num].z=z;data[num].next=h[x];h[x]=num;data[num].x=x;data[++num].y=x;data[num].z=0;data[num].next=h[y];h[y]=num;data[num].x=y;
}
inline bool bfs(){queue<int>q;memset(level,0,sizeof(level));level[0]=1;q.push(0);while(!q.empty()){int x=q.front();q.pop();for (int i=h[x];i;i=data[i].next){int y=data[i].y,z=data[i].z;if (level[y]||!z) continue;level[y]=level[x]+1;q.push(y);if (y==T) return 1;}}return 0;
}
inline int dfs(int x,int s){if (x==T) return s;int ss=s;for (int i=h[x];i;i=data[i].next){int y=data[i].y,z=data[i].z;if (level[x]+1==level[y]&&z){int xx=dfs(y,min(z,s));if (!xx) level[y]=0;s-=xx;data[i].z-=xx;data[i^1].z+=xx;if (!s) return ss;}}return ss-s;
}
int main(){freopen("hdu4160.in","r",stdin);while(1){n=read();if (!n) return 0;num=1;memset(h,0,sizeof(h));T=2*n+1;for (int i=1;i<=n;++i) l[i]=read(),w[i]=read(),hh[i]=read();for (int i=1;i<=n;++i) insert1(0,i,1),insert1(i+n,T,1);for (int i=1;i<=n;++i){for (int j=1;j<=n;++j){if (i==j) continue;if (l[i]<=l[j]||w[i]<=w[j]||hh[i]<=hh[j]) continue;insert1(i,j+n,1);}}int ans=0;//  for (int i=2;i<=num;++i) printf("%d %d %d\n",data[i].x,data[i].y,data[i].z);while(bfs()) ans+=dfs(0,inf);//for (int i=2;i<=num;++i) printf("%d %d %d\n",data[i].x,data[i].y,data[i].z);printf("%d\n",n-ans);}return 0;
}

hdu4160 Dolls相关推荐

hdu 4160 Dolls 匈牙利算法求最大匹配
Dolls Time Limit: 2000 ...
hdu 1677 Nested Dolls 子串
题目: A - Nested Dolls Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64 ...
Russian Dolls on the Christmas Tree
题目链接:Russian Dolls on the Christmas Tree 显然可以dfs序转区间之后上莫队,不过感觉会被卡. 其实也可以dfs序之后,对询问区间排序,然后线段树. 我懒得dfs ...
HDU4160（最小路径覆盖问题）
题意:当满足条件wi<wj,hi<hl和li<lj时,求解通过优化嵌套给定的娃娃可以获得的最外层洋娃娃的最小数量. 思路:如果嵌套的娃娃越多,则剩下的娃娃就越少,意味着单独出来的娃娃 ...
中石油训练赛 - Russian Dolls on the Christmas Tree(树上启发式合并/主席树)
题目链接:点击查看题目大意:给出一棵 n 个节点的树,以点 1 为根,现在对于每个节点作为根的子树求解:子树中有多少个编号不相交的连续子段,如:1 2 4 5 7,共有三个连续的段,分别为 [ 1 ...
hdu 4160 Dolls （最大独立）
点击打开链接需要排下序.. #include"stdio.h" #include"string.h" #include"stdlib.h" ...
2019 CCPC Final K - Russian Dolls on the Christmas Tree
~模板题qwq 题意:在一棵树中,假如某些节点的序号值是相连的,则可以把他们连接在一起,然后问你每一棵子树中的所有节点(包括当前节点)经过连接之后最后能剩余几段. 思路:很明显是一个树上启发式合并的模 ...
HDU 1277 Nested Dolls
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1677 题意: 玩俄罗斯套娃,问最后至少还剩几个. 题解: 这题可以和拦截导弹做对比,因为这里是二维的 ...
Russian Dolls on the Christmas Tree（主席树）
传送门题意:给你一颗树,每个节点都有一个标号,问你将一个节点所有子节点及其本身的标号连接能形成几段. 题解:大多是用线段树合并写的,所以补一发主席树的做法.将树用dfs序hash下来后,对于每一个节 ...

hdu4160 Dolls

hdu4160 Dolls相关推荐

最新文章

热门文章