LightOJ 题目1058Parallelogram Counting（组合数学）

最新推荐文章于 2018-09-16 16:57:27 发布

Jogging_Clown

最新推荐文章于 2018-09-16 16:57:27 发布

阅读量602

点赞数

分类专栏：数学

本文链接：https://blog.csdn.net/yu_ch_sh/article/details/49739175

版权

数学专栏收录该内容

164 篇文章 0 订阅

订阅专栏

1058 - Parallelogram Counting

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

There are n distinct points in the plane, given by their integer coordinates. Find the number of parallelograms whose vertices lie on these points. In other words, find the number of 4-element subsets of these points that can be written as {A, B, C, D} such that AB || CD, and BC || AD. No four points are in a straight line.

Input

Input starts with an integer T (≤ 15), denoting the number of test cases.

The first line of each test case contains an integer n (1 ≤ n ≤ 1000). Each of the next n lines, contains 2 space-separated integers x and y (the coordinates of a point) with magnitude (absolute value) of no more than 1000000000.

Output

For each case, print the case number and the number of parallelograms that can be formed.

Sample Input

Output for Sample Input

0 0

2 0

4 0

1 1

3 1

5 1

-2 -1

8 9

5 7

1 1

4 8

2 0

9 8

Case 1: 5

Case 2: 6

题目大意：就是给了n个点的坐标，然后问n个点能组成多少个平行四边形

思路：平行四边形的两条线段的中点相同，对所有的中点排下序，然后统计每个的数目N,从N个中取两个就好了

ac代码

611047	2015-11-09 13:26:08	1058 - Parallelogram Counting	C++	0.892	17660	Accepted

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<map>
#define LL long long
using namespace std;
double x[2010],y[2010];
struct s
{
    double x,y;
}a[1010*1010];
int cmp(s a, s b)
{
    if(a.x==b.x)
        return a.y<b.y;
    return a.x<b.x;
}
LL C(LL a,LL b)
{
    LL ans=1;
    LL i;
    while(b>a/2)
        b=a-b;
    for(i=1;i<=b;i++)
    {
        ans*=(a-i+1);
        ans/=i;
    }
    return ans;
}
int main()
{
    int t,c=0;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d",&n);
        int i,j;
        for(i=1;i<=n;i++)
        {
            //double x,y;
            scanf("%lf%lf",&x[i],&y[i]);
        }
        int k=0;
        for(i=1;i<=n;i++)
            for(j=i+1;j<=n;j++)
            {
                if(x[i]==x[j]&&y[i]==y[j])
                    continue;
                double mx,my;
                mx=(x[i]+x[j])/2;
                my=(y[i]+y[j])/2;
                a[k].x=mx;
                a[k++].y=my;
            }
        sort(a,a+k,cmp);
        /*for(i=0;i<k;i++)
        {
            printf("****%lf %lf\n",a[i].x,a[i].y);
        }*/
        double tx,ty;
        LL temp=1,ans=0;
        for(i=1;i<k;i++)
        {
            if(a[i].x==a[i-1].x&&a[i].y==a[i-1].y)
            {
                temp++;
            }
            else
            {
                if(temp<2)
                {
                    temp=1;
                    continue;
                }
                ans+=C(temp,2);
                temp=1;
            }
        }
        if(temp>=2)
            ans+=C(temp,2);
        printf("Case %d: %lld\n",++c,ans);
    }
}

SPECIAL THANKS: JANE ALAM JAN (DESCRIPTION, SOLUTION, DATASET)