Submission #35678
Source Code Expand
//template ver2.00
//------------------------------------------
//include
//------------------------------------------
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <complex>
using namespace std;
//conversion
//------------------------------------------
inline int to_int(string s) {int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string to_str(T x) {ostringstream sout; sout << x; return sout.str();}
//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}
template<class T> inline T is_inner(T x, T a, T b) {return a <= x && x < b;}
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
//container util
//------------------------------------------
#define MP make_pair
#define EACH(i, c) for(typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(c, e) ((c).find(e) != (c).end())
//repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a);i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
//IO
//------------------------------------------
#define LF(x) cout << (x) << endl;
#define LFA(a, n) cout << a[0]; FOR(itr, 1, n) {cout << " " << a[itr];} cout << endl;
#define LFP(x, w) cout << setprecision((w)); cout << setiosflags(ios::fixed); cout << (x) << endl;
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = 1e9;
const int DI[] = {0, 1, 0, -1};
const int DJ[] = {1, 0, -1, 0};
//clear memory
//--------------------------------------------
#define CLR(a) memset((a), 0 , sizeof(a))
//debug
//--------------------------------------------
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define DUMPA(a, n) cerr << #a << " = {" << a[0]; FOR(itr, 1, n) { cout << ", " << a[itr]; } cerr << "}" << endl;
#define DUMPAA(a, n, m) REP(itr, n) {REP(jtr, m) {cout << a[itr][jtr] << " ";} cout << endl;}
const int N = 100;
int n;
int x[N];
int y[N];
void init()
{
}
void solve()
{
int d = 0;
REP(i, n) REP(j, n) d = max(d, sqr(x[i] - x[j]) + sqr(y[i] - y[j]));
double ans = sqrt(d);
LFP(ans, 6);
}
int main()
{
init();
cin >> n;
REP(i, n) cin >> x[i] >> y[i];
solve();
return 0;
}
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 |
23 ms |
836 KB |
00_sample_01.txt |
AC |
23 ms |
912 KB |
00_sample_02.txt |
AC |
30 ms |
808 KB |
00_sample_03.txt |
AC |
28 ms |
780 KB |
00_sample_04.txt |
AC |
45 ms |
808 KB |
00_sample_05.txt |
AC |
26 ms |
908 KB |
01_rnd_00.txt |
AC |
25 ms |
916 KB |
01_rnd_01.txt |
AC |
30 ms |
796 KB |
01_rnd_02.txt |
AC |
27 ms |
912 KB |
01_rnd_03.txt |
AC |
25 ms |
908 KB |
01_rnd_04.txt |
AC |
27 ms |
920 KB |
01_rnd_05.txt |
AC |
24 ms |
812 KB |
01_rnd_06.txt |
AC |
26 ms |
752 KB |
01_rnd_07.txt |
AC |
25 ms |
832 KB |
01_rnd_08.txt |
AC |
26 ms |
924 KB |
01_rnd_09.txt |
AC |
26 ms |
916 KB |
01_rnd_10.txt |
AC |
24 ms |
840 KB |
01_rnd_11.txt |
AC |
27 ms |
900 KB |
01_rnd_12.txt |
AC |
23 ms |
916 KB |
01_rnd_13.txt |
AC |
26 ms |
836 KB |
01_rnd_14.txt |
AC |
22 ms |
916 KB |
01_rnd_15.txt |
AC |
28 ms |
904 KB |
01_rnd_16.txt |
AC |
24 ms |
912 KB |
01_rnd_17.txt |
AC |
25 ms |
912 KB |
01_rnd_18.txt |
AC |
27 ms |
812 KB |
01_rnd_19.txt |
AC |
22 ms |
912 KB |