Submission #8943872


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];
        }
        long ans = 0;
        for (int i = 0; i < n; i++) {
            ans = 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 717 Byte
Status WA
Exec Time 594 ms
Memory 63160 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 17
WA × 2
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 92 ms 19412 KB
sample_02.txt AC 92 ms 18640 KB
sample_03.txt AC 93 ms 21204 KB
sample_04.txt AC 92 ms 21076 KB
subtask_1_01.txt AC 97 ms 23252 KB
subtask_1_02.txt WA 301 ms 39728 KB
subtask_1_03.txt AC 305 ms 38364 KB
subtask_1_04.txt AC 454 ms 51460 KB
subtask_1_05.txt AC 555 ms 62824 KB
subtask_1_06.txt AC 569 ms 63160 KB
subtask_1_07.txt WA 591 ms 62212 KB
subtask_1_08.txt AC 576 ms 62668 KB
subtask_1_09.txt AC 560 ms 62316 KB
subtask_1_10.txt AC 594 ms 60876 KB
subtask_1_11.txt AC 585 ms 63124 KB