链接请戳-->HDU 4786 Fibonacci Tree
题意:现有一些黑边和白边,问能否构成一棵树,使得白边的数量 == 一个斐波那契数;
提示:
1.涉及知识:并查集;
2.判断图是否连通,不连通必然无法生成树,此时输出NO;
3.分别计算生成树所需的最多白边数量MAX和最少白边数量MIN,如果介于MIN~MAX存在斐波那契数,则满足题意,输出YES;
4.关于计算最少白边数量,可转化为计算最多黑边数量;
代码如下:
#include<stdio.h>
#include<string.h>
#include<string>
#include<iostream>
#include<algorithm>
#define MAXN 100010
using namespace std;
struct edges
{
int u,v,c;
}edge[MAXN];
int F[MAXN],f[1000010];
int n;
void set()
{
for( int i = 1; i <= n; ++i )
F[i] = i;
}
int find(int x)
{
if (F[x]!=x) F[x]=find(F[x]);
return F[x];
}
bool cmp1 ( edges aa, edges bb )
{
return aa.c < bb.c; //黑边优先
}
bool cmp2 ( edges aa, edges bb )
{
return aa.c > bb.c;//白边优先
}
int main()
{
int t = 1;
f[0] = 1;
f[1] = 2;
for( int i = 2; i <= 1000000; ++i )
f[i] = f[i-1] + f[i-2];
int T,m;
int MIN,MAX,num;
scanf("%d",&T);
for( int cas = 1; cas <= T; ++cas )
{
scanf("%d%d",&n,&m);
for( int i = 0; i < m; ++i )
{
scanf("%d%d%d",&edge[i].u,&edge[i].v,&edge[i].c);
}
set();
sort( edge,edge+m,cmp1 );
num = 0;
for( int i = 0; i < m; ++i )
{
int r1 = find(edge[i].u);
int r2 = find(edge[i].v);
if( r1 != r2 )
{
F[r1] = r2;
if( edge[i].c==1 ) num++;//统计最少白边数
}
}
MIN = num;
set();
sort(edge,edge+m,cmp2);
num = 0;
for( int i = 0; i < m; ++i )
{
int r1 = find(edge[i].u);
int r2 = find(edge[i].v);
if( r1 != r2 )
{
F[r1] = r2;
if( edge[i].c==1 ) num++;//统计最大白边数
}
}
MAX = num;
bool flag = 1;
for( int i = 1; i <= n; ++i )
if( find(i) != find(1) )
{
flag = 0;
break;
}
if( !flag )
{
printf("Case #%d: No\n",cas);
continue;
}
flag = 0;
for( int i = 0; i <= 1000000; ++i )
if( f[i]>=MIN && f[i]<=MAX)
{
flag = 1;
break;
}
if( flag ) printf("Case #%d: Yes\n",cas);
else printf("Case #%d: No\n",cas);
}
return 0;
}