Submission #22926


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <ctime>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;
static const double EPS = 1e-10;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(a) a.begin(),a.end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SS stringstream
#define DBG1(a) rep(_X,sz(a)){printf("%d ",a[_X]);}puts("");
#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf("%d ",a[_X][_Y]);puts("");}
#define bitcount(b) __builtin_popcount(b)
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)

#define delete(a,n) a.erase(remove(all(a),n),a.end())
template<typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; }
template<typename T> void operator>>(vector<T>& a, int b) {while(b--)if(!a.empty())a.pop_back();}
bool isprime(int n){ if(n<2)return false;  for(int i=2;i*i<=n;i++)if(n%i==0)return false;  return true;} 
ll b_pow(ll x,ll n){return n ? b_pow(x*x,n/2)*(n%2?x:1) : 1ll;}
string itos(int n){stringstream ss;ss << n;return ss.str();}


int main(){
	ios_base::sync_with_stdio(false);
	vector< complex<double> > A;
	int n;
	cin >> n;
	for(int i = 0 ; i < n ; i++){
		double x,y;
		cin >> x >> y;
		A.push_back(complex<double>(x,y));
	}
	double ans = 0;
	for(int i = 0 ; i < n ; i++){
		for(int j = i+1 ; j < n ; j++){
			ans = max(ans,abs(A[i]-A[j]));
		}
	}
	printf("%.15f\n",ans);
}

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User kyuridenamida
Language C++ (G++ 4.6.4)
Score 100
Code Size 1831 Byte
Status AC
Exec Time 24 ms
Memory 828 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 26
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 21 ms 764 KB
00_sample_01.txt AC 21 ms 788 KB
00_sample_02.txt AC 21 ms 788 KB
00_sample_03.txt AC 22 ms 812 KB
00_sample_04.txt AC 20 ms 756 KB
00_sample_05.txt AC 22 ms 788 KB
01_rnd_00.txt AC 22 ms 768 KB
01_rnd_01.txt AC 22 ms 784 KB
01_rnd_02.txt AC 22 ms 760 KB
01_rnd_03.txt AC 24 ms 812 KB
01_rnd_04.txt AC 22 ms 788 KB
01_rnd_05.txt AC 22 ms 768 KB
01_rnd_06.txt AC 20 ms 796 KB
01_rnd_07.txt AC 22 ms 764 KB
01_rnd_08.txt AC 21 ms 788 KB
01_rnd_09.txt AC 21 ms 812 KB
01_rnd_10.txt AC 23 ms 760 KB
01_rnd_11.txt AC 22 ms 788 KB
01_rnd_12.txt AC 23 ms 784 KB
01_rnd_13.txt AC 23 ms 776 KB
01_rnd_14.txt AC 23 ms 764 KB
01_rnd_15.txt AC 23 ms 820 KB
01_rnd_16.txt AC 21 ms 788 KB
01_rnd_17.txt AC 20 ms 788 KB
01_rnd_18.txt AC 22 ms 764 KB
01_rnd_19.txt AC 23 ms 828 KB