Submission #4050794
Source Code Expand
#include <bits/stdc++.h> // g++ -std=c++14 -o a a.cpp using namespace std; typedef pair<int, int> P; typedef long long ll; #define rep(i, n) for(int i = 0; i < (n); i++) #define repto(i, n) for(int i = 0; i <= (n); i++) #define all(c) (c).begin(), (c).end() #define uniq(c) c.erase(unique(all(c)), (c).end()) #define _1 first #define _2 second #define pb push_back #define INF 1145141919 #define MOD 1000000007 #define DEBUG(x) cout << #x << ": " << x << endl; int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; __attribute__((constructor)) void initial() { cin.tie(0); ios::sync_with_stdio(false); } int main() { int N; cin >> N; vector<complex<long double>> P; rep(i, N) { long double x, y; cin >> x >> y; complex<long double> c(x, y); P.pb(c); } long double result = 0.0; rep(i, N) { rep(j, N) { result = max(result, abs(P[i] - P[j])); } } cout << result << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 2点間距離の最大値 ( The longest distance ) |
User | sifue |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1021 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 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 | 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 | 2 ms | 256 KB |
01_rnd_01.txt | AC | 2 ms | 256 KB |
01_rnd_02.txt | AC | 2 ms | 256 KB |
01_rnd_03.txt | AC | 2 ms | 256 KB |
01_rnd_04.txt | AC | 2 ms | 256 KB |
01_rnd_05.txt | AC | 2 ms | 256 KB |
01_rnd_06.txt | AC | 2 ms | 256 KB |
01_rnd_07.txt | AC | 2 ms | 256 KB |
01_rnd_08.txt | AC | 2 ms | 256 KB |
01_rnd_09.txt | AC | 2 ms | 256 KB |
01_rnd_10.txt | AC | 2 ms | 256 KB |
01_rnd_11.txt | AC | 2 ms | 256 KB |
01_rnd_12.txt | AC | 2 ms | 256 KB |
01_rnd_13.txt | AC | 2 ms | 256 KB |
01_rnd_14.txt | AC | 2 ms | 256 KB |
01_rnd_15.txt | AC | 2 ms | 256 KB |
01_rnd_16.txt | AC | 2 ms | 256 KB |
01_rnd_17.txt | AC | 2 ms | 256 KB |
01_rnd_18.txt | AC | 2 ms | 256 KB |
01_rnd_19.txt | AC | 2 ms | 256 KB |