Submission #3609389
Source Code Expand
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a(n); for (int i=0; i<n; i++) { cin >> a[i]; } for (int i=0; i<n; i++) { a[i] -= i+1; } sort(a.begin(), a.end()); int b = a[a.size()/2]; int ans = 0; for (int i=0; i<n; i++) { ans += abs(a[i] - b); } int sum = 0; b = b + 1; for (int i=0; i<n; i++) { sum += abs(a[i] - b); } if (ans > sum) { sum = ans; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Linear Approximation |
User | ytoda129 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 534 Byte |
Status | WA |
Exec Time | 93 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 | 19 ms | 384 KB |
subtask_1_03.txt | WA | 15 ms | 384 KB |
subtask_1_04.txt | WA | 41 ms | 640 KB |
subtask_1_05.txt | WA | 72 ms | 896 KB |
subtask_1_06.txt | AC | 81 ms | 1024 KB |
subtask_1_07.txt | WA | 93 ms | 1024 KB |
subtask_1_08.txt | WA | 83 ms | 1024 KB |
subtask_1_09.txt | WA | 82 ms | 1024 KB |
subtask_1_10.txt | WA | 83 ms | 1024 KB |
subtask_1_11.txt | AC | 83 ms | 1024 KB |