NOIP2016 愤怒的小鸟（状压DP）

最新推荐文章于 2021-01-25 16:23:23 发布

Hany01

最新推荐文章于 2021-01-25 16:23:23 发布

阅读量342

点赞数 1

分类专栏： DP 状态压缩 NOIP

本文链接：https://blog.csdn.net/hhaannyyii/article/details/78220146

版权

DP 同时被 3 个专栏收录

83 篇文章 0 订阅

订阅专栏

NOIP

15 篇文章 0 订阅

订阅专栏

状态压缩

10 篇文章 0 订阅

订阅专栏

Description

给定小于等于18只猪的坐标，用最少的抛物线覆盖

Solution

从数据就可以看出用状压了。。
先预处理取任意两个所得到的状态
再DP就好了

Code

//Author: Hany01
//NOIP2017 ++ rp;
//Fighting!!!
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#define For(i , j , k) for (int i = (j) , _##end_ = (k) ; i <= _##end_ ; ++ i)
#define Fordown(i , j , k) for (int i = (j) , _##end_ = (k) ; i >= _##end_ ; -- i)
#define Set(a , b) memset(a , b , sizeof(a))
#define pb push_back
#define INF (0x3f3f3f3f)
#define Mod (1000000007)
using namespace std;
typedef long long LL;

template <typename T> inline bool chkmax(T &a , T b) { return a < b ? (a = b , 1) : 0; }
template <typename T> inline bool chkmin(T &a , T b) { return b < a ? (a = b , 1) : 0; }

int _ , __;
char c_;
inline int read()
{
    for (_ = 0 , __ = 1 , c_ = getchar() ; !isdigit(c_) ; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; isdigit(c_) ; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

inline void file()
{
#ifdef hany01
    freopen("tmp.in" , "r" , stdin);
    freopen("tmp.out" , "w" , stdout);
#endif
}

const int maxn = 20 , maxcdt = (1 << 18);

typedef long double LD;

int T , n , f[maxcdt] , lt[maxn][maxn] , FULL , cdt;
LD x[maxn] , y[maxn] , a , b , jd = 0.0000000000001;

inline void Input()
{
    n = read();
    static int meaningless;
    meaningless = read();
    For(i , 1 , n)
        scanf("%Lf%Lf" , &x[i] , &y[i]);
}

LD abss(LD A)
{
    return (A > 0 ? A : -A);
}

bool isame(LD A , LD B)
{
    return abss(A - B) <= jd;
}

inline void Init()
{
    FULL = (1 << n) - 1;
    f[0] = 0;
    For(i , 1 , FULL)
        f[i] = INF;
    For(i , 1 , n)
        For(j , i + 1 , n)
        {
            lt[i][j] = 0;
            if (isame(x[i] , x[j]))
                continue;
            a = (x[i] * y[j] - x[j] * y[i]) / ((x[j] - x[i]) * x[i] * x[j]);
            if (a > -1e-6)
                continue;
            b = y[i] / x[i] - (x[i] * y[j] - x[j] * y[i]) / (x[j] * (x[j] - x[i]));
            cdt = (1 << (i - 1)) | (1 << (j - 1));
            For(k , j + 1 , n)
                if (isame(a * x[k] * x[k] + b * x[k] , y[k]))
                    cdt |= (1 << (k - 1));
            f[cdt] = 1;
            lt[i][j] = cdt;
        }
}

inline void Solve()
{
    For(i , 0 , FULL - 1)
    {
        int k = 0;
        while (i & (1 << k))
            ++ k;
        chkmin(f[i | (1 << k)] , f[i] + 1);
        ++ k;
        For(j , k + 1 , n)
            chkmin(f[i | lt[k][j]] , f[i] + 1);
    }
    printf("%d\n" , f[FULL]);
}

int main()
{
    file();
    T = read();
    while (T --)
    {
        Input();
        Init();
        Solve();
    }
    return 0;
}