Cod sursa(job #2998328)

Utilizator Beverita2345Bretan Alexandru Beverita2345 Data 9 martie 2023 11:42:56
Problema Cele mai apropiate puncte din plan Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.76 kb
#include <bits/stdc++.h>
#define PII pair<int,int>
#define int long long

using namespace std;

ifstream in("cmap.in");
ofstream out("cmap.out");

const int dim = 1e6 + 5;

int n;

PII v[dim];

int dist(int x1,int y1,int x2,int y2){
    return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
}

void read(){
    in>>n;

    for(int i=1;i<=n;i++){
        in>>v[i].first>>v[i].second;
    }
}

void solve(){
    const int val = (int) sqrt(n);

    int minim = 2e18 +5 ;

    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=i+val;j++){
            minim = min(minim, dist(v[i].first,v[i].second,v[j].first,v[j].second));
        }
    }

    out<<setprecision(7)<<(double)sqrt(minim);
}

signed main()
{
    read();

    solve();

    return 0;
}