Submission #3434688
Source Code Expand
#include <iostream> #include <math.h> #include <vector> #include <map> #include <stack> #include <queue> #include <set> #include <algorithm> #include <iomanip> #include <string.h> #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define ALL(a) (a).begin(),(a).end() typedef long long lint; using namespace std; double dist(pair<double,double> a,pair<double,double> b){ double d=(a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second); return sqrt(d); } int main(){ int N; cin>>N; pair<double,double> A[N]; pair<double,double> B[N]; REP(i,N)cin>>A[i].first>>A[i].second; REP(i,N)cin>>B[i].first>>B[i].second; pair<double,double> GA; GA=make_pair(0,0); REP(i,N){ GA.first+=A[i].first; GA.second+=A[i].second; } GA.first/=N; GA.second/=N; pair<double,double> GB; GB=make_pair(0,0); REP(i,N){ GB.first+=B[i].first; GB.second+=B[i].second; } GB.first/=N; GB.second/=N; double MA=0; double MB=0; REP(i,N)MA=max(MA,dist(GA,A[i])); REP(i,N)MB=max(MB,dist(GB,B[i])); cout<<fixed<<setprecision(7)<<MB/MA<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Big Bang |
User | tsjmt |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1189 Byte |
Status | AC |
Exec Time | 209 ms |
Memory | 3328 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 50 / 50 | 50 / 50 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
Subtask1 | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt |
Subtask2 | sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 5 ms | 256 KB |
subtask1_02.txt | AC | 2 ms | 256 KB |
subtask1_03.txt | AC | 5 ms | 256 KB |
subtask1_04.txt | AC | 6 ms | 384 KB |
subtask1_05.txt | AC | 4 ms | 256 KB |
subtask1_06.txt | AC | 4 ms | 256 KB |
subtask1_07.txt | AC | 3 ms | 256 KB |
subtask1_08.txt | AC | 6 ms | 256 KB |
subtask1_09.txt | AC | 6 ms | 256 KB |
subtask1_10.txt | AC | 2 ms | 256 KB |
subtask1_11.txt | AC | 4 ms | 256 KB |
subtask1_12.txt | AC | 7 ms | 384 KB |
subtask1_13.txt | AC | 3 ms | 256 KB |
subtask1_14.txt | AC | 3 ms | 256 KB |
subtask1_15.txt | AC | 7 ms | 384 KB |
subtask1_16.txt | AC | 7 ms | 384 KB |
subtask1_17.txt | AC | 7 ms | 384 KB |
subtask1_18.txt | AC | 7 ms | 384 KB |
subtask1_19.txt | AC | 7 ms | 384 KB |
subtask1_20.txt | AC | 7 ms | 384 KB |
subtask1_21.txt | AC | 7 ms | 384 KB |
subtask1_22.txt | AC | 7 ms | 384 KB |
subtask1_23.txt | AC | 7 ms | 384 KB |
subtask1_24.txt | AC | 7 ms | 384 KB |
subtask1_25.txt | AC | 7 ms | 384 KB |
subtask1_26.txt | AC | 7 ms | 384 KB |
subtask1_27.txt | AC | 7 ms | 384 KB |
subtask1_28.txt | AC | 7 ms | 384 KB |
subtask1_29.txt | AC | 7 ms | 384 KB |
subtask2_01.txt | AC | 147 ms | 2560 KB |
subtask2_02.txt | AC | 6 ms | 384 KB |
subtask2_03.txt | AC | 31 ms | 768 KB |
subtask2_04.txt | AC | 95 ms | 1664 KB |
subtask2_05.txt | AC | 2 ms | 256 KB |
subtask2_06.txt | AC | 26 ms | 640 KB |
subtask2_07.txt | AC | 106 ms | 1920 KB |
subtask2_08.txt | AC | 150 ms | 2560 KB |
subtask2_09.txt | AC | 99 ms | 1792 KB |
subtask2_10.txt | AC | 136 ms | 2304 KB |
subtask2_11.txt | AC | 104 ms | 1920 KB |
subtask2_12.txt | AC | 166 ms | 2816 KB |
subtask2_13.txt | AC | 48 ms | 1024 KB |
subtask2_14.txt | AC | 128 ms | 2176 KB |
subtask2_15.txt | AC | 205 ms | 3328 KB |
subtask2_16.txt | AC | 201 ms | 3328 KB |
subtask2_17.txt | AC | 199 ms | 3328 KB |
subtask2_18.txt | AC | 203 ms | 3328 KB |
subtask2_19.txt | AC | 203 ms | 3328 KB |
subtask2_20.txt | AC | 203 ms | 3328 KB |
subtask2_21.txt | AC | 196 ms | 3328 KB |
subtask2_22.txt | AC | 193 ms | 3328 KB |
subtask2_23.txt | AC | 196 ms | 3328 KB |
subtask2_24.txt | AC | 209 ms | 3328 KB |
subtask2_25.txt | AC | 198 ms | 3328 KB |
subtask2_26.txt | AC | 193 ms | 3328 KB |
subtask2_27.txt | AC | 194 ms | 3328 KB |
subtask2_28.txt | AC | 194 ms | 3328 KB |
subtask2_29.txt | AC | 194 ms | 3328 KB |