Submission #2769776

Source Code Expand

import numpy as np

N = int(input())
A = list(map(int, input().split()))


for i in range(len(A)):
    A[i] -= (i + 1)

np_A = np.array(A)
b = -np.median(np_A)

np_A += b.astype("i")
res = np.abs(np_A).sum()
print(res)

Submission Info

Submission Time
Task C - Linear Approximation
User chahan69
Language Python (3.4.3)
Score 300
Code Size 232 Byte
Status AC
Exec Time 246 ms
Memory 34168 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 150 ms 12252 KiB
sample_02.txt AC 148 ms 12252 KiB
sample_03.txt AC 147 ms 12380 KiB
sample_04.txt AC 147 ms 12252 KiB
subtask_1_01.txt AC 148 ms 12252 KiB
subtask_1_02.txt AC 165 ms 16012 KiB
subtask_1_03.txt AC 163 ms 15628 KiB
subtask_1_04.txt AC 194 ms 22948 KiB
subtask_1_05.txt AC 231 ms 31220 KiB
subtask_1_06.txt AC 246 ms 33788 KiB
subtask_1_07.txt AC 244 ms 34168 KiB
subtask_1_08.txt AC 241 ms 34160 KiB
subtask_1_09.txt AC 241 ms 34088 KiB
subtask_1_10.txt AC 241 ms 34140 KiB
subtask_1_11.txt AC 242 ms 34132 KiB