Submission #3597234
Source Code Expand
#include <iostream> #include <algorithm> #include <math.h> using namespace std; long long n, eye, med, ans = 0; long long mylist[200001]; int main() { cin>>n; for(int i = 1; i <= n; i++) { cin>>eye; mylist[i] = eye - i; } sort(mylist+1, mylist+n+1); med = mylist[(n+1)/2]; for(int i = 1; i <= n; i++) ans += abs(mylist[i] - med); cout<<ans; }
Submission Info
Submission Time | |
---|---|
Task | C - Linear Approximation |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 400 Byte |
Status | AC |
Exec Time | 93 ms |
Memory | 1792 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
sample_04.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 18 ms | 512 KB |
subtask_1_03.txt | AC | 15 ms | 512 KB |
subtask_1_04.txt | AC | 41 ms | 1024 KB |
subtask_1_05.txt | AC | 72 ms | 1536 KB |
subtask_1_06.txt | AC | 80 ms | 1792 KB |
subtask_1_07.txt | AC | 93 ms | 1792 KB |
subtask_1_08.txt | AC | 85 ms | 1792 KB |
subtask_1_09.txt | AC | 81 ms | 1792 KB |
subtask_1_10.txt | AC | 82 ms | 1792 KB |
subtask_1_11.txt | AC | 82 ms | 1792 KB |