Submission #1152381

#TimeUsernameProblemLanguageResultExecution timeMemory
1152381pearl333Odašiljači (COCI20_odasiljaci)C++20
42 / 70
2 ms328 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n;
	int k;
	cin>>n;
	int arr[n][2];
	int ans[n];
	for (int i = 0;i<n;i++) {
		cin>>arr[i][0]>>arr[i][1];
	}
	for (int i = 0;i<n;i++) {
		for (int j = 0;j<n;j++) {
			if (i!=j) {
				if (j==0) {
					k = (arr[i][0]-arr[j][0])*(arr[i][0]-arr[j][0]) + (arr[i][1]-arr[j][1])*(arr[i][1]-arr[j][1]);
				}
				else if (i==0 and j==1) {
					k = (arr[i][0]-arr[j][0])*(arr[i][0]-arr[j][0]) + (arr[i][1]-arr[j][1])*(arr[i][1]-arr[j][1]);
				}
				else {
					k = min(k,(arr[i][0]-arr[j][0])*(arr[i][0]-arr[j][0]) + (arr[i][1]-arr[j][1])*(arr[i][1]-arr[j][1]));
				}
			}
			if (j==n-1) {
				ans[i]=k;
			}
		}
	}
	int t = 0;
	for (int i = 0;i<n;i++) {
		t = max(t,ans[i]);
	}
	double m = sqrt(t)/2;
	cout<<fixed<<setprecision(7)<<m;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...