제출 #935001

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
935001		mostafa133	Odašiljači (COCI20_odasiljaci)	C++14	0 / 70	2 ms	348 KiB

odasiljaci

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long double ld;
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(x) x.begin(), x.end()
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
int main()
{
	fast;
	// freopen("pails.in", "r", stdin);
	// freopen("pails.out", "w", stdout);
	ll n;
	cin >> n;
	vector<pair<ll, ll>> v(n);
	for (int i = 0; i < n; i++)
	{
		cin >> v[i].first >> v[i].second;
	}
	ll mx = 0;
	for (int i = 0; i < n; i++)
	{
		ll mn = LLONG_MAX;
		for (int j = 0; j < n; j++)
		{
			if (i == j)
				continue;
			ll x = abs(v[i].first - v[j].first), y = abs(v[i].second - v[j].second);
			ll dis = x * x + y * y;
			mn = min(mn, dis);
			if (i == 0 && j == 3)
				cout << x << ' ' << y << ' ';
		}
		mx = max(mx, mn);
	}
	cout << mx << '\n';
	cout << fixed << setprecision(7) << sqrt((ld)mx) / ld(2);
	return 0;
}

• Subtask 1: 0 / 70