Submission #3597992
Source Code Expand
#include <bits/stdc++.h> using namespace std; int a[200009]; int main() { int n; int m=0; cin>> n; for (int i=1;i<=n;i++) { int as; cin >>as; a[i]=as-i; m=m+a[i]; } m=m/n; int mi; int ma; mi=ma=0; int no=0; for (int i=1;i<=n;i++) { no=no+abs(a[i]-m); ma=ma+abs(a[i]-m-1); mi=mi+abs(a[i]-m+1); } if(no<=ma&&no<=mi) { cout<<no; } else if(no>ma) { cout<<ma; }else if(no>mi) { cout<<mi; } }
Submission Info
Submission Time | |
---|---|
Task | C - Linear Approximation |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 572 Byte |
Status | WA |
Exec Time | 107 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 20 ms | 384 KB |
subtask_1_03.txt | WA | 19 ms | 384 KB |
subtask_1_04.txt | WA | 53 ms | 640 KB |
subtask_1_05.txt | WA | 93 ms | 896 KB |
subtask_1_06.txt | WA | 104 ms | 1024 KB |
subtask_1_07.txt | WA | 106 ms | 1024 KB |
subtask_1_08.txt | WA | 105 ms | 1024 KB |
subtask_1_09.txt | WA | 106 ms | 1024 KB |
subtask_1_10.txt | WA | 106 ms | 1024 KB |
subtask_1_11.txt | WA | 107 ms | 1024 KB |