Submission #3213149

Source Code Expand

#include <algorithm>
#include <iostream>

using namespace std;
using ll = long long;

int main() {
    ll N;
    cin >> N;
    ll A[N];
    for (int i = 0; i < N; ++i) {
        cin >> A[i];
        A[i] -= i + 1;
    }

    sort(A, A + N);
    ll b = A[N / 2];

    ll ans = 0;
    for (int i = 0; i < N; ++i) {
        ans += abs(A[i] - b);
    }

    cout << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Linear Approximation
User Tiramister
Language C++14 (GCC 5.4.1)
Score 300
Code Size 417 Byte
Status AC
Exec Time 92 ms
Memory 1792 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 19
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 1 ms 256 KiB
sample_02.txt AC 1 ms 256 KiB
sample_03.txt AC 1 ms 256 KiB
sample_04.txt AC 1 ms 256 KiB
subtask_1_01.txt AC 1 ms 256 KiB
subtask_1_02.txt AC 17 ms 512 KiB
subtask_1_03.txt AC 14 ms 512 KiB
subtask_1_04.txt AC 40 ms 1024 KiB
subtask_1_05.txt AC 71 ms 1536 KiB
subtask_1_06.txt AC 80 ms 1792 KiB
subtask_1_07.txt AC 92 ms 1792 KiB
subtask_1_08.txt AC 82 ms 1792 KiB
subtask_1_09.txt AC 84 ms 1792 KiB
subtask_1_10.txt AC 82 ms 1792 KiB
subtask_1_11.txt AC 82 ms 1792 KiB