Submission #5210736

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

static const int INF = 1e9 + 7;

template<typename T>
using Vec = vector<T>;

template<typename T, typename T2>
using P = pair<T, T2>;

template<typename... Args>
using Tup = tuple<Args...>;

template<typename T>
using qp = priority_queue<T, Vec<T>, greater<T> >;

template<typename T>
using pq = priority_queue<T>;

using llong = long long;
using ullong = unsigned long long;
using uint = unsigned int;

template<typename T>
T gcd(T x, T y)
{
	return y ? gcd(y, x % y) : x;
}

short n;
long long m;
Vec<int> p;

map<tuple<short, long long, char>, long long> dp;

long long dfs(short now, long long score, char throwed) {
	if (now == n || throwed == 4) return m - score;
	auto status = make_tuple(now, score, throwed);
	if (dp.count(status)) return dp[status];
	
	long long res = 0;
	for (int i = 0; i <= 4; i++) {
		if (score < i * p[now] || throwed + i > 4) break;
		res = max(res, dfs(now + 1, score - i * p[now], throwed + i));
	}
	return dp[status] = res;
}

void hawawa()
{
	int n;
	cin >> n;
	Vec<complex<double>> c(n);
	for (auto&& i : c) {
		int x, y;
		cin >> x >> y;
		i.real(x);
		i.imag(y);
	}
	double ans = 0;
	for (int i = 0; i + 1 < n; i++) {
		for (int j = i + 1; j < n; j++) {
			ans = max(ans, abs(c[i] - c[j]));
		}
	}
	cout << ans << "\n";
}


int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	hawawa();
}

Submission Info

Judge Result