Cod sursa(job #1817787)

Utilizator radu.leonardoThe Doctor radu.leonardo Data 28 noiembrie 2016 14:45:28
Problema Cele mai apropiate puncte din plan Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <fstream>
#define INF 2000000000
#define MAXN 100010

using namespace std;
struct punct{int x,y;}p[MAXN];
int i,j,n;
long long sol;

inline long long dist(punct a,punct b) {return (long long)((long long)(a.x-b.x)*(a.x-b.x)+(long long)(a.y-b.y)*(a.y-b.y));}
struct cmp{
inline bool operator ()(punct a,punct b){return a.x<b.x;}
};

int main()
{
    ifstream fi("cmap.in");
    ofstream fo("cmap.out");
    fi>>n;
    for(i=0;i<n;i++)
    fi>>p[i].x>>p[i].y;
    sort(p,p+n,cmp());
    sol=(1LL<<61);
    for(i=0;i<n;i++)
    for(j=i+1;j<=i+3 and j<n;j++)   if(dist(p[i],p[j])<sol) sol=dist(p[i],p[j]);
    fo<<setprecision(6)<<fixed;
    fo<<sqrt((double)sol)<<"\n";
}