Submission #2363578


Source Code Expand

#include<cstdio>
#include<cmath>
#define dd double
using namespace std;
struct cp{
	dd x,y;
}e[105];
int min(dd a,dd b){return a<b?a:b;}
int sq(dd x){return x*x;}
int dist(dd ax,dd ay,dd bx,dd by){return sq(bx-ax)+sq(by-ay);}
int main(){
	int n,minn=0x3fffffff;
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%lf%lf",&e[i].x,&e[i].y);
	for(int i=1;i<=n;i++) for(int j=i+1;j<=n;j++)
		minn=min(minn,dist(e[i].x,e[i].y,e[j].x,e[j].y));
	printf("%.3lf\n",sqrt(minn));
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:13:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:14:55: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%lf%lf",&e[i].x,&e[i].y);
                                                       ^

Judge Result

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