Pagini recente » Cod sursa (job #2809616) | Cod sursa (job #3168606) | Cod sursa (job #1162014) | Cod sursa (job #1470120) | Cod sursa (job #488127)
Cod sursa(job #488127)
#include<algorithm>
#include<math.h>
using namespace std;
#define N_MAX 50002
#define EPS 0.00000001
int n,i;
typedef pair <float,float> p;
p a[N_MAX],centru;
float Min=1002*N_MAX;
float V=1002;
inline float dist(p a,p b)
{
return sqrtf((double)(a.first-b.first)*(a.first-b.first)+(double)(a.second-b.second)*(a.second-b.second));
}
float CalcDist(p centru)
{
float rez=0;
for(int i=1;i<=n;i++)
rez+=dist(centru,a[i]);
return rez;
}
inline float modul(float x)
{
if(x<0)
return -x;
return x;
}
void Solve(p centru)
{
if(modul(V-EPS)<0.0000001)
{
printf("%f %f\n",centru.first,centru.second);
exit(0);
}
float mij=CalcDist(centru);
float st=CalcDist(p(centru.first-V,centru.second));
float dr=CalcDist(p(centru.first+V,centru.second));
float sus=CalcDist(p(centru.first,centru.second-V));
float jos=CalcDist(p(centru.first,centru.second+V));
float MIN=min(min(min(st,dr),min(sus,jos)),mij);
if(modul(MIN-mij)<EPS)
{
V=(float)V/2;
Solve(centru);
}
if(modul(MIN-st)<EPS)
{
Solve(p(centru.first-V,centru.second));
}
else
if(modul(MIN-dr)<EPS)
{
Solve(p(centru.first+V,centru.second));
}
else
if(modul(MIN-sus)<EPS)
{
Solve(p(centru.first,centru.second-V));
}
else
if(modul(MIN-jos)<EPS)
{
Solve(p(centru.first,centru.second+V));
}
}
int main()
{
freopen("adapost2.in","r",stdin);
freopen("adapost2.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%f%f",&a[i].first,&a[i].second);
centru.first+=a[i].first;
centru.second+=a[i].second;
}
centru.first/=n;
centru.second/=n;
Solve(centru);
return 0;
}