제출 #1319478

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1319478		murad_mirzebeyli	Odašiljači (COCI20_odasiljaci)	C++20	42 / 70	2 ms	332 KiB

odasiljaci

#include <bits/stdc++.h>
#define endl '\n'
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define F first
#define S second
#define pf push_front
#define pb push_back
#define ll long long
#define ull unsigned long long
#define ld long double
#define int long long
#define vi vector <int>
#define pii pair <int,int>
#define tiii tuple<int,int,int>
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define out(v) for (auto x:v) cout << x << ' '
#define out1(v) for (auto x:v) cout << x << endl
#define inp(arr) for (int i=0;i<arr.size();i++) cin>>arr[i]
const int MAX=1e6;
const int MOD=1e9+7;
using namespace std;
const int inf=1e18;
void solve(){
   int n;
   cin>>n;
   vector<pii> vt(n+1);
   for(int i=1;i<=n;i++){
    cin>>vt[i].F>>vt[i].S;
   }
   if(n==1){
    cout<<0<<endl;
    return;
   }
   int ans=0;
   for(int i=1;i<=n;i++){
    int a=LLONG_MAX;
    for(int j=1;j<=n;j++){
        if(j!=i){
            a=min(a,abs(vt[i].F-vt[j].F)*abs(vt[i].F-vt[j].F)+abs(vt[i].S-vt[j].S)*abs(vt[i].S-vt[j].S));
        }
    }
    ans=max(a,ans);
   }
   cout<<fixed<<setprecision(20)<<sqrt(ans)/2<<endl;
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    int t=1;
    //cin>>t;
    while(t--) {
      solve();
    }
}

• Subtask 1: 42 / 70