Parallelogram Counting(求平行四边形个数)
来源:互联网 发布:windows怎么升级版本 编辑:程序博客网 时间:2024/04/30 06:06
Parallelogram Counting
Time Limit: 5000MS
Memory Limit: 65536KTotal Submissions: 5605
Accepted: 1885
Memory Limit: 65536KTotal Submissions: 5605
Accepted: 1885
Description
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
The first line of the input contains a single integer t (1 <= t <= 10), the number of test cases. It is followed by the input data for each test case.
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.
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
Output should contain t lines.
Line i contains an integer showing the number of the parallelograms as described above for test case i.
Line i contains an integer showing the number of the parallelograms as described above for test case i.
Sample Input
260 02 04 01 13 15 17-2 -18 95 71 14 82 09 8
Sample Output
56
给你n个点,问最多可以形成多少个平行四边形:
利用平行四边形对角线互相平分原理,对其进行扩展,求任意两点重点,然后排序,利用排列组合从中抽取两点即可;
#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;struct none{int x,y;}no[10000],n1[1000000];bool cmp(none x,none y){if(x.x!=y.x)return x.x<y.x;elsereturn x.y<y.y; }int main(){int t,n,m=1,k;scanf("%d",&t);while(t--){scanf("%d",&n);k=0;for(int i=0;i<n;i++)scanf("%d%d",&no[i].x,&no[i].y);for(int i=0;i<n-1;i++)for(int j=i+1;j<n;j++){n1[k].x=no[i].x+no[j].x;n1[k].y=no[i].y+no[j].y;k++;}sort(n1,n1+k,cmp);long long ans=0,T=1;for(int i=1;i<k;i++){if(n1[i].x==n1[i-1].x&&n1[i].y==n1[i-1].y)T++;else{ans=ans+T*(T-1)/2;T=1;}}printf("Case %d: %lld\n",m++,ans);}}
0 0
- Parallelogram Counting(求平行四边形个数)
- LightOJ - 1058 Parallelogram Counting(平行四边形个数)
- LightOJ - 1058 Parallelogram Counting (数学几何&技巧)给n个点求组成平行四边形个数
- lightoj 1058 - Parallelogram Counting (几何,平行四边形)
- LightOJ 1058 Parallelogram Counting【平行四边形的判定】
- 【LightOJ】1305 - Area of a Parallelogram(求平行四边形面积)
- lightoj1058 && poj1791 求平行四边形个数
- Parallelogram Counting(POJ 1971)
- Parallelogram Counting
- POJ 1971 Parallelogram Counting (Hash)
- POJ 1971 Parallelogram Counting(hash)
- LightOJ 1058 Parallelogram Counting(数学)
- 【LightOJ】1058 - Parallelogram Counting(暴力计数)
- LightOJ 1058Parallelogram Counting (数学+思维)
- lightoj-1305 - Area of a Parallelogram【数学】【向量法求平行四边形面积】
- poj 1971 Parallelogram Counting
- POJ 1971 Parallelogram Counting
- POJ 1971 Parallelogram Counting
- JAVA基础语法
- 生日悖论
- Spring Animation
- 找女朋友
- 最长回文子序列模板
- Parallelogram Counting(求平行四边形个数)
- Optimization(最优化)
- LightOJ1104 birthday parado(经典概率)
- 简单工厂模式--简单的看法
- nodejs http调用报错:socket hang up
- 51nod-独木舟问题
- LightOJ1104---Birthday Paradox
- Codeforces Round #290 (Div. 2) B. Fox And Two Dots dfs
- javaWeb---cookie