Submission #8954219


Source Code Expand

import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n = int(readline())
    a = list(map(int, readline().split()))
    for i in range(n):
        a[i] -= i + 1
    a.sort()
    t1 = 0
    t2 = 0
    for i in range(n):
        t1 += abs(a[i] - a[n//2])
        t2 += abs(a[i] - a[n//2 - 1])
    print(min(t1, t2))


if __name__ == '__main__':
    solve()

Submission Info

Submission Time
Task C - Linear Approximation
User XXXHOLiC
Language PyPy3 (2.4.0)
Score 300
Code Size 416 Byte
Status AC
Exec Time 269 ms
Memory 73840 KB

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 161 ms 38256 KB
sample_02.txt AC 163 ms 38256 KB
sample_03.txt AC 161 ms 38324 KB
sample_04.txt AC 162 ms 38256 KB
subtask_1_01.txt AC 165 ms 38256 KB
subtask_1_02.txt AC 191 ms 44656 KB
subtask_1_03.txt AC 179 ms 43120 KB
subtask_1_04.txt AC 200 ms 56816 KB
subtask_1_05.txt AC 226 ms 73328 KB
subtask_1_06.txt AC 233 ms 73712 KB
subtask_1_07.txt AC 269 ms 73712 KB
subtask_1_08.txt AC 236 ms 73712 KB
subtask_1_09.txt AC 239 ms 73840 KB
subtask_1_10.txt AC 239 ms 73712 KB
subtask_1_11.txt AC 234 ms 73712 KB