原题链接
Problem Description
Input
Output
For each test case, output an integer denoting the answer.
Sample Input
3
3
1 1
1 1
1 1
3
0 0
0 1
1 0
1
0 0
Sample Output
4
3
0
题目大意
给定平面上的n个点(可重合),要求这些点一共可以组成多少种线段。线段被定义为:至少有两个共线的点组成一条线段。
解题思路
首先对点进行去重,保存重合的点的数量。对剩余的点进行排序,枚举每个点,以这个点为中心,枚举出所有可能的斜率,对于斜率上的点用map存储,最后利用组合公式求出答案的贡献度。
AC代码
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<list>
#include<stack>
#include<set>
#include<map>
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(int i = 0;i < n; i++)
#define fil(a,b) memset((a),(b),sizeof(a))
#define cl(a) fil(a,0)
#define pb push_back
#define mp make_pair
#define PI 3.1415927
#define inf 0x3f3f3f3f
#define fi first
#define se second
#define eps 1e-8
#define mod 1000000007ll
using namespace std;
ll powa[1234];
map<pair<int,int>,int> mpa;
map<pair<int,int>,int>::iterator iter;
struct node
{
int x,y,num;
};
int cmp(node a,node b)
{
if(a.x!=b.x)return a.x<b.x;
if(a.y!=b.y)return a.y<b.y;
return a.num>b.num;
}
int gcd(int a,int b)
{
if(!b) return a;
return gcd(b,a%b);
}
int main(void)
{
powa[0]=1;
for(int i=1;i<=1230;++i) powa[i]=(powa[i-1]*2ll)%mod;
int t,n;
cin>>t;
while(t--)
{
ll res=0;
node a[1010];
scanf("%d",&n);
for(int i=1;i<=n;++i)
{
scanf("%d%d",&a[i].x,&a[i].y);
}
sort(a+1,a+1+n,cmp);
int cur=1;
for(int i=1;i<=n;++i)
{
int num=1;
while(i<=n-1&&a[i].x==a[i+1].x&&a[i].y==a[i+1].y)
{
num++;
i++;
}
a[cur].num=num;
a[cur].x=a[i].x;
a[cur].y=a[i].y;
cur++;
}
cur--;
sort(a+1,a+1+cur,cmp);
for(int i=1;i<=cur;++i)
{
ll t=(powa[a[i].num]-a[i].num-1)%mod;
res=(res+t+mod)%mod;
}
for(int i=1;i<=cur;++i)
{
mpa.clear();
for(int j=i+1;j<=cur;++j)
{
int dx=a[j].x-a[i].x;
int dy=a[j].y-a[i].y;
int g=gcd(abs(dx),abs(dy));
dx/=g;
dy/=g;
pair<int,int> temp=mp(dx,dy);
mpa[temp]+=a[j].num;
}
for(iter=mpa.begin();iter!=mpa.end();++iter)
{
ll tmp=((powa[a[i].num]-1)*(powa[iter->second]-1))%mod;
res=(res+tmp+mod)%mod;
}
}
printf("%I64d\n",res);
}
return 0;
}