0
Your rating: None

CodeChef submission 612970 (C++ 4.0.0-8)

CodeChef submission 612970 (C++ 4.0.0-8) plaintext list. Status: WA, problem E3, contest . By vikramwakade (vikramwakade), 2011-08-02 18:38:36.
  1. #include<stdio.h>
  2. #include<math.h>
  3. #include<malloc.h>
  4.  
  5. float dist(int i, int j, long** a)
  6. {
  7.     return sqrt(((a[i][0]-a[j][0])*(a[i][0]-a[j][0]) + (a[i][1]-a[j][1])*(a[i][1]-a[j][1])));     
  8. }
  9.  
  10. double calc_area(int n, long** p)
  11. {
  12.     double max_area = 0;
  13.     double a, b, c, s;
  14.     
  15.     for(int i=0; i<n; i++)
  16.       for(int j=i+1; j<n; j++)
  17.         for(int k=j+1; k<n; k++)
  18.         {
  19.             a = dist(i,j,p);
  20.             b = dist(j,k,p);
  21.             c = dist(i,k,p);
  22.             s = (a+b+c)/2;
  23.             //printf("a=%.1f b=%.1f c=%.1f s=%.1f\n",a,b,c,s);
  24.                 
  25.             float temp = sqrt(s*(s-a)*(s-b)*(s-c));
  26.             if(temp > max_area)
  27.                 max_area = temp;
  28.         }        
  29.     
  30.     return max_area;
  31. }
  32.  
  33. int main(void)
  34. {
  35.     int tc;
  36.     long noi = 3;
  37.     
  38.     scanf("%d", &tc);
  39.     for(int i=0; i<tc; i++)
  40.     {
  41.         scanf("%ld", &noi);
  42.         long **coordinates = (long **)malloc(sizeof(long *) * noi);
  43.         for(long j=0; j<noi; j++)
  44.         {
  45.             coordinates[j] = (long *)malloc(sizeof(long) * 2);
  46.             scanf("%ld %ld", &coordinates[j][0], &coordinates[j][1]);
  47.         }
  48.         printf("%ld\n", (long)(2*calc_area(noi ,coordinates)));
  49.     }
  50.     
  51.     return 0;    
  52. }
  53.

Comments