hdu 4786 Fibonacci Tree

Fibonacci Tree

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2350    Accepted Submission(s): 752

Problem Description

　　Coach Pang is interested in Fibonacci numbers while Uncle Yang wants him to do some research on Spanning Tree. So Coach Pang decides to solve the following problem:
　　Consider a bidirectional graph G with N vertices and M edges. All edges are painted into either white or black. Can we find a Spanning Tree with some positive Fibonacci number of white edges?
(Fibonacci number is defined as 1, 2, 3, 5, 8, ... )

 

Input

　　The first line of the input contains an integer T, the number of test cases.
　　For each test case, the first line contains two integers N(1 <= N <= 10 ⁵) and M(0 <= M <= 10 ⁵).
　　Then M lines follow, each contains three integers u, v (1 <= u,v <= N, u<> v) and c (0 <= c <= 1), indicating an edge between u and v with a color c (1 for white and 0 for black).

 

Output

　　For each test case, output a line “Case #x: s”. x is the case number and s is either “Yes” or “No” (without quotes) representing the answer to the problem.

 

Sample Input

  
  

   
   2
4 4
1 2 1
2 3 1
3 4 1
1 4 0
5 6
1 2 1
1 3 1
1 4 1
1 5 1
3 5 1
4 2 1
  
  

 

Sample Output

  
  

   
   Case #1: Yes
Case #2: No
  
  

 

Source

2013 Asia Chengdu Regional Contest

 

题意：让我们求是否生成权值和为Fibonacci的树。

做法：用下最小生成树（Kruskal 算法）分别生成最小和最大的生成树，然后在这之间搜索一下，看是否存在Fibonacci数，如果存在则输出Yes，否则输出No。

#include <iostream>
#include <cstdio>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include<stack>
#include <set>
#include <algorithm>
#include<ctime>
#define esp 1e-6
#define LL long long
#define inf 0x0f0f0f0f
using namespace std;
const int MAXN=100005;//最大点数
const int MAXM=100005;//最大边数
int F[MAXN];//并查集使用
set<int>pp;
int fib[100005];
struct Edge
{
int u,v,w;
}edge[MAXM];//存储边的信息，包括起点/终点/权值
int tol;//边数，加边前赋值为0
void addedge(int u,int v,int w)
{
edge[tol].u=u;
edge[tol].v=v;
edge[tol++].w=w;
}
bool cmp(Edge a,Edge b)
{//排序函数，讲边按照权值从小到大排序
return a.w<b.w;
}
bool cmp2(Edge a,Edge b)
{//排序函数，讲边按照权值从大到小排序
return a.w>b.w;
}
int find(int x)
{
if(F[x]==-1)return x;
else return F[x]=find(F[x]);
}
int Kruskal(int n)//传入点数，返回最小生成树的权值，如果不连通返回-1
{
memset(F,-1,sizeof(F));
int cnt=0;//计算加入的边数
int ans=0;
for(int i=0;i<tol;i++)
{
int u=edge[i].u;
int v=edge[i].v;
int w=edge[i].w;
int t1=find(u);
int t2=find(v);
if(t1!=t2)
{
ans+=w;
F[t1]=t2;
cnt++;
}
if(cnt==n-1)break;
}
if(cnt<n-1)return -1;//不连通
else return ans;
}
int main()
{
    int n,m;
    int i,j,t,cas;
    int max1,min1;
    fib[1]=1;
    fib[2]=2;
    pp.insert(1);
    pp.insert(2);
    for(i=3;fib[i]<=100000;i++)
    {
        fib[i]=fib[i-2]+fib[i-1];
        pp.insert(fib[i]);
    }
    scanf("%d",&t);
    for(cas=1;cas<=t;cas++)
    {
        scanf("%d%d",&n,&m);
        tol=m;
        for(i=0;i<m;i++)
            scanf("%d%d%d",&edge[i].u,&edge[i].v,&edge[i].w);
        sort(edge,edge+tol,cmp);
        min1=Kruskal(n);
        sort(edge,edge+tol,cmp2);
        max1=Kruskal(n);
        int flag=0;
        for(i=min1;i<=max1;i++)
        {
            if(pp.count(i)==1)
            {
                flag=1;
                break;
            }
        }
        if(flag==1)
            printf("Case #%d: Yes\n",cas);
        else
            printf("Case #%d: No\n",cas);
    }
}