Submission #2816247


Source Code Expand

# include <bits/stdc++.h>
using namespace std;
const int N=105;
int n, m, x[N], y[N]; double dis[N][N], mx; 
int main () {
	cin >> n;
	for (int i=1; i<=n; i++)
		cin >> x[i] >> y[i];
	for (int i=1; i<=n; i++)
		for (int j=1; j<=n; j++)
			dis[i][j]=sqrt ((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
	for (int i=1; i<=n; i++) {
		double ans=0.0;
		for (int j=1; j<=n; j++)
			ans=max (ans, dis[i][j]);
		mx=max (mx, ans);
	} cout << mx << endl;
	return 0;
}

Submission Info

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