Submission #457594
Source Code Expand
#include<bits/stdc++.h> #include<vector> #include<list> #include<stack> #include<queue> #include<algorithm> using namespace std; int main(){ int N,x,y; double ans=-1.0; scanf("%d",&N); int lst[N][2]; for(int i=0;i<N;i++){ scanf("%d %d",&x,&y); lst[i][0]=x; lst[i][1]=y; } for(int i=0;i<N-1;i++){ for(int j=i+1;j<N;j++){ int x1=lst[j][1]-lst[i][1]; int y1=lst[j][0]-lst[i][0]; double tmp=sqrt(x1*x1+y1*y1); if(ans<tmp) ans=tmp; } } printf("%.10lf\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 2点間距離の最大値 ( The longest distance ) |
User | nyon |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 626 Byte |
Status | AC |
Exec Time | 42 ms |
Memory | 928 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:13:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&N); ^ ./Main.cpp:16:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d",&x,&y); ^
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 | 24 ms | 800 KB |
00_sample_01.txt | AC | 35 ms | 676 KB |
00_sample_02.txt | AC | 42 ms | 768 KB |
00_sample_03.txt | AC | 30 ms | 660 KB |
00_sample_04.txt | AC | 38 ms | 796 KB |
00_sample_05.txt | AC | 26 ms | 800 KB |
01_rnd_00.txt | AC | 25 ms | 672 KB |
01_rnd_01.txt | AC | 24 ms | 928 KB |
01_rnd_02.txt | AC | 25 ms | 812 KB |
01_rnd_03.txt | AC | 26 ms | 800 KB |
01_rnd_04.txt | AC | 25 ms | 796 KB |
01_rnd_05.txt | AC | 26 ms | 804 KB |
01_rnd_06.txt | AC | 25 ms | 676 KB |
01_rnd_07.txt | AC | 26 ms | 800 KB |
01_rnd_08.txt | AC | 30 ms | 928 KB |
01_rnd_09.txt | AC | 23 ms | 680 KB |
01_rnd_10.txt | AC | 26 ms | 676 KB |
01_rnd_11.txt | AC | 25 ms | 804 KB |
01_rnd_12.txt | AC | 23 ms | 676 KB |
01_rnd_13.txt | AC | 24 ms | 800 KB |
01_rnd_14.txt | AC | 24 ms | 676 KB |
01_rnd_15.txt | AC | 24 ms | 676 KB |
01_rnd_16.txt | AC | 26 ms | 804 KB |
01_rnd_17.txt | AC | 26 ms | 800 KB |
01_rnd_18.txt | AC | 25 ms | 720 KB |
01_rnd_19.txt | AC | 26 ms | 788 KB |