Submission #2766101
Source Code Expand
/** * File : C.cpp * Author : Kazune Takahashi * Created : 2018-7-1 20:31:24 * Powered by Visual Studio Code */ #include <iostream> #include <iomanip> // << fixed << setprecision(xxx) #include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ; #include <vector> #include <string> // to_string(nnn) // substr(m, n) // stoi(nnn) #include <complex> #include <tuple> #include <queue> #include <stack> #include <map> // if (M.find(key) != M.end()) { } #include <set> #include <random> // random_device rd; mt19937 mt(rd()); #include <chrono> // std::chrono::system_clock::time_point start_time, end_time; // start = std::chrono::system_clock::now(); // double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count(); #include <cctype> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> using namespace std; #define DEBUG 0 // change 0 -> 1 if we need debug. typedef long long ll; // const int dx[4] = {1, 0, -1, 0}; // const int dy[4] = {0, 1, 0, -1}; // const int C = 1e6+10; // const ll M = 1000000007; int N; ll A[200010]; int main() { cin >> N; for (auto i = 0; i < N; i++) { cin >> A[i]; A[i] -= i + 1; } sort(A, A + N); ll b = A[N / 2]; ll ans = 0; for (auto i = 0; i < N; i++) { ans += abs(A[i] - b); } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Linear Approximation |
User | kazunetakahashi |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1408 Byte |
Status | AC |
Exec Time | 92 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 | 17 ms | 512 KB |
subtask_1_03.txt | AC | 15 ms | 512 KB |
subtask_1_04.txt | AC | 40 ms | 1024 KB |
subtask_1_05.txt | AC | 72 ms | 1536 KB |
subtask_1_06.txt | AC | 79 ms | 1792 KB |
subtask_1_07.txt | AC | 92 ms | 1792 KB |
subtask_1_08.txt | AC | 82 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 |