Submission #2770568


Source Code Expand

Copy
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <random>
#include <cstdio>
#include <cstring>
#include <cmath>

// for i in f..<t {... : as Swift
#define forin(i, f, t) for(auto i = f; i < t; i++)

using namespace std;
using ll = long long;

int main() {
    ll n;
    cin >> n;
    vector<ll> a(n);
    for (auto i = 0; i < n; i++) {
        cin >> a[i];
        a[i] -= i;
    }
    ll minSum = 1000000000;
    for (auto i = 0; i < n; i++) {
        auto sh = a[i];
        ll sum = 0;
        for (auto j = 0; j < n; j++) {
            sum += abs(a[j] - sh);
        }
        minSum = min(sum, minSum);
    }
    cout << minSum << endl;
    
    
}

Submission Info

Submission Time
Task C - Linear Approximation
User MatsuTaku
Language C++14 (GCC 5.4.1)
Score 0
Code Size 764 Byte
Status WA
Exec Time 2103 ms
Memory 1792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 9
WA × 2
TLE × 8
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 1307 ms 512 KB
subtask_1_03.txt WA 1057 ms 512 KB
subtask_1_04.txt TLE 2103 ms 1024 KB
subtask_1_05.txt TLE 2103 ms 1536 KB
subtask_1_06.txt TLE 2103 ms 1792 KB
subtask_1_07.txt TLE 2103 ms 1792 KB
subtask_1_08.txt TLE 2103 ms 1792 KB
subtask_1_09.txt TLE 2103 ms 1792 KB
subtask_1_10.txt TLE 2103 ms 1792 KB
subtask_1_11.txt TLE 2103 ms 1792 KB