Mai intai trebuie sa te autentifici.
Cod sursa(job #3236167)
| Utilizator | Data | 26 iunie 2024 15:39:23 | |
|---|---|---|---|
| Problema | Cele mai apropiate puncte din plan | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.02 kb |
#include <fstream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <cmath>
using namespace std;
ifstream cin("cmap.in");
ofstream cout("cmap.out");
#pragma GCC optimize ("Ofast,unroll-loops")
// e infoarena deci probabil se ia 100 cu asta
int n;
struct point{int x,y;};
vector <point> p;
double formula(point unu, point doi)
{
return sqrtl(1LL*(unu.x-doi.x)*(unu.x-doi.x)+1LL*(unu.y-doi.y)*(unu.y-doi.y));
}
signed main()
{
cin >> n;
for(int i = 1 ; i <= n ; ++i)
{
int asta , ala;
cin >> asta >> ala;
p.push_back({asta,ala});
}
sort(p.begin(),p.end(),[](point unu,point doi){return unu.x<doi.x;});
double dist = formula(p[0],p[1]);
for(int i = 2 ; i < (int)p.size() ; ++i)
{
for(int j = i-1 ; j >= 0 ; --j)
{
int d = (int)dist;
if(p[i].x-p[j].x > d) break;
dist = min(dist,formula(p[i],p[j]));
}
}
cout << fixed << setprecision(6) << dist ;
return 0;
}
