Cod sursa(job #40365)

Utilizator stef2nStefan Istrate stef2n Data 27 martie 2007 13:28:31
Problema Regiuni Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.28 kb
#include <stdio.h>

#define infile "regiuni.in"
#define outfile "regiuni.out"
#define NMAX 1001
struct line{int a,b,c;};
struct point{int x,y;};

FILE *fin,*fout;
line L[NMAX];
point P[NMAX];
int n,m; // n puncte, m linii
short int V[NMAX];
short int aux1[NMAX],aux2[NMAX],ind1,ind2;

void read_data()
  {
   int i;
   fin=fopen(infile,"r");
   fscanf(fin,"%d %d",&m,&n);
   for(i=1;i<=m;i++)
      fscanf(fin,"%d %d %d",&L[i].a,&L[i].b,&L[i].c);
   for(i=0;i<n;i++)
      fscanf(fin,"%d %d",&P[i].x,&P[i].y);
   fclose(fin);
  }

inline bool sus_stanga(int x, int y, line d)
  {
   if(!d.b)
     if(d.a>0)
       return (d.a*x<-d.c);
     else
       return (d.a*x>-d.c);
   else
     return (d.a*x+d.b*y+d.c>0);
  }

int solve(short int li, short int ls)
  {
   if(li>ls)
     return 0;
   if(m==0)
     return 1;
   short int i;
   ind1=ind2=0;
   for(i=li;i<=ls;i++)
      if(sus_stanga(P[V[i]].x,P[V[i]].y,L[m]))
        aux1[ind1++]=V[i];
      else
        aux2[ind2++]=V[i];
   for(i=li;i<li+ind1;i++)
      V[i]=aux1[i-li];
   for(i=li+ind1;i<=ls;i++)
      V[i]=aux2[i-li-ind1];
   m--;
   i=solve(li,li+ind1-1)+solve(li+ind1,ls);
   m++;
   return i;
  }


int main()
{
read_data();
for(int i=0;i<n;i++)
   V[i]=i;
fout=fopen(outfile,"w");
fprintf(fout,"%d\n",solve(0,n-1));
fclose(fout);
return 0;
}