Submission #2664746


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>

using namespace std;

int main(){
    int N(0);
    cin >> N;
    vector<vector<int>> v(0);
    for(int i(0); i < N; ++i){
        int a, b;
        scanf("%d %d", &a, &b);
        vector<int> vv = { a, b };
        v.emplace_back(vv);
    }
    double l(0);
    for (int i(0); i < N; ++i){
        for (int j(0); j < N; ++j){
            l = max(l, pow(pow(v[i][0] - v[j][0], 2) + pow(v[i][1] - v[j][1], 2), 0.5));
        }
    }
    printf("%f\n", l);
}

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User taku0728
Language C++14 (GCC 5.4.1)
Score 100
Code Size 558 Byte
Status AC
Exec Time 2 ms
Memory 512 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:14:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &a, &b);
                               ^

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 26
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 2 ms 512 KB
00_sample_01.txt AC 1 ms 384 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