제출 #473889

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
473889		AbdoMo	Odašiljači (COCI20_odasiljaci)	C++17	42 / 70	394 ms	452 KiB

odasiljaci

#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define pb push_back
const int mod = 1e9+7;
using namespace std;
bool comp(string a,string b)
{
    if(a.size()==b.size())
    {
        return a<b;
    }
    return a.size()<b.size();
}
int n;
vector<pair<long double,long double>>v;
long double dis(long double x1,long double y1,long double x2,long double y2)
{
    return sqrt(abs(x1-x2)*abs(x1-x2)+abs(y1-y2)*abs(y1-y2));
}
bool valid(long double rad)
{
    bool vis[n]={};
    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            if(dis(v[i].first,v[i].second,v[j].first,v[j].second)<=rad)
            {
                vis[i]=1;
                vis[j]=1;
            }
        }
    }
    bool val=1;
    for(int i=0;i<n;i++)
    {
        val&=vis[i];
    }
    return val;
}
void solve(){

    cin>>n;

    for(int i=0;i<n;i++)
    {
        int x,y;
        cin>>x>>y;
        v.pb({x,y});
    }
    double x=2;
    long double ans=1e9,s=0,e=1e9,m;
    while((e-s)>=1e-10)
    {
        m=(s+e)/x;
       // cout<<m<<" "<<valid(m)<<endl;
        if(valid(m))
        {
            ans=m;
            e=m-1e-10;
        }
        else
        {
            s=m+1e-10;
        }
    }

    cout<<fixed<<setprecision(9)<<ans/x<<endl;


}
int32_t main(){
	int t=1;
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
   // cin>>t;
	while(t--){solve();}
	return 0;
}

• Subtask 1: 42 / 70