제출 #1318071

#제출 시각아이디문제언어결과실행 시간메모리
1318071lastgladiator2nahOdašiljači (COCI20_odasiljaci)C++20
70 / 70
11 ms440 KiB
#include<bits/stdc++.h> #define ll long long using namespace std; struct adicto{ double x,y; }; double STOL(const adicto&a,const adicto& b) { return hypot(a.x-b.x,a.y-b.y); } int main() { int n; cin>>n; vector<adicto>v(n); for(int i=0; i<n; i++) cin>>v[i].x>>v[i].y; double maks=0; vector<double>mini(n,numeric_limits<double>::infinity()); vector<bool>ok(n,false); mini[0]=0; for(int i=0; i<n; i++) { int k=-1; for(int j=0; j<n; j++) { if(!ok[j] && (k==-1 || mini[j]<mini[k])) k=j; } ok[k]=true; if(mini[k]>maks) maks=mini[k]; for(int j=0; j<n; j++) { if(!ok[j]) { double h=STOL(v[k],v[j]); if(h<mini[j]) mini[j]=h; } } } cout<<fixed<<setprecision(7)<<maks/2.0; }
#Verdict Execution timeMemoryGrader output
Fetching results...