Pagini recente » Cod sursa (job #1233992) | Cod sursa (job #79861) | Cod sursa (job #1843938) | Cod sursa (job #734206) | Cod sursa (job #1592260)
#include <iostream>
#include <fstream>
#include <math.h>
#include <iomanip>
#include <algorithm>
#define EPS 0.001
using namespace std;
ifstream in("triang.in");
ofstream out("triang.out");
const double sin60 = sin(60*M_PI/180);
const double cos60 = cos(60*M_PI/180);
struct p {
double x;
double y;
};
int n;
p v[1501];
p t;
double fabs (double a)
{
if (a<0)
return -a;
return a;
}
int check (p a,p b)
{
if (fabs (a.x-b.x)<EPS)
{
if (fabs (a.y-b.y)<EPS)
return 0;
else if (a.y>b.y)
return -1;
else
return 1;
}
else if(a.x>b.x)
return -1;
else
return 1;
}
bool cmp(p a, p b) {
return a.x<b.x || (a.x==b.x && a.y<b.y);
}
bool caut(p t1/*, int st, int dr*/) {
/*int mid = (st+dr)/2;
if(st >= dr)
return false;
int ch = check(v[mid], t1);
if(ch < 0)
return caut(t1, mid+1, dr);
if(ch > 0)
return caut(t1, st, mid-1);
return true;*/
int st,dr,mij,ok;
for (st=1, dr=n; st<=dr; )
{
mij=(st+dr)>>1;
ok=check (t1,v[mij]);
if (!ok)
return 1;
else if (ok<0)
st=mij+1;
else
dr=mij-1;
}
return 0;
//return true;
}
int main() {
in >> n;
for(int i = 1; i <= n; i++) {
in >> t.x >> t.y;
v[i] = t;
}
sort(v+1, v+n+1, cmp);
/*for(int i = 0; i < n; i++) {
cout << v[i].x << " " << v[i].y << endl;
}*/
long long rez = 0;
for(int i = 1; i < n; i++) {
for(int j = i+1; j <= n; j++) {
t.x=(v[j].x-v[i].x)*cos60-(v[j].y-v[i].y)*sin60+v[i].x;
t.y=(v[j].x-v[i].x)*sin60+(v[j].y-v[i].y)*cos60+v[i].y;
rez+= caut(t/*, 0, n*/);
t.x=(v[i].x-v[j].x)*cos60-(v[i].y-v[j].y)*sin60+v[j].x;
t.y=(v[i].x-v[j].x)*sin60+(v[i].y-v[j].y)*cos60+v[j].y;
rez+= caut(t/*, 0, n*/);
//double p1 =
//cout << "(" << v1[i] << ", " << v2[i] << ") (" << v1[j] << ", " << v2[j] << ") -> " << "(" << hF11 << ", " << hF12 << ") (" << hF21 << ", " << hF22 << ")" << endl;
}
}
out << rez/3;
return 0;
}