noip2016 提高组

T1 玩具谜题 题目传送门

这道题直接模拟就好了哇 233

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int M=25;
int read(){
int ans=0,f=1,c=getchar();
while(c<'0'||c>'9'){if(c=='-') f=-1; c=getchar();}
while(c>='0'&&c<='9'){ans=ans*10+(c-'0'); c=getchar();}
return ans*f;
}
int T,n,m;
int g[M][M],f[1<<M],id[M];
double x[M],y[M],a,b;
bool pd(double x,double y){return fabs(x-y)<1e-6;}
void push_ans(){
n=read(); m=read();
for(int i=1;i<=n;i++) scanf("%lf %lf",&x[i],&y[i]);
memset(g,0,sizeof(g));
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
if(pd(x[i],x[j])) continue;
a=(y[i]/x[i]-y[j]/x[j])/(x[i]-x[j]);
if(a>=0) continue;
b=y[i]/x[i]-a*x[i];
int sum=0;
for(int k=1;k<=n;k++) if(pd(a*x[k]+b,y[k]/x[k])) sum+=id[k];
g[i][j]=sum;
}
}
memset(f,0x3f,sizeof(f));
f[0]=0;
for(int k=0;k<(1<<n);k++)
for(int i=1;i<=n;i++){
if(id[i]&k) continue;
for(int j=i+1;j<=n;j++) f[k|g[i][j]]=min(f[k|g[i][j]],f[k]+1);
f[id[i]|k]=min(f[id[i]|k],f[k]+1);
}
printf("%d\n",f[(1<<n)-1]);
}
int main()
{
for(int i=1;i<M;i++) id[i]=1<<(i-1);
for(T=read();T;T--) push_ans();
return 0;
}