Submission #609325


Source Code Expand

#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<((int)(n));i++)
#define reg(i,a,b) for(int i=((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i=((int)(n))-1;i>=0;i--)
#define ireg(i,a,b) for(int i=((int)(b));i>=((int)(a));i--)
typedef long long int lli;
typedef pair<int,int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX

int n;
double y[105],x[105];
int main(void){
	double q;
	scanf("%d",&n);
	rep(i,n)scanf("%lf%lf",x+i,y+i);
	
	double ans=0;
	rep(i,n)rep(j,n){
		double dy=y[i]-y[j],
			   dx=x[i]-x[j];
		ans=max(ans,sqrt(dx*dx+dy*dy));
	}
	printf("%f\n",ans);
	return 0;
}



Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:29:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

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 33 ms 744 KB
00_sample_01.txt AC 24 ms 796 KB
00_sample_02.txt AC 23 ms 796 KB
00_sample_03.txt AC 24 ms 796 KB
00_sample_04.txt AC 24 ms 796 KB
00_sample_05.txt AC 24 ms 804 KB
01_rnd_00.txt AC 23 ms 800 KB
01_rnd_01.txt AC 24 ms 872 KB
01_rnd_02.txt AC 26 ms 788 KB
01_rnd_03.txt AC 25 ms 796 KB
01_rnd_04.txt AC 24 ms 872 KB
01_rnd_05.txt AC 25 ms 800 KB
01_rnd_06.txt AC 25 ms 796 KB
01_rnd_07.txt AC 25 ms 800 KB
01_rnd_08.txt AC 25 ms 800 KB
01_rnd_09.txt AC 26 ms 796 KB
01_rnd_10.txt AC 25 ms 796 KB
01_rnd_11.txt AC 26 ms 780 KB
01_rnd_12.txt AC 25 ms 800 KB
01_rnd_13.txt AC 25 ms 804 KB
01_rnd_14.txt AC 25 ms 800 KB
01_rnd_15.txt AC 25 ms 796 KB
01_rnd_16.txt AC 25 ms 796 KB
01_rnd_17.txt AC 24 ms 804 KB
01_rnd_18.txt AC 25 ms 796 KB
01_rnd_19.txt AC 25 ms 800 KB