Submission #8943591


Source Code Expand

import java.util.Scanner;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int a[] = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt() - i;
        }
        // sum( abs(a[i] - b) )を最小化する
        sc.close();
        // 中央値をとる
        int midNum;
        if (n % 2 == 0) {
            midNum = (a[n / 2] + a[n / 2 - 1]) / 2;
        } else {
            midNum = a[n / 2];
        }
        int ans = 0;
        for (int i = 0; i < n; i++) {
            ans += Math.abs(a[i] - midNum);
        }
        System.out.println(ans);
    }
}

Submission Info

Submission Time
Task C - Linear Approximation
User topaz13
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 711 Byte
Status WA
Exec Time 604 ms
Memory 65124 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 11
WA × 8
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt
Case Name Status Exec Time Memory
sample_01.txt AC 111 ms 19156 KB
sample_02.txt AC 92 ms 21204 KB
sample_03.txt AC 91 ms 19796 KB
sample_04.txt AC 93 ms 18772 KB
subtask_1_01.txt AC 91 ms 19796 KB
subtask_1_02.txt WA 320 ms 44288 KB
subtask_1_03.txt WA 312 ms 40340 KB
subtask_1_04.txt WA 458 ms 47644 KB
subtask_1_05.txt WA 557 ms 61216 KB
subtask_1_06.txt AC 604 ms 64956 KB
subtask_1_07.txt WA 585 ms 65124 KB
subtask_1_08.txt WA 591 ms 61720 KB
subtask_1_09.txt WA 566 ms 63460 KB
subtask_1_10.txt WA 572 ms 62584 KB
subtask_1_11.txt AC 564 ms 62800 KB