Submission #2783376

Source Code Expand

let n = int (stdin.ReadLine())
let a = stdin.ReadLine().Split() |> Array.mapi (fun i x -> int64 x - int64 i - 1L) |> Array.sort
let b = if n % 2 = 0 then (a.[n / 2] + a.[n / 2 - 1]) / 2L else a.[n / 2]
printfn "%d" (Array.sumBy (fun x -> abs (x - b)) a)

Submission Info

Submission Time
Task C - Linear Approximation
User gunmaken
Language F# (Mono 4.0)
Score 300
Code Size 256 Byte
Status AC
Exec Time 207 ms
Memory 35328 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 58 ms 10840 KiB
sample_02.txt AC 58 ms 10844 KiB
sample_03.txt AC 57 ms 12892 KiB
sample_04.txt AC 58 ms 12892 KiB
subtask_1_01.txt AC 42 ms 11996 KiB
subtask_1_02.txt AC 84 ms 13276 KiB
subtask_1_03.txt AC 77 ms 15068 KiB
subtask_1_04.txt AC 114 ms 21468 KiB
subtask_1_05.txt AC 169 ms 35328 KiB
subtask_1_06.txt AC 178 ms 29452 KiB
subtask_1_07.txt AC 207 ms 28348 KiB
subtask_1_08.txt AC 177 ms 26300 KiB
subtask_1_09.txt AC 178 ms 30396 KiB
subtask_1_10.txt AC 177 ms 30108 KiB
subtask_1_11.txt AC 182 ms 30108 KiB