Submission #3017425


Source Code Expand

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<queue>
#include<stack>
#include<list>
#include<set>
#include<cstring>
#include<string>
using namespace std;
int x[105],y[105];
double far(int a,int b,int c,int d){
	double t1=(a-c)*1.0*(a-c),t2=(b-d)*1.0*(b-d);
	return sqrt(t1+t2);
}
int main(){
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
    	scanf("%d",&x[i],&y[i]);
    }
    double ans=10000000.0,s;
    for(int i=1;i<=n;i++){
    	for(int j=i+1;j<=n;j++){
    		s=far(x[i],y[i],x[j],y[j]);
			if(s<ans)ans=s; 
    	}
    }
    printf("%.6lf",ans);
    return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:22:28: warning: too many arguments for format [-Wformat-extra-args]
      scanf("%d",&x[i],&y[i]);
                            ^
./Main.cpp:20:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
./Main.cpp:22:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
      scanf("%d",&x[i],&y[i]);
                             ^

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