Submission #8940329
Source Code Expand
#include <bits/stdc++.h> #define ll long long #define ff first #define ss second #define pb push_back using namespace std; const int N = 1e6+69, mod = 1e9+9; ll n,m,x,y,a,b,c,d,t,k,ans=1e18,cur,l,r,mx; int A[N],sum[N]; int main() { cin>>n; for(int i=1;i<=n;i++) cin>>A[i],A[i] -= i; sort(A+1,A+n+1); for(int i=1;i<=n;i++) sum[i] = sum[i-1] + A[i]; for(int i=1;i<=n;i++){ b = A[i]; ans = min(ans,b*i-sum[i]+sum[n]-sum[i]-b*(n-i)); } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Linear Approximation |
User | giorgikob |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 547 Byte |
Status | WA |
Exec Time | 119 ms |
Memory | 5120 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 | 2304 KB |
sample_02.txt | AC | 1 ms | 2304 KB |
sample_03.txt | AC | 1 ms | 2304 KB |
sample_04.txt | AC | 2 ms | 2304 KB |
subtask_1_01.txt | AC | 1 ms | 2304 KB |
subtask_1_02.txt | WA | 23 ms | 2432 KB |
subtask_1_03.txt | WA | 19 ms | 2432 KB |
subtask_1_04.txt | WA | 55 ms | 4736 KB |
subtask_1_05.txt | WA | 97 ms | 4992 KB |
subtask_1_06.txt | WA | 108 ms | 5120 KB |
subtask_1_07.txt | WA | 119 ms | 5120 KB |
subtask_1_08.txt | WA | 110 ms | 5120 KB |
subtask_1_09.txt | WA | 108 ms | 5120 KB |
subtask_1_10.txt | WA | 111 ms | 5120 KB |
subtask_1_11.txt | WA | 109 ms | 5120 KB |