hdu 4786 Fibonacci Tree 乱搞 智商题目 最小生成树

首先计算图的联通情况，如果图本身不联通一定不会出现生成树，输出"NO"，之后清空，加白边，看最多能加多少条，清空，加黑边，看能加多少条，即可得白边的最大值与最小值，之后判断Fibonacci数是否在这两个之间，如果是输出yes，否则no。

然而，，然而，，我看的题解有问题！！！！！调了俩小时愣是没找出错误来，，然后把题解交了发现过不了，，，，真是够了。，。，。，

第二天上午终于A了，，满分程序：

 #include <cstdio>
 #include <cstring>
 #include <algorithm>

 struct data {
     int x1;
     int y1;
     int z1;
 };
 const int maxn =  + ;
 int father[maxn];
 int f[maxn];
 data p[maxn];
 int T;
 int n, m;

 bool cmp(data aa, data bb) {
     return (aa.z1 < bb.z1);
 }

 int getfather(int x) {
     if (father[x] == x) return x;
     return (father[x] = getfather(father[x]));
 }

 bool solve (void) {
     int cur = n;
     for (int i = ; i <= m; i++) {
         int tx = getfather(p[i].x1);
         int ty = getfather(p[i].y1);
         if (tx != ty) {
             father[tx] = ty;
             cur--;
         }
     }
     if (cur > ) return ;
     return ;
 } 

 int main () {
     f[] = ;
     f[] = ;
     for (int i = ; i <= ; i++) {
         f[i] = f[i-] + f[i-];
     }
     scanf("%d", &T);
     for (int kase = ; kase <= T; kase++) {
         printf("Case #%d: ", kase);
         scanf("%d %d", &n, &m);
         for (int i = ; i <= n; i++) father[i] = i;
         for (int i = ; i <= m; i++) scanf("%d %d %d", &p[i].x1, &p[i].y1, &p[i].z1);
         std :: sort(p + , p + m + , cmp);
         if (solve()) printf("No\n");
         else {
             for (int i = ; i <= n; i++) father[i] = i;
             int smin = ;
             for (int i = ; i <= m; i++) {
                 int tx = getfather(p[i].x1);
                 int ty = getfather(p[i].y1);
                 if (tx != ty) {
                     father[tx] = ty;
                     if (p[i].z1 == ) smin++;
                 }
             }
             int smax = ;
             for (int i = ; i <= n; i++) father[i] = i;
             for (int i = m; i >= ; i--) {
                 int tx = getfather(p[i].x1);
                 int ty = getfather(p[i].y1);
                 if (tx != ty) {
                     father[tx] = ty;
                     if (p[i].z1 == ) smax++;
                 }
             }
             bool flag = ;
             for (int i = ; i <= ; i++)
                 if (smin <= f[i] && smax >= f[i]) {
                     flag = ;
                     break;
                 }
             if (flag) printf("Yes\n");
             else printf("No\n");
         }
     }
     return ;
 }