Submission #2777383

Source Code Expand

n = int(input())
a = list(map(int, input().split()))
for i in range(n): a[i] -= i + 1
a.sort()
b = a[(n - 1) // 2]
ans = 0
for i in range(n): ans += abs(a[i] - b)
print(ans)

Submission Info

Submission Time
Task C - Linear Approximation
User rankey55
Language Python (3.4.3)
Score 300
Code Size 180 Byte
Status AC
Exec Time 240 ms
Memory 25200 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 18 ms 2940 KiB
sample_02.txt AC 18 ms 2940 KiB
sample_03.txt AC 18 ms 3060 KiB
sample_04.txt AC 17 ms 3060 KiB
subtask_1_01.txt AC 18 ms 3060 KiB
subtask_1_02.txt AC 52 ms 7000 KiB
subtask_1_03.txt AC 39 ms 6708 KiB
subtask_1_04.txt AC 83 ms 14012 KiB
subtask_1_05.txt AC 136 ms 22156 KiB
subtask_1_06.txt AC 131 ms 24844 KiB
subtask_1_07.txt AC 240 ms 25156 KiB
subtask_1_08.txt AC 145 ms 25156 KiB
subtask_1_09.txt AC 147 ms 25148 KiB
subtask_1_10.txt AC 154 ms 25200 KiB
subtask_1_11.txt AC 142 ms 25196 KiB