Submission #22925
Source Code Expand
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
using namespace std;
#if __GNUC__
#include <tr1/unordered_map>
#include <tr1/unordered_set>
using namespace tr1;
#else
#include <unordered_map>
#include <unordered_set>
#endif
#ifdef _MSC_VER
#define __typeof__ decltype
template <class T> int popcount(T n) { return n ? 1 + popcount(n & (n - 1)) : 0; }
#endif
#ifdef __GNUC__
template <class T> int popcount(T n);
template <> int popcount(unsigned int n) { return __builtin_popcount(n); }
template <> int popcount(int n) { return __builtin_popcount(n); }
template <> int popcount(unsigned long long n) { return __builtin_popcountll(n); }
template <> int popcount(long long n) { return __builtin_popcountll(n); }
#endif
#define rep (i, n) for (int i = 0; i < (int)n; ++i)
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define MEMCPY(dest, src) memcpy(dest, src, sizeof(src))
template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }
typedef long long ll;
typedef pair<int, int> pint;
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
const double EPS = 1e-8;
const double PI = acos(-1.0);
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
bool valid_pos(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }
template <class T> void print(T a, int n, int br = 1, const string& deli = ", ") { cout << "{ "; for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } cout << " }"; while (br--) cout << endl; }
template <class T> void print(const vector<T>& v, int br = 1, const string& deli = ", ") { print(v, v.size(), br, deli); }
template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }
template <class T> void input(int n, T& a) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T, class U> void input(int n, T& a, U& b) { for (int i = 0; i < n; ++i) cin >> a[i] >> b[i]; }
template <class T> vector<T> input(int n) { vector<T> res(n); for (int i = 0; i < n; ++i) cin >> res[i]; return res; }
int main()
{
int n;
int x[128], y[128];
cin >> n;
input(n, x, y);
double res = -1;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
max_swap(res, hypot(x[i] - x[j], y[i] - y[j]));
printf("%.6f\n", res);
}
Submission Info
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
00_max.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt |
Case Name |
Status |
Exec Time |
Memory |
00_max.txt |
AC |
22 ms |
732 KB |
00_sample_01.txt |
AC |
22 ms |
788 KB |
00_sample_02.txt |
AC |
21 ms |
732 KB |
00_sample_03.txt |
AC |
21 ms |
788 KB |
00_sample_04.txt |
AC |
22 ms |
816 KB |
00_sample_05.txt |
AC |
21 ms |
780 KB |
01_rnd_00.txt |
AC |
21 ms |
788 KB |
01_rnd_01.txt |
AC |
22 ms |
788 KB |
01_rnd_02.txt |
AC |
22 ms |
792 KB |
01_rnd_03.txt |
AC |
22 ms |
796 KB |
01_rnd_04.txt |
AC |
22 ms |
760 KB |
01_rnd_05.txt |
AC |
21 ms |
792 KB |
01_rnd_06.txt |
AC |
22 ms |
796 KB |
01_rnd_07.txt |
AC |
22 ms |
768 KB |
01_rnd_08.txt |
AC |
22 ms |
784 KB |
01_rnd_09.txt |
AC |
23 ms |
792 KB |
01_rnd_10.txt |
AC |
22 ms |
816 KB |
01_rnd_11.txt |
AC |
21 ms |
784 KB |
01_rnd_12.txt |
AC |
23 ms |
780 KB |
01_rnd_13.txt |
AC |
22 ms |
792 KB |
01_rnd_14.txt |
AC |
22 ms |
772 KB |
01_rnd_15.txt |
AC |
21 ms |
784 KB |
01_rnd_16.txt |
AC |
22 ms |
824 KB |
01_rnd_17.txt |
AC |
22 ms |
780 KB |
01_rnd_18.txt |
AC |
22 ms |
796 KB |
01_rnd_19.txt |
AC |
21 ms |
788 KB |