Submission #3249492


Source Code Expand

#include <iostream>
//#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<utility>
#include<numeric>
#include<functional>
#include<algorithm>
#include<queue>
#include<map>
#include<string>

#define FOR(i, a, b) for(int i=a; i<b; i++)
#define COUT(a) cout << a << endl;

using namespace std;
using Int = long long;
using P = pair<Int, Int>;

int main() {
    Int a,ans;

    //Int buf[3];
    cin >> a;

    Int b[a],c[a];

    FOR(i, 0, a)
        cin >> b[i];

    FOR(j,0,a) {
        c[j] = abs(b[a] - a);
        ans += c[j];
    }

    Int ansA = Int(ans/a + 0.5);

    Int ansB;

    FOR(z,0,a){
        ansB += abs(c[z] - (ansA + z));
    }

    cout << ansB << endl;

    return 0;
}

Submission Info

Submission Time
Task C - Linear Approximation
User odappe
Language C++14 (GCC 5.4.1)
Score 0
Code Size 754 Byte
Status WA
Exec Time 83 ms
Memory 3328 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
WA × 4
AC × 1
WA × 18
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 WA 1 ms 256 KB
sample_02.txt WA 1 ms 256 KB
sample_03.txt WA 1 ms 256 KB
sample_04.txt WA 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt WA 16 ms 768 KB
subtask_1_03.txt WA 16 ms 768 KB
subtask_1_04.txt WA 40 ms 1792 KB
subtask_1_05.txt WA 70 ms 2944 KB
subtask_1_06.txt WA 78 ms 3328 KB
subtask_1_07.txt WA 80 ms 3328 KB
subtask_1_08.txt WA 80 ms 3328 KB
subtask_1_09.txt WA 80 ms 3328 KB
subtask_1_10.txt WA 83 ms 3328 KB
subtask_1_11.txt WA 80 ms 3328 KB