Pagini recente » Cod sursa (job #1940830) | Cod sursa (job #1307268) | Cod sursa (job #1628868) | Cod sursa (job #2874648) | Cod sursa (job #752780)
Cod sursa(job #752780)
#include <cstdio>
#include <algorithm>
#include <math.h>
#define eps 1.e-14
using namespace std;
struct Segment {
double x,y1,y2;
};
struct Segment2 {
double x,y;
};
Segment a[200001];
Segment2 s1[200001];
Segment2 s2[200001];
bool cmp (Segment2 A , Segment2 B) {
return (A.x-B.x<=-eps);
}
int main () {
long n,i,c=0,u=0,o=0,num=0;
double aux,st,dr,rays;
long f1,f2,f3;
freopen ("rays.in","r",stdin);
freopen ("rays.out","w",stdout);
scanf("%ld",&n);
for (i=1;i<=n;i++) {
scanf("%ld%ld%ld",&f1,&f2,&f3);
a[i].x=f1;
a[i].y1=f2;
a[i].y2=f3;
if (a[i].y1-a[i].y2>eps) {
aux=a[i].y1;
a[i].y1=a[i].y2;
a[i].y2=aux;
}
if (a[i].x>eps) {
s1[++u].x=a[i].y1/a[i].x;
s1[u].y=a[i].y2/a[i].x;
}
else {
s2[++o].x=-a[i].y1/a[i].x;
s2[o].y=-a[i].y2/a[i].x;
}
}
sort (s1+1,s1+1+u,cmp);
sort (s2+1,s2+1+o,cmp);
rays=s1[1].y;
num=1;
for (i=2;i<=u;i++)
if ((rays-s1[i].x)<=-eps)
num++,rays=s1[i].y;
rays=s2[1].y;
num++;
for (i=2;i<=o;i++)
if ((rays-s2[i].x)<=-eps)
num++,rays=s2[i].y;
printf("%ld\n",num);
return 0;
}