# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
474155 | Tuanchim | Odašiljači (COCI20_odasiljaci) | C++14 | 120 ms | 12728 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
# include <bits/stdc++.h>
#define ll long long
#define fi freopen("orasiljaci.inp","r",stdin);
#define fo freopen("orasiljaci.out","w",stdout);
using namespace std;
struct kieurulieu { ll r,a,b; };
struct point { ll x,y; };
int cam[100005],n;
vector<kieurulieu>v;
point p[10005];
ll kq;
ll abs(point a, point b)
{
return ((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
int find_cam(int x)
{
if (cam[x]==x) return x;
return cam[x]=find_cam(cam[x]);
}
bool cmp(kieurulieu a, kieurulieu b)
{
return a.r<b.r;
}
int main ()
{
//fi; fo;
cin>>n;
for (int i=1;i<=n;i++)
{
cam[i]=i;
cin>>p[i].x>>p[i].y;
for (int j=1;j<i;j++)
{
v.push_back({abs(p[j],p[i]),j,i});
}
}
sort (v.begin(),v.end(),cmp);
for (int i=0;i<v.size();i++){
if (find_cam(v[i].a)!=find_cam(v[i].b))
{
kq=v[i].r;
cam[find_cam(v[i].b)]=cam[find_cam(v[i].a)];
}
}
cout<<fixed<<setprecision(7)<<sqrt(kq)/2;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |