分析:
best set 意为全部共线的一个点集,所以题目转换为给出一堆点,求出里面全部共线的点集的数量。题解:
1.判断是否共线,采用记录向量的方式:
struct node
{
int dx, dy, num;//num为数量
node(){}
node(int a,int b,int c): dx(a), dy(b), num(c){}
};
vector<node>s;//构建vector存储斜率向量
for(it1 = nodes.begin(); it1 != nodes.end(); it1++)
{
u = it1->first;//挑出点的坐标来
s.clear();
for(it2 = it1, it2++; it2 != nodes.end(); it2++)
{
v = it2->first;
int dx = v.first - u.first;
int dy = v.second - u.second;
if(dx<0)
dx = -dx, dy = -dy;//关于远点对称过来,保证dx为正(后面会按dx排序)
if(!dx)
dy = 1;
else if(!dy)
dx = 1;
else
{
int g = gcd(dx, dy);
dx/=g;
dy/=g;
}
s.push_back(node(dx, dy, it2->second));//存储斜率
}
sort(s.begin(),s.end(),cmp);
}
2.统计一共有多少个点集合:
假设与起点u重点个数为cnt个,除点u以外与u共线的点有knt个,那么,该直线上满足条件的点集个数为:
int Size = s.size();
int cnt = it1 -> second;
int i,j;
for(i=0;i<Size;i=j)
{
int knt=s[i].num;//计算同一起点相同斜率的点的个数
for(j=i+1;j<Size;j++)
{
if(s[i].dx!=s[j].dx||s[i].dy!=s[j].dy)
break;
knt+=s[j].num;
}
ans = ( ans + ( (w[cnt]-1 + mod ) % mod * (w[knt]-1 + mod ) % mod ) % mod ) % mod;
}//计算(2^cnt - 1)×(2^knt - 1)
ans=( ans + w[cnt] - cnt-1 + mod )%mod;//计算(2^cnt - 1 - cnt)
参考代码:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 1005;
const int M = 100005;
const int inf = 1000000007;
const int mod = 1000000007;
__int64 w[N];
int gcd(int a, int b)
{
return b==0 ? a : gcd(b, a%b);
}
struct node
{
int dx, dy, num;
node(){}
node(int a,int b,int c): dx(a), dy(b), num(c){}
};
bool cmp(node a,node b)
{
if(a.dx!=b.dx)
return a.dx<b.dx;
return a.dy<b.dy;
}
map<pair<int, int >, int>nodes; //记录相同点的个数
map<pair<int,int>, int>::iterator it1,it2;
vector<node>s; // 记录相同斜率的个数
pair<int,int> u,v;
int main()
{
w[0]=1;
for(int i=1;i<N;i++)
w[i]=(w[i-1]+w[i-1])%mod;
__int64 ans;
int T;
cin >>T;
while(T--)
{
ans = 0;
nodes.clear();
int n;
cin >> n;
for(int i=0;i<n;i++)
{
int x, y;
scanf("%d%d",&x,&y);
nodes[make_pair(x,y)]++;
}
for(it1 = nodes.begin(); it1 != nodes.end(); it1++)
{
u = it1->first;
s.clear();
for(it2 = it1, it2++; it2 != nodes.end(); it2++)
{
v = it2->first;
int dx = v.first - u.first;
int dy = v.second - u.second;
if(dx<0)
dx = -dx, dy = -dy;
if(!dx)
dy = 1;
else if(!dy)
dx = 1;
else
{
int g = gcd(dx, dy);
dx/=g;
dy/=g;
}
s.push_back(node(dx, dy, it2->second));
}
sort(s.begin(),s.end(),cmp);
int Size = s.size();
int cnt = it1 -> second;
int i,j;
for(i=0;i<Size;i=j)
{
int knt=s[i].num;
for(j=i+1;j<Size;j++)
{
if(s[i].dx!=s[j].dx||s[i].dy!=s[j].dy)
break;
knt+=s[j].num;
}
ans = ( ans + ( (w[cnt]-1 + mod ) % mod * (w[knt]-1 + mod ) % mod ) % mod ) % mod;
}
ans=( ans + w[cnt] - cnt-1 + mod )%mod;
}
printf("%I64d\n",ans);
}
}