joj 2672 Hanoi Tower Once More 有向无环图的最小路径覆盖=N-最大匹配

最新推荐文章于 2020-05-27 06:25:19 发布

kongming_acm

最新推荐文章于 2020-05-27 06:25:19 发布

阅读量639

点赞数

分类专栏： acm_网络流文章标签： each input output numbers file 2010

本文链接：https://blog.csdn.net/kongming_acm/article/details/6892416

版权

acm_网络流专栏收录该内容

67 篇文章 0 订阅

订阅专栏

2010 Yuanguang Cup ACM-ICPC Collegiate Programming Contest

Problem I: Hanoi Tower Once More

Input File: i.in Output: stdout

Description

You know the game of Hanoi Tower, right? People stopped moving discs from
peg to peg after they know the number of steps needed to complete the entire task.
But on the other hand, they didn't not stopped thinking about similar puzzles with the
Hanoi Tower. Mr. S invented a little game on it. The game consists of N pegs and a
LOT of balls. Each ball has a different number. The balls look ordinary, but they are
actually magic. If the sum of the numbers on two balls is NOT a square number, they
will push each other with a great force when they're too closed, so they can NEVER
be put together touching each other.

The player should place one ball on the top of a peg at a time. And we must start
from the smallest number all the way to the largest .So no ball with a smaller number
should be above a ball with a larger number.

Here comes our question: Given the number on each ball, how many pegs, at
least, are needed to make all the balls placed?

Input

The input consists of T test cases. The number of test cases T is given in the first
line of the input. Each test case starts with a line containing one integers n (n≤300),
which is the amount of balls. In the next line, n different positive integers, the number
on each ball, is given.

Output

Print the minimum pegs needed to make all the balls placed.

Sample Input

2
4
1 2 3 4
4
1 3 6 10

output

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;

const int N=400;//N不能太大否则超时
int cap[N][N];//初始化要清零
int _link[N];
bool used[N];
int nx,ny;//1->nx
bool _find(int t)
{
for(int i=1;i<=ny;i++)

    if(!used[i]&&cap[t][i]==1)
    {
        used[i]=true;
        if(_link[i]==-1||_find(_link[i]))
        {
            _link[i]=t;
            return true;
        }
    }
    return false;
}
int MaxMatch()
{
    int num=0;
    memset(_link,-1,sizeof(_link));
    for(int i=1;i<=nx;i++)
    {
        memset(used,false,sizeof(used));
        if(_find(i))   num++;
    }
    return num;
}
int a[N];
int main()
{
    int ci;scanf("%d",&ci);
    while(ci--)
    {
        int n;scanf("%d",&n);
        for(int i=1;i<=n;i++) scanf("%d",&a[i]);
        nx=ny=n;
        memset(cap,0,sizeof(cap));
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(a[i]>=a[j]) continue;
                int t=a[i]+a[j];
                int k=sqrt(t+0.5);
                if(k*k==t) cap[i][j]=1;
            }
        }
        int ans=n-MaxMatch();
        printf("%d\n",ans);
    }
    return 0;
}