Submission #5910160
Source Code Expand
n=int(input()) l=list(map(int,input().split())) for i in range(n): l[i]-=i+1 l.sort() b=l[n//2] print(sum([abs(i-b) for i in l]))
Submission Info
Submission Time | |
---|---|
Task | C - Linear Approximation |
User | amyu |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 139 Byte |
Status | AC |
Exec Time | 215 ms |
Memory | 25196 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 17 ms | 3060 KB |
sample_02.txt | AC | 17 ms | 2940 KB |
sample_03.txt | AC | 17 ms | 2940 KB |
sample_04.txt | AC | 17 ms | 2940 KB |
subtask_1_01.txt | AC | 17 ms | 2940 KB |
subtask_1_02.txt | AC | 46 ms | 7092 KB |
subtask_1_03.txt | AC | 35 ms | 6580 KB |
subtask_1_04.txt | AC | 69 ms | 14020 KB |
subtask_1_05.txt | AC | 114 ms | 22156 KB |
subtask_1_06.txt | AC | 120 ms | 24844 KB |
subtask_1_07.txt | AC | 215 ms | 25148 KB |
subtask_1_08.txt | AC | 118 ms | 25156 KB |
subtask_1_09.txt | AC | 130 ms | 25156 KB |
subtask_1_10.txt | AC | 125 ms | 25072 KB |
subtask_1_11.txt | AC | 118 ms | 25196 KB |