Submission #5905610
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x,y) scanf("%llu%llu", &x, &y)
#define Scll3(x,y,z) scanf("%llu%llu%llu", &x, &y, &z)
#define Scc(c) scanf("%c", &c);
#define Scs(s) scanf("%s", s);
#define Scstr(s) scanf("%s", &s);
// }}} 2
// constants {{{ 2
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// }}} 2
// systems {{{ 2
#define Rep(x,y) for(int x = 0; x < y; x++)
#define Repe(x,y,z) for(int x = z; x < y; x++)
// }}} 2
// output {{{ 2
#define YesNo(a) (a)?printf("Yes\n"):printf("No\n");
// }}} 2
// }}} 1
int main() {
int N;
Scd(N);
vector<ll> a(N);
ll tmp = 0;
Rep(i,N){
Scll(a[i]);
a[i] -= i+1;
}
sort( a.begin(), a.end() );
Rep(i,N){
tmp += a[i] - a[0];
}
ll ans = tmp;
Repe(i,N,1){
tmp -= (a[i] - a[i-1]) * ( N-i*2 );
ans = min( ans, tmp );
}
printf ("%lld\n", ans);
return 0;
}
Submission Info
Submission Time
2019-06-14 17:08:43+0900
Task
C - Linear Approximation
User
nishionyama
Language
C++14 (GCC 5.4.1)
Score
300
Code Size
1209 Byte
Status
AC
Exec Time
38 ms
Memory
1792 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:41:11: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
Scd(N);
^
./Main.cpp:45:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
Scll(a[i]);
^
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
8 ms
512 KB
subtask_1_03.txt
AC
5 ms
512 KB
subtask_1_04.txt
AC
14 ms
1024 KB
subtask_1_05.txt
AC
23 ms
1536 KB
subtask_1_06.txt
AC
26 ms
1792 KB
subtask_1_07.txt
AC
38 ms
1792 KB
subtask_1_08.txt
AC
27 ms
1792 KB
subtask_1_09.txt
AC
27 ms
1792 KB
subtask_1_10.txt
AC
27 ms
1792 KB
subtask_1_11.txt
AC
27 ms
1792 KB