Submission #22923
Source Code Expand
#include <iostream> #include <fstream> #include <algorithm> #include <bitset> #include <cassert> #include <cctype> #include <cmath> #include <complex> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <deque> #include <iomanip> #include <map> #include <numeric> #include <queue> #include <set> #include <stack> #include <sstream> #include <string> #include <vector> using namespace std; #pragma comment(linker, "/STACK:400000000") #define EPS 1e-9 #define INF MOD #define MOD 1000000007LL #define fir first #define foreach(it,X) for(it=X.begin();it!=X.end();it++) #define iss istringstream #define ite iterator #define ll long long #define mp make_pair #define rep(i,n) rep2(i,0,n) #define rep2(i,m,n) for(int i=m;i<n;i++) #define pi pair<int,int> #define pb push_back #define sec second #define sh(i) (1LL<<i) #define sst stringstream #define sz size() #define vi vector<int> #define vc vector #define vl vector<ll> #define vs vector<string> int N,x[111],y[111]; int sq(int n){return n*n;} int main(){ cin>>N; rep(i,N)cin>>x[i]>>y[i]; int ans2=0; rep(i,N)rep(j,N){ ans2=max(ans2,sq(x[i]-x[j])+sq(y[i]-y[j])); } cout<<sqrt(ans2*1.)<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 2点間距離の最大値 ( The longest distance ) |
User | evima |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1247 Byte |
Status | AC |
Exec Time | 50 ms |
Memory | 800 KB |
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 | 21 ms | 784 KB |
00_sample_01.txt | AC | 21 ms | 784 KB |
00_sample_02.txt | AC | 21 ms | 740 KB |
00_sample_03.txt | AC | 20 ms | 788 KB |
00_sample_04.txt | AC | 22 ms | 788 KB |
00_sample_05.txt | AC | 22 ms | 664 KB |
01_rnd_00.txt | AC | 21 ms | 784 KB |
01_rnd_01.txt | AC | 21 ms | 780 KB |
01_rnd_02.txt | AC | 22 ms | 796 KB |
01_rnd_03.txt | AC | 22 ms | 764 KB |
01_rnd_04.txt | AC | 21 ms | 788 KB |
01_rnd_05.txt | AC | 50 ms | 792 KB |
01_rnd_06.txt | AC | 21 ms | 788 KB |
01_rnd_07.txt | AC | 22 ms | 764 KB |
01_rnd_08.txt | AC | 21 ms | 800 KB |
01_rnd_09.txt | AC | 22 ms | 784 KB |
01_rnd_10.txt | AC | 21 ms | 784 KB |
01_rnd_11.txt | AC | 22 ms | 760 KB |
01_rnd_12.txt | AC | 22 ms | 792 KB |
01_rnd_13.txt | AC | 22 ms | 788 KB |
01_rnd_14.txt | AC | 20 ms | 748 KB |
01_rnd_15.txt | AC | 21 ms | 792 KB |
01_rnd_16.txt | AC | 20 ms | 788 KB |
01_rnd_17.txt | AC | 21 ms | 780 KB |
01_rnd_18.txt | AC | 22 ms | 788 KB |
01_rnd_19.txt | AC | 20 ms | 780 KB |