Submission #6429090


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

double distance(pair<double,double> x, pair<double,double> y){
  double d = sqrt(pow(x.first-y.first,2)+pow(x.second-y.second,2));
  return d;
}

int main(){
  int N; cin >>N;
  pair<double,double> x[N];
  for(int i=0;i<N;i++){
    cin >>x[i].first >>x[i].second;
  }

  double max;
  for(int i=0; i<N-1; i++){
    for(int j=i+1; j<N; j++){
      double d = distance(x[i], x[j]);
      if(d>max) max = d;
    }
  }

  cout << max;
  return 0;
}

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User VOVU
Language C++14 (GCC 5.4.1)
Score 0
Code Size 518 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
WA × 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 WA 1 ms 256 KB
00_sample_01.txt WA 1 ms 256 KB
00_sample_02.txt WA 1 ms 256 KB
00_sample_03.txt WA 1 ms 256 KB
00_sample_04.txt WA 1 ms 256 KB
00_sample_05.txt WA 1 ms 256 KB
01_rnd_00.txt WA 1 ms 256 KB
01_rnd_01.txt WA 1 ms 256 KB
01_rnd_02.txt WA 1 ms 256 KB
01_rnd_03.txt WA 1 ms 256 KB
01_rnd_04.txt WA 1 ms 256 KB
01_rnd_05.txt WA 1 ms 256 KB
01_rnd_06.txt WA 1 ms 256 KB
01_rnd_07.txt WA 1 ms 256 KB
01_rnd_08.txt WA 1 ms 256 KB
01_rnd_09.txt WA 1 ms 256 KB
01_rnd_10.txt WA 1 ms 256 KB
01_rnd_11.txt WA 1 ms 256 KB
01_rnd_12.txt WA 1 ms 256 KB
01_rnd_13.txt WA 1 ms 256 KB
01_rnd_14.txt WA 1 ms 256 KB
01_rnd_15.txt WA 1 ms 256 KB
01_rnd_16.txt WA 1 ms 256 KB
01_rnd_17.txt WA 1 ms 256 KB
01_rnd_18.txt WA 1 ms 256 KB
01_rnd_19.txt WA 1 ms 256 KB