Submission #2769222

Source Code Expand

n = int(input())
a = list(map(int, input().split()))
cnt = 1
b = 0
while True:
    tmp = 0
    for i in a:
        tmp += abs(i - (b + cnt))
        cnt += 1
    if b == 0:
        min_value = tmp
    else:
        if tmp <= min_value:
            min_value = tmp
        else:
            break
    b += 1

print(min_value)

Submission Info

Submission Time
Task C - Linear Approximation
User nikuzuki
Language Python (3.4.3)
Score 0
Code Size 344 Byte
Status WA
Exec Time 2104 ms
Memory 26708 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
WA × 1
AC × 6
WA × 2
TLE × 11
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 KiB
sample_02.txt AC 17 ms 2940 KiB
sample_03.txt AC 17 ms 2940 KiB
sample_04.txt WA 17 ms 2940 KiB
subtask_1_01.txt TLE 2104 ms 2940 KiB
subtask_1_02.txt TLE 2104 ms 7092 KiB
subtask_1_03.txt TLE 2104 ms 6580 KiB
subtask_1_04.txt TLE 2104 ms 14012 KiB
subtask_1_05.txt TLE 2104 ms 23020 KiB
subtask_1_06.txt TLE 2104 ms 24844 KiB
subtask_1_07.txt TLE 2104 ms 25148 KiB
subtask_1_08.txt TLE 2104 ms 26020 KiB
subtask_1_09.txt TLE 2104 ms 25156 KiB
subtask_1_10.txt TLE 2104 ms 25196 KiB
subtask_1_11.txt TLE 2104 ms 26708 KiB