Submission #1818964


Source Code Expand

Copy
#include <stdlib.h>
#include <stdio.h>
#include <math.h>

#define rep(n, i) for(int i = 0; i < n; i+=2)

double len2(double a0, double b0, double a1, double b1){
    return ((a0 - a1) * (a0 - a1) + (b0 - b1) * (b0 - b1));
}

void solve(void){
    int n;
    scanf("%d\n", &n);
    double point[2*n];
    rep(2*n,i) {
        scanf("%lf %lf\n", &point[i],&point[i+1]);
    }
    double max_len = 0;
    rep(2*n,i) {
        double x0 = point[i];
        double y0 = point[i+1];
        rep(2*n-i-2,j) {
            double x1 = point[j+i+2];
            double y1 = point[j+i+3];
            if (max_len < len2(x0, y0, x1, y1)) max_len = len2(x0, y0, x1, y1);
        }
    }
    double ans = sqrt(max_len);
    printf("%lf\n", ans);
}

int main(void){
    solve();
    return 0;
}

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User sifi_border
Language C (GCC 5.4.1)
Score 100
Code Size 815 Byte
Status
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.c: In function ‘solve’:
./Main.c:13:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d\n", &n);
     ^
./Main.c:16:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lf %lf\n", &point[i],&point[i+1]);
         ^

Judge Result

Set Name Score / Max Score Test Cases
All 100 / 100 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 1 ms 128 KB
00_sample_01.txt 1 ms 128 KB
00_sample_02.txt 1 ms 128 KB
00_sample_03.txt 1 ms 128 KB
00_sample_04.txt 1 ms 128 KB
00_sample_05.txt 1 ms 128 KB
01_rnd_00.txt 1 ms 128 KB
01_rnd_01.txt 1 ms 128 KB
01_rnd_02.txt 1 ms 128 KB
01_rnd_03.txt 1 ms 128 KB
01_rnd_04.txt 1 ms 128 KB
01_rnd_05.txt 1 ms 128 KB
01_rnd_06.txt 1 ms 128 KB
01_rnd_07.txt 1 ms 128 KB
01_rnd_08.txt 1 ms 128 KB
01_rnd_09.txt 1 ms 128 KB
01_rnd_10.txt 1 ms 128 KB
01_rnd_11.txt 1 ms 128 KB
01_rnd_12.txt 1 ms 128 KB
01_rnd_13.txt 1 ms 128 KB
01_rnd_14.txt 1 ms 128 KB
01_rnd_15.txt 1 ms 128 KB
01_rnd_16.txt 1 ms 128 KB
01_rnd_17.txt 1 ms 128 KB
01_rnd_18.txt 1 ms 128 KB
01_rnd_19.txt 1 ms 128 KB