UPC Contest 1748 Little Sub and Triangles

题目描述

Little Sub loves triangles. Now he has a problem for you.
Given n points on the two-dimensional plane, you have to answer many queries. Each query require you to calculate the number of triangles which are formed by three points in the given points set and their area S should satisfy l≤S≤r.
Specially, to simplify the calculation, even if the formed triangle degenerate to a line or a point which S = 0, we still consider it as a legal triangle.

 

输入

The fi rst line contains two integer n, q(1≤n≤250, 1≤q≤100000), indicating the total number of points.
All points will be described in the following n lines by giving two integers x, y(-107≤x, y≤107) as their coordinates.
All queries will be described in the following q lines by giving two integers l, r(0≤l≤r≤1018).

 

输出

Output the answer in one line for each query.

 

样例输入

复制样例数据

4 2
0 1
100 100
0 0
1 0
0 50
0 2

样例输出

3
1

思路：

           暴力，将每个三角形的面积都求出来，然后排序，找到在[l,r]范围内的个数即可。

AC代码

#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdio>
using namespace std;
#define ll long long
struct point
{
    ll x,y;
}a[900];
ll b[9000000];
int main()
{
    int n,num=0,q;
    ll ans;
    scanf("%d %d",&n,&q);
    for(int i=1;i<=n;i++)
    {
        scanf("%lld %lld",&a[i].x,&a[i].y);
         for(int j=1;j<i;j++){
            for(int k=j+1;k<i;k++){
                ans=abs((a[i].x-a[j].x)*(a[i].y-a[k].y)-(a[i].x-a[k].x)*(a[i].y-a[j].y));
                b[num++]=abs(ans);
            }
        }
    }
    sort(b,b+num);
    for(int i=0;i<q;i++)
    {
        ll l,r;
        scanf("%lld %lld",&l,&r);
        ll count1=(upper_bound(b,b+num,r*2)-b)-(lower_bound(b,b+num,l*2)-b);
        printf("%lld\n",count1);
    }
    return 0;
}