Submission #22927


Source Code Expand

// compile with "g++ XXX.cc -mno-cygwin -O2" in Cygwin

#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>
#include<bitset>
#include<cassert>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define FOR3(i,a,b) for(int i=a,i##_end=b;i<i##_end;i++)
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define CLS(x,val) memset((x) , val , sizeof(x)) 
typedef long long ll_t;
typedef long double ld_t;
typedef vector<int> VI; 
typedef vector<VI> VVI;
typedef complex<int> xy_t;

template<typename T> void debug(T v , string delimiter = "\n")
{ for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++) cout << *it << delimiter; cout << flush ;}

int dx[]  = {0,1,0,-1};
int dy[]  = {1,0,-1,0};
string ds = "SENW";

const double PI = 4.0*atan(1.0);

double x[1111];
double y[1111];

int main() {
  int N;
  cin>>N;
  FOR(i,N) cin>>x[i]>>y[i];
  double ans = 0;
  FOR(i,N) FOR(j,i){
    double d = hypot(x[i]-x[j],y[i]-y[j]);
    ans = max(ans , d);
  }
  printf("%.10f\n" , ans);
  return 0 ;
}

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User EmK
Language C++ (G++ 4.6.4)
Score 100
Code Size 1483 Byte
Status AC
Exec Time 25 ms
Memory 816 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 22 ms 800 KB
00_sample_01.txt AC 20 ms 788 KB
00_sample_02.txt AC 20 ms 796 KB
00_sample_03.txt AC 21 ms 792 KB
00_sample_04.txt AC 21 ms 784 KB
00_sample_05.txt AC 21 ms 736 KB
01_rnd_00.txt AC 22 ms 788 KB
01_rnd_01.txt AC 22 ms 736 KB
01_rnd_02.txt AC 21 ms 788 KB
01_rnd_03.txt AC 22 ms 792 KB
01_rnd_04.txt AC 22 ms 780 KB
01_rnd_05.txt AC 22 ms 784 KB
01_rnd_06.txt AC 22 ms 788 KB
01_rnd_07.txt AC 22 ms 796 KB
01_rnd_08.txt AC 23 ms 772 KB
01_rnd_09.txt AC 22 ms 816 KB
01_rnd_10.txt AC 21 ms 796 KB
01_rnd_11.txt AC 21 ms 792 KB
01_rnd_12.txt AC 22 ms 736 KB
01_rnd_13.txt AC 21 ms 768 KB
01_rnd_14.txt AC 25 ms 796 KB
01_rnd_15.txt AC 22 ms 812 KB
01_rnd_16.txt AC 21 ms 796 KB
01_rnd_17.txt AC 21 ms 756 KB
01_rnd_18.txt AC 21 ms 788 KB
01_rnd_19.txt AC 21 ms 792 KB