【NOIP】提高组2016 愤怒的小鸟

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cctype>
#include<cmath>
using namespace std;
int read(){
    char c;int s=0,t=1;
    while(!isdigit(c=getchar()))if(c==‘-‘)t=-1;
    do{s=s*10+c-‘0‘;}while(isdigit(c=getchar()));
    return s*t;
}
const int maxN=300000,maxn=500;
const double eps=1e-8;
int c[maxn],f[maxN],n,tot,qaq;
double x[30],y[30],a[maxn],b[maxn];

int main(){
    int T=read();
    while(T--){
        n=read();qaq=read();tot=0;
        for(int i=0;i<n;i++)scanf("%lf%lf",&x[i],&y[i]);
        for(int i=0;i<n;i++){
            c[++tot]=1<<i;
            for(int j=i+1;j<n;j++){
                b[++tot]=(y[j]-y[i]*x[j]*x[j]/(x[i]*x[i]))/(x[j]-x[j]*x[j]/x[i]);
                a[tot]=(y[i]-b[tot]*x[i])/(x[i]*x[i]);
                if(a[tot]+eps>0){tot--;continue;}
                c[tot]=(1<<i)|(1<<j);
                for(int k=j+1;k<n;k++)if(fabs(a[tot]*x[k]*x[k]+b[tot]*x[k]-y[k])<eps){
                    c[tot]|=(1<<k);
                }
            }
        }
        memset(f,0x3f,sizeof(f));
        f[0]=0;
        for(int i=1;i<=tot;i++){
            for(int j=0;j<(1<<n);j++){
                f[j|c[i]]=min(f[j|c[i]],f[j]+1);//wei yun suan
            }
        }
        printf("%d\n",f[(1<<n)-1]);
    }
    return 0;
}