Submission #4064954


Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int N=100;
int x[105]{};
int y[105]={};
int d[20000]={};

int main(){
	cin>>N;
  	for(int i=0;i<N;i++){
    	cin >> x[i] >>y[i];
    }
	for(int i=0;i<N;i++){
    	for(int j=0;j<N;j++){
        	if(i!=j){
            	d[101*i+j]=pow((x[i]-x[j]),2)+pow((y[i]-y[j]),2);
            }
        }    
    }	
  	
  	sort(d,d+20000,greater<int>());
   	cout <<sqrt(d[0]);
    
  
  
}

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User seigoo
Language C++14 (GCC 5.4.1)
Score 100
Code Size 482 Byte
Status AC
Exec Time 2 ms
Memory 384 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 2 ms 256 KB
00_sample_01.txt AC 2 ms 256 KB
00_sample_02.txt AC 2 ms 256 KB
00_sample_03.txt AC 2 ms 384 KB
00_sample_04.txt AC 2 ms 384 KB
00_sample_05.txt AC 2 ms 384 KB
01_rnd_00.txt AC 2 ms 256 KB
01_rnd_01.txt AC 2 ms 384 KB
01_rnd_02.txt AC 2 ms 384 KB
01_rnd_03.txt AC 2 ms 256 KB
01_rnd_04.txt AC 2 ms 256 KB
01_rnd_05.txt AC 2 ms 384 KB
01_rnd_06.txt AC 2 ms 384 KB
01_rnd_07.txt AC 2 ms 384 KB
01_rnd_08.txt AC 2 ms 384 KB
01_rnd_09.txt AC 2 ms 256 KB
01_rnd_10.txt AC 2 ms 256 KB
01_rnd_11.txt AC 2 ms 256 KB
01_rnd_12.txt AC 2 ms 256 KB
01_rnd_13.txt AC 2 ms 256 KB
01_rnd_14.txt AC 2 ms 256 KB
01_rnd_15.txt AC 2 ms 256 KB
01_rnd_16.txt AC 2 ms 256 KB
01_rnd_17.txt AC 2 ms 256 KB
01_rnd_18.txt AC 2 ms 256 KB
01_rnd_19.txt AC 2 ms 384 KB