Submission #3017447
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 dis(int i,int j){ int xx=x[i]-x[j],yy=y[i]-y[j]; return sqrt(xx*xx+yy*yy); } double max(double a,double b){ return a>b?a:b; } int main(){ int n; double ans; scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d %d",&x[i],&y[i]); for(int i=1;i<n;i++) for(int j=i+1;j<=n;j++) ans=max(ans,dis(i,j)); printf("%.6f",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 2点間距離の最大値 ( The longest distance ) |
User | luogu_bot4 |
Language | C++ (GCC 5.4.1) |
Score | 100 |
Code Size | 645 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:24:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:26:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d",&x[i],&y[i]); ^
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
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 | 256 KB |
01_rnd_01.txt | AC | 1 ms | 256 KB |
01_rnd_02.txt | AC | 1 ms | 256 KB |
01_rnd_03.txt | AC | 1 ms | 256 KB |
01_rnd_04.txt | AC | 1 ms | 256 KB |
01_rnd_05.txt | AC | 1 ms | 256 KB |
01_rnd_06.txt | AC | 1 ms | 256 KB |
01_rnd_07.txt | AC | 1 ms | 256 KB |
01_rnd_08.txt | AC | 1 ms | 256 KB |
01_rnd_09.txt | AC | 1 ms | 256 KB |
01_rnd_10.txt | AC | 1 ms | 256 KB |
01_rnd_11.txt | AC | 1 ms | 256 KB |
01_rnd_12.txt | AC | 1 ms | 256 KB |
01_rnd_13.txt | AC | 1 ms | 256 KB |
01_rnd_14.txt | AC | 1 ms | 256 KB |
01_rnd_15.txt | AC | 1 ms | 256 KB |
01_rnd_16.txt | AC | 1 ms | 256 KB |
01_rnd_17.txt | AC | 1 ms | 256 KB |
01_rnd_18.txt | AC | 1 ms | 256 KB |
01_rnd_19.txt | AC | 1 ms | 256 KB |