Submission #8954216


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
        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 0
Code Size 357 Byte
Status RE
Exec Time 174 ms
Memory 38256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
RE × 4
RE × 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 RE 160 ms 38256 KB
sample_02.txt RE 162 ms 38256 KB
sample_03.txt RE 163 ms 38256 KB
sample_04.txt RE 164 ms 38256 KB
subtask_1_01.txt RE 174 ms 38256 KB
subtask_1_02.txt RE 166 ms 38256 KB
subtask_1_03.txt RE 161 ms 38256 KB
subtask_1_04.txt RE 161 ms 38256 KB
subtask_1_05.txt RE 162 ms 38256 KB
subtask_1_06.txt RE 162 ms 38256 KB
subtask_1_07.txt RE 161 ms 38256 KB
subtask_1_08.txt RE 160 ms 38256 KB
subtask_1_09.txt RE 163 ms 38256 KB
subtask_1_10.txt RE 162 ms 38256 KB
subtask_1_11.txt RE 162 ms 38256 KB